A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem

DOI10.1016/j.cor.2018.07.023zbMath1458.90565MaRDI QIDQ1628059

Bruce L. Golden, Edward A. Wasil, Xingyin Wang

Publication date: 3 December 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.07.023

zbMATH Keywords

traveling salesman; heuristic; variable neighborhood search; Steiner zone

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Uses Software

• TSPLIB
• Gurobi