Complete Local Search with Memory

Authors:
Diptesh Ghosh;Gerard Sierksma
Affiliations:
Production and Quantitative Methods Area, Indian Institute of Management, Vastrapur, Ahmedabad 380015, India;Faculty of Economic Sciences, University of Groningen, The Netherlands
Venue:
Journal of Heuristics
Year:
2002

Citing 5
Cited 6

Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing

Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization
Tabu Search

Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

The probabilistic heuristic in local (PHIL) search meta-strategy

IEA/AIE'2005 Proceedings of the 18th international conference on Innovations in Applied Artificial Intelligence
An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach

Computers and Operations Research
A proposal for a hybrid meta-strategy for combinatorial optimization problems

Journal of Heuristics
A cooperative and self-adaptive metaheuristic for the facility location problem

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach

Computers and Operations Research
Production capacity planning and scheduling in a no-wait environment with controllable processing times: An integrated modeling approach

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

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.