A modified Lin--Kernighan traveling-salesman heuristic

DOI10.1016/0167-6377(93)90001-WzbMath0779.90076OpenAlexW2090390706MaRDI QIDQ688925

M. C. Fu

Publication date: 1 November 1993

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(93)90001-w

zbMATH Keywords

2-OPTdepth searchLin-Kernighan traveling-salesman heuristic

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (11)

TSP ejection chains ⋮ Routing problems: A bibliography ⋮ Optimality conditions to the acyclic travelling salesman problem. ⋮ A survey of very large-scale neighborhood search techniques ⋮ Determination of the candidate arc set for the asymmetric traveling salesman problem ⋮ A Neural-Network-Based Approach to the Double Traveling Salesman Problem ⋮ Distances between traveling salesman tours ⋮ Guided local search and its application to the traveling salesman problem ⋮ Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem ⋮ An effective implementation of the Lin-Kernighan traveling salesman heuristic ⋮ Relaxed tours and path ejections for the traveling salesman problem

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• The traveling-salesman problem and minimum spanning trees: Part II
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: A modified Lin--Kernighan traveling-salesman heuristic