An Effective Tour Construction and Improvement Procedure for the Traveling Salesman Problem

DOI10.1287/OPRE.43.6.1049MaRDI QIDQ4887727zbMATH OpenOpenAlexFDO

Authors Geoffrey Zweig

Publication date 5 August 1996

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.43.6.1049

zbMATH Keywords

traveling salesmandivide and mergeeffective neighborhood structure

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• A tour construction heuristic for the travelling salesman problem
• An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem
• Further extension of the TSP assign neighborhood
• Exponential neighbourhood local search for the traveling salesman problem

Cited in

(4)

• A heuristic for the pickup and delivery traveling salesman problem
• A tour construction heuristic for the travelling salesman problem
• Improving TSP Tours Using Dynamic Programming over Tree Decompositions
• scientific article; zbMATH DE number 836777 (Why is no real title available?)

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: An Effective Tour Construction and Improvement Procedure for the Traveling Salesman Problem

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