A general method for locally optimal search

  • Authors:

  • Allen J. Friedman

  • Affiliations:

  • Rochester Institute of Technology, One Lomb Memorial Drive, Rochester, New York

  • Venue:
  • APL '79 Proceedings of the international conference on APL: part 1
  • Year:
  • 1979

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes a general search procedure for finding a best member of a large discrete set of solutions. The Traveling Salesperson Problem illustrates how the method is used. Two APL functions contain the core of the method. NEXTSET implements the user's definition of the neighborhood of a solution while WHATNOW expresses the search strategy to be employed. WHATNOW can incorporate any calculations, or system or session parameters available to the function as the search progresses, and it passes its determination on to NEXTSET which dynamically expands and contracts the scope of the search.