Skip to main content
SpringerLink
Log in

Complete Local Search with Memory

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

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 that in common implementations of tabu search. We report computational experiments with this heuristic on the traveling salesperson problem and the subset sum problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Aarts, E.H.L. and J.H.M. Korst. (1989). Simulated Annealing and Boltzmann Machines. Chichester: Wiley.

    Google Scholar 

  • Aarts, E.H.L. and J.K. Lenstra. (1997). Local Search and Combinatorial Optimization. Wiley Interscience Publications.

  • Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W.H. Freeman &; Co.

    Google Scholar 

  • Ghosh, D. (1998). “Heuristics for Knapsack Problems: Comparative Survey and Sensitivity Analysis.” Fellowship Dissertation, IIM Calcutta.

  • Glover, F. (1990). “Tabu Search—Part II.” ORSA Journal of Computing 2, 4–32.

    Google Scholar 

  • Glover, F. and M. Laguna. (1997). Tabu Search. Kluwer Academic Publishers.

  • Johnson, D.S., C.S. Aragon, L.A. McGeoch, and C. Schevon. (1991). “Optimization by Simulated Annealing: An Experimental Evaluation. Part II, Graph Coloring and Number Partitioning.” Operations Research 39, 378–406.

    Google Scholar 

  • Johnson, D.S., L. McGeogh, F. Glover, and C. Rego. (2001). 8th DIMACS Implementation Challenge: The Traveling Salesman Problem. http://www.research.att.com/∼dsj/chtsp/.

  • Reinelt, G. (1995). TSPLIB 95. http://www.iwr.uni-heidelberg.de/iwr/comopt/soft/TSPLIB95/TSPLIB.html.

Download references

Author information

Authors and Affiliations

  1. Production and Quantitative Methods Area, Indian Institute of Management, Vastrapur, Ahmedabad, 380015, India

    Diptesh Ghosh

  2. Faculty of Economic Sciences, University of Groningen, The Netherlands

    Gerard Sierksma

Authors
  1. Diptesh Ghosh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gerard Sierksma
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ghosh, D., Sierksma, G. Complete Local Search with Memory. Journal of Heuristics 8, 571–584 (2002). https://doi.org/10.1023/A:1020307925279

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1020307925279

Search

Navigation