New TSP construction heuristics and their relationships to the 2-opt

DOI10.1007/3-540-63307-3_55zbMath1497.90180OpenAlexW47144367MaRDI QIDQ5096934

Shinji Misono, Hiroyuki Okano, Kazuo Iwano

Publication date: 19 August 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63307-3_55

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• The traveling salesman. Computational solutions for RSP applications
• New TSP construction heuristics and their relationships to the 2-Opt
• Fast Algorithms for Geometric Traveling Salesman Problems
• On the Significance of the Initial Solution in Travelling Salesman Heuristics
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem