Genetic Local Search Algorithms for the Travelling Salesman Problem

By N. Ulder, Emile H. L. Aarts, H. Bandelt, P. V. Laarhoven, Erwin Pesch. 1990

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Thomas Stützle
2. Holger H. Hoos
3. Frank Hutter
4. Christian Blum
5. Bernd Freisleben
6. Andrzej Jaszkiewicz
7. P. Merz
8. Manuel López-Ibáñez

Citations in the corpus

• Genetic local search for multi-objective combinatorial optimization (2002, methodology): “For example, Radcliffe and Surry (1994) consider an algorithm in which a single iteration of local search is applied to each offspring while Taillard (1995) applies tabu search to each offspring.”
• Fitness landscape analysis and memetic algorithms for the quadratic assignment problem (2000, background): “f hybridization is the use of local search in evolutionary algorithms [38], [70], [39], [40].”
• MAX-MIN Ant System (2000, methodology): “The motivation for applying theLK heuristic is the observation made in [51] that for genetic local search algorithms a much better solution quality is obtained w ith theLK heuristic than by using2-opt [51].”
• Tabu Search (1997, unknown): “(1988), Ulder et al. (1991)), (Whitley, Gordon and Mathias (1994)).”