Diversification through candidate sampling for a non-iterated Lin-Kernighan-Helsgaun algorithm

DOI10.1007/978-3-031-86849-8_4MaRDI QIDQ6966810zbMATH OpenFDO

Authors Tarek Boufar, Omar Rifki, Matthieu Basseur

Publication date 27 June 2025

Full work available at URL https://doi.org/10.1007/978-3-031-86849-8_4

zbMATH Keywords

local searchtravelling salesman problemLin-Kernighan-Helsgaun algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Combinatorial optimization (90C27)

Cites work

• Accelerated branch exchange heuristics for symmetric traveling salesman problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
• Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem
• Partial neighborhood local searches
• Principles and Practice of Constraint Programming – CP 2004
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II
• Validation of subgradient optimization

This page was built for publication: Diversification through candidate sampling for a non-iterated Lin-Kernighan-Helsgaun algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6966810)