Location of Repository

Complete local search with memory

By G. Sierksma and D. Ghosh


Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart from tabu search, most of these heuristics are memoryless. In this paper we introduce a new neighborhood search heuristic that makes effctive use of memory structures in a way that is different from tabu search. We report computational experiments with this heuristic on the traveling salesperson problem and the subset sum problem.

OAI identifier:

Suggested articles



  1. (1979). Computers and intractability: A guide to the theory of NP-completeness.
  2. (1998). Heuristics for knapsack problems: Comparative survey and sensitivity analysis”. Fellowship Dissertation,
  3. (1991). Optimization by simulated annealing: An experimental evaluation. Part II, graph coloring and number partitioning”.
  4. (1994). performanceon the symmetric travelingsalesman problem”.
  5. (1989). Simulated annealing and Boltzmann Machines.
  6. (1990). Tabu search—A tutorial”.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.