Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem

DOI10.1016/j.ejor.2012.01.011zbMath1244.90196MaRDI QIDQ439653

Gregory Gutin, Daniel Karapetyan

Publication date: 16 August 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://repository.essex.ac.uk/22071/1/1005.5525v4.pdf

zbMATH Keywords

heuristics; combinatorial optimization; local search; neighborhood; generalized traveling salesman problem

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Uses Software

• TSPLIB
• LKH
• GTSP Instances Library