Abstract
Covering salesman problem (CSP) is to construct a minimum length Hamiltonian cycle over a subset of vertices, in which the vertices not visited on the cycle must be covered by at least one visited vertex. In this paper, the CSP is reformulated as a bilevel CSP (BCSP) with a leader and a follower sub-problem. Two parallel variable neighborhood search (PVNS) heuristics, namely, synchronous “master–slave” PVNS and asynchronous cooperative PVNS, are proposed to solve the BCSP. To test the proposed algorithms, extensive computational experiments on the benchmark instances are performed, and the results indicate the effectiveness of the proposed approaches.
Similar content being viewed by others
References
Current, J.R., Schilling, D.A.: The covering salesman problem. Transp. Sci. 23, 208–213 (1989)
Golden, B., Naji-Azimi, Z., Raghavan, S., Salari, M., Toth, P.: The generalized covering salesman problem. INFORMS J. Comput. 24, 534–553 (2012)
Salari, M., Naji-Azimi, Z.: An integer programming-based local search for the covering salesman problem. Comput. Oper. Res. 39, 2594–2602 (2012)
Salari, M., Reihaneh, M., Sabbagh, M.S.: Combining ant colony optimization algorithm and dynamic programming technique for solving the covering salesman problem. Comput. Ind. Eng. 83, 244–251 (2015)
Gendreau, M., Laporte, G., Semet, F.: The covering tour problem. Oper. Res. 45, 568–576 (1997)
Gendreau, M., Hertz, A., Laporte, G.: New insertion and postoptimization procedures for the traveling salesman problem. Oper. Res. 40, 1086–1094 (1992)
Balas, E., Ho, A.: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study. In: Padberg, M.W. (ed.) Combinatorial Optimization Mathematical Programming Studies, vol. 12. Springer, Berlin, Heidelberg (1980). https://doi.org/10.1007/BFb0120886
Hachicha, M., Hodgson, M.J., Laporte, G., Semet, F.: Heuristics for the multi-vehicle covering tour problem. Comput. Oper. Res. 27, 29–42 (2000)
Shaelaie, M.H., Salari, M., Naji-Azimi, Z.: The generalized covering traveling salesman problem. Appl. Soft Comput. 24, 867–878 (2014)
Perez, J.A.M., Moreno-Vega, J.M., Martin, I.R.: Variable neighborhood tabu search and its application to the median cycle problem. Eur. J. Oper. Res. 151, 365–378 (2003)
Renaud, J., Boctor, F.F., Laporte, G.: Efficient heuristics for median cycle problems. J. Oper. Res. Soc. 55, 179–186 (2004)
Calvete, H.I., Gale, C., Iranzo, J.A.: An efficient evolutionary algorithm for the ring star problem. Eur. J. Oper. Res. 246(1), 22–33 (2015)
Labbe, M., Laporte, G., Martin, I.R., Gonzalez, J.J.S.: The ring star problem: polyhedral analysis and exact algorithm. Networks 43, 177–189 (2004)
Simonetti, L., Frota, Y., de Souza, C.C.: The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm. Discrete Appl. Math. 159, 1901–1914 (2011)
Kedad-Sidhoum, S., Viet Hung, N.: An exact algorithm for solving the ring star problem. Optimization 59, 125–140 (2010)
Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6, 154–160 (1994)
Calvete, H.I., Gale, C.: Linear bilevel multi-follower programming with independent followers. J. Glob. Optim. 39, 409–417 (2007)
Affenzeller, M., Winkler, S.M., Wagner, S., Beham, A.: Genetic algorithms and genetic programming: modern concepts and practical applications. Parallel Process. Lett. 7, 365–379 (2009)
Baldacci, R., Dell’Amico, M.: Heuristic algorithms for the multi-depot ring-star problem. Eur. J. Oper. Res. 203, 270–281 (2010)
Baldacci, R., Dell’Amico, M., Gonzalez, J.S.: The capacitated m-ring-star problem. Oper. Res. 55, 1147–1162 (2007)
Mladenovic, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097–1100 (1997)
Hemmelmayr, V.C., Doerner, K.F., Hartl, R.F.: A variable neighborhood search heuristic for periodic routing problems. Eur. J. Oper. Res. 195, 791–802 (2009)
Jarboui, B., Derbel, H., Hanafi, S., Mladenovic, N.: Variable neighborhood search for location routing. Comput. Oper. Res. 40, 47–57 (2013)
Hansen, P., Mladenovic, N., Todosijevic, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5, 423–454 (2017)
Mjirda, A., Todosijevic, R., Hanafi, S., Hansen, P., Mladenovic, N.: Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem. Int. Trans. Oper. Res. 24, 615–633 (2017)
Brimberg, J., Mladenovic, N., Todosijevic, R., Urosevic, D.: A basic variable neighborhood search heuristic for the uncapacitated multiple allocation p-hub center problem. Optim. Lett. 11, 313–327 (2017)
Crainic, T.G., Hail, N.: Parallel Metaheuristics Applications. Wiley, New York (2005)
Eskandarpour, M., Zegordi, S.H., Nikbakhsh, E.: A parallel variable neighborhood search for the multi-objective sustainable post-sales network design problem. Int. J. Prod. Econ. 145, 117–131 (2013)
Wang, L.-Y., Huang, X., Ji, P., Feng, E.-M.: Unrelated parallel-machine scheduling with deteriorating maintenance activities to minimize the total completion time. Optim. Lett. 8, 129–134 (2014)
Polat, O.: A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups. Comput. Oper. Res. 85, 71–86 (2017)
Herran, A., Colmenar, J.M., Duarte, A.: A variable neighborhood search approach for the Hamiltonian p-median problem. Appl. Soft Comput. 80, 603–616 (2019)
Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the travelling-salesman problem. Oper. Res. 21, 498–516 (1973)
Reinelt, G.: TSPLIB—a traveling salesman problem library. ORSA J. Comput. 3, 376–384 (1991)
Acknowledgements
This work was supported by the Ministry of Chinese Education, Humanities and Social Sciences under Grant 17YJA630037 and the Project of Graduate Teaching Quality in Hefei University of Technology (Grant No. 110-4116000050).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Zang, X., Jiang, L., Ratli, M. et al. A parallel variable neighborhood search for solving covering salesman problem. Optim Lett 16, 175–190 (2022). https://doi.org/10.1007/s11590-020-01642-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-020-01642-8