论文信息 - A general variable neighborhood search algorithm for the k-traveling salesman problem

A general variable neighborhood search algorithm for the k-traveling salesman problem

Abstract This paper addresses a variant of the traveling salesman problem, i.e., k-traveling salesman problem (k-TSP). Given a set of n cities and a fixed value 1

[1] P. Hansen,et al. Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..

[2] Bernard Gendron,et al. A general variable neighborhood search variants for the travelling salesman problem with draft limits , 2013, Optim. Lett..

[3] Nenad Mladenovic,et al. Two level General variable neighborhood search for Attractive traveling salesman problem , 2013, Comput. Oper. Res..

[4] Dragan Urošević,et al. A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem , 2011, Eur. J. Oper. Res..

[5] Pierre Hansen,et al. Variable Neighborhood Search , 2018, Handbook of Heuristics.

[6] David R. Karger,et al. Approximation Algorithms for Orienteering and Discounted-Reward TSP , 2007, SIAM J. Comput..

[7] Raca Todosijevic,et al. AN EFFICIENT GENERAL VARIABLE NEIGHBORHOOD SEARCH FOR LARGE TRAVELLING SALESMAN PROBLEM WITH TIME WINDOWS , 2012 .

[8] Egon Balas,et al. The prize collecting traveling salesman problem , 1989, Networks.

[9] Giorgio Ausiello,et al. Prize Collecting Traveling Salesman and Related Problems , 2018, Handbook of Approximation Algorithms and Metaheuristics.