General local search heuristics in combinatorial optimization: A tutorial

General local search heuristics in combinatorial optimization: A tutorial

0.00 Avg rating0 Votes
Article ID: iaor19931959
Country: Belgium
Volume: 32
Issue: 1/2
Start Page Number: 7
End Page Number: 68
Publication Date: Jan 1992
Journal: Belgian Journal of Operations Research, Statistics and Computer Science
Authors:
Keywords: heuristics, optimization: simulated annealing, neural networks, combinatorial analysis
Abstract:

The paper presents four general heuristic search strategies that can in principle be adapted to any combinatorial optimization problem. All these techniques, Simulated Annealing (SA), Tabu Search (TS), Genetic Algorithms (GA) and Neural Networks (NN), can be described as local search heuristics. The paper provides an elementary description of each of them together with examples of applications and a bibliographic and historic note. More advanced developments in the framework of each strategy are outlined.

Reviews

Required fields are marked *. Your email address will not be published.