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

DOI10.1023/A:1009695129052zbMATH Open0961.90122OpenAlexW1760967662MaRDI QIDQ1806710FDOQ1806710

Authors: Hiroyuki Okano, Shinji Misono, Kazuo Iwano 

Publication date: 20 December 1999

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009695129052

Recommendations

• New TSP construction heuristics and their relationships to the 2-Opt
• New approximation algorithms for \((1,2)\)-TSP
• Nonoblivious 2-opt heuristics for the traveling salesman problem
• scientific article; zbMATH DE number 1003245
• Quick updates for \(p\)-opt TSP heuristics
• scientific article; zbMATH DE number 5855014
• The approximation ratio of the 2-Opt heuristic for the metric traveling salesman problem
• A new heuristic for the traveling salesman problem
• Overview of new approaches for approximating TSP

zbMATH Keywords

traveling salesman problemconstruction heuristic2-Opt dependencyedge-exchange heuristic

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cited In (5)

• Match twice and stitch: a new TSP tour construction heuristic.
• Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
• Title not available (Why is that?)
• Quick updates for \(p\)-opt TSP heuristics
• New TSP construction heuristics and their relationships to the 2-Opt

Uses Software

• TSPLIB

This page was built for publication: New TSP construction heuristics and their relationships to the 2-Opt

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