Guided local search and its application to the traveling salesman problem

By Christos Voudouris, Edward P. K. Tsang. 1999

How researchers see this paper

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

Citations in the corpus

A survey on algorithmic approaches for solving tourist trip design problems (2014, methodology): “A guided local search [133] metaheuristic algorithm (GLS) for the TOP is presented by Vansteenwegen et al.”
Metaheuristics in combinatorial optimization: Overview and conceptual comparison (2003, methodology): “Among the most general methods that use this approach is Guided Local Search (GLS) [Voudouris and Tsang 1999; Voudouris 1997].”
Reinforcement Learning for Solving the Vehicle Routing Problem (2018, background): “…savings heuristic [9], Sweep heuristic [36], Christoﬁdes’ heuristic [8] and a few others) for ﬁnding an initial solution and metaheuristics (e.g. Guided Local Search [34], Tabu Search [14] and Simulated Annealing [21]) for escaping from local minima in the search for the best solution.”
Heuristics for multi-attribute vehicle routing problems: A survey and synthesis (2013, background): “Long-term memories for penalizing frequent solution elements can also be viewed as a basis of Guided Local Search (Voudouris and Tsang 1999), applied by Kilby et al. (1999), Tarantilis et al. (2007), Kytöjoki et al. (2007), and Zachariadis and Kiranoudis (2010a) to the CVRP.”
ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolution (2024, unknown): “In our experimental setup, we employed a variation of the classical GLS algorithm (Voudouris & Tsang, 1999) that incorporated perturbation phases (Arnold & S¨orensen, 2019), wherein edges with higher heuristic values will be prioritized for penalty.”
Two-dimensional packing problems: A survey (2002, unknown): “They use similar neighborhood and search strategy within a guided local search approach (see [54] for details).”
Evolution of Heuristics: Towards Efficient Automatic Algorithm Design Using Large Language Model (2024, methodology): “Guided local search (GLS) is a widely used metaheuristic for solving combinatorial optimization problems including the traveling salesman problem (Alsheddy et al., 2018; Voudouris & Tsang, 1999).”
Guided Local Search (2010, unknown): “We tested GLS+FLS+2Opt against LK (Voudouris and Tsang, 1999) in a set of benchmark problems from the public TSP library (Reinelt, 1991).”