Complete Local Search with Memory

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 effective 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.

• Type: Journal
• Year: 2002
• Where: HEURISTICS
• Authors: Diptesh Ghosh, Gerard Sierksma
• Keywords: Discrete Optimization Problems, HEURISTICS 2002, Neighborhood Search Heuristic, Tabu Search