A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods
From MaRDI portal
Publication:1681325
DOI10.1016/j.ejor.2017.07.024zbMath1374.90332MaRDI QIDQ1681325
Publication date: 23 November 2017
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.07.024
traveling salesman problem; hybrid algorithm; arbitrary neighbourhoods; boundary-based encoding scheme; close-enough
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization