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

DOI10.1287/opre.43.6.1049zbMath0852.90127OpenAlexW2090380604MaRDI QIDQ4887727

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)

Related Items

A heuristic for the pickup and delivery traveling salesman problem

Uses Software

• TSPLIB