Variable neighbourhood search algorithms for asymmetric travelling salesman problems

MaRDI QIDQ2627435zbMATH OpenFDO

Authors Ittiporn Piriyaniti, Pisut Pongchairerks

Publication date 31 May 2017

Published in International Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

asymmetric TSPATSPcombinatorial problemslogisticsneighbourhood structuresNP-hardtravelling salesman problemvariable neighbourhood searchVNS

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Review text

Summary: The aim of the research is to find the best neighbourhood structures for the shaking step and the local search step in the variable neighbourhood search algorithm (VNS) when applied to the asymmetric travelling salesman problem (ATSP). Many variants of the VNS algorithm are proposed based on their neighbourhood structures. The performances of these VNS algorithms are tested with the benchmark instances of the ATSP, one of the best known logistics problems.

Recommendations

• scientific article; zbMATH DE number 1703863
• Variable neighborhood search
• Variable Neighborhood Search
• Variable neighborhood search: Principles and applications
• Variable neighbourhood search: Methods and applications

Cited in

(4)

• scientific article; zbMATH DE number 1703863 (Why is no real title available?)
• Two level general variable neighborhood search for attractive traveling salesman problem
• A variable neighborhood search algorithm for cost-balanced travelling salesman problem
• Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem

This page was built for publication: Variable neighbourhood search algorithms for asymmetric travelling salesman problems

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