Abstract
Equality generalized travelling salesman problem (E-GTSP) is a variant of the travelling salesman problem where the set of cities are partitioned to form clusters. The travelling salesman is required to start from the home city and visit exactly one city in each and every cluster and return home while minimizing travelled distance. In this paper TANYAKUMU labelling method for solving travelling salesman problem is modified to solve E-GTSP. The algorithm terminates after m iterations where m is the number of clusters in the problem and computational complexity reduces as iterations increases. Numerical illustration is used to prove the validity and efficiency of the proposed algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Laporte, G., Asef-Vaziri, A., Sriskandarajah, C.: Some applications of the generalized travelling salesman problem. J. Oper. Res. Soc. 47(12), 1461–1467 (1996)
Fischetti, M., González, J.J.S., Toth, P.: A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper. Res. 45(3), 378–394 (1997). https://doi.org/10.1287/opre.45.3.378
Srivastava, S.S., Kumar, S., Garg, R.C., Sen, P.: Generalized traveling salesman problem through n sets of nodes. Can. Oper. Res. Soc. J. 7(2), 97–101 (1969)
Garg, R.C., Kumar, S., Dass, P., Sen, P.: Generalized travelling salesman problem through N sets of nodes in a competitive market. Planning forschung, Band II, Helf 2, 116–120 (1970)
Munapo, E.: A network branch and bound approach for the travelling salesman model. South Afr. J. Econ. Manag. Sci. 16(1), 52–63 (2013)
Kumar, S., Munapo, E., Lesaoana, ‘, Nyamugure, P.: A minimum spanning tree based heuristic for the travelling salesman tour. Opsearch 55(1), 150–164 (2017). https://doi.org/10.1007/s12597-017-0318-5
Kumar, S., Munapo. E., Sigauke, C., Al-Rabeeah, M.: The minimum spanning tree with node index ≤ 2 Is equivalent to the minimum travelling salesman tour. In: Appeared as Chapter 8 in the book titled “Mathematics in Engineering Sciences: Novel Theories, Technologies and Applications”, pp. 227–244. CRC Press (2019)
Munapo, E.: Network reconstruction – a new approach to the traveling salesman problem and complexity. In: Vasant, P., Zelinka, I., Weber, G.-W. (eds.) ICO 2019. AISC, vol. 1072, pp. 260–272. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-33585-4_26
Snyder, L.V., Daskin, M.S.: A random – key genetic algorithm for the generalized travelling salesman problem. Eur. J. Oper. Res. 174, 38–53 (2006)
Cacchiani, V., Muritiba, A.E.F., Negreiros, M., Tooth, P.: A multi-start heuristic for the equality generalized travelling salesman problem. Netw. Int. J. 57(3), 231–239 (2011)
Helsgaun, K.: Solving the equality generalized travelling salesman problem using the Lin-Kernighan-Helsgaun Algorithm. Mathematical programming computations 7, 269–287 (2015)
Pintea, C.M.: A unifying survey of Agent Based approaches for equality generalized travelling salesman problem. Informatica 26(3), 509–522 (2015)
Zia, M., Cakir, Z., Seker, D.Z.: Spatial transformation of equality generalized travelling salesman problem to travelling salesman problem. Int. J. Geo-inf. 7(3), 1–16 (2018)
Nejma, I.B., M’Hallah, R.: A beam search algorithm for the equality generalized symmetric travelling salesman problem. RAIRO-Oper. Res. 55, 3021–3029 (2021)
Khachay, M., Ukolov, S., Petunin, A.: Problem-specific branch-and-bound algorithms for the precedence constrained generalized traveling salesman problem. In: Olenev, N.N., Evtushenko, Y.G., Jaćimović, M., Khachay, M., Malkova, V. (eds.) OPTIMA 2021. LNCS, vol. 13078, pp. 136–148. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-91059-4_10
Yuan, Y., Cattaruzza, D., Ogier, M., Rousselot, C., Semet, F.: Mixed integer programming formulations for the generalized traveling salesman problem with time windows. 4OR 19(4), 571–592 (2020). https://doi.org/10.1007/s10288-020-00461-y
Huang, Y., Yao, X., Jiang, J.: An improved firefly algorithm for generalized traveling salesman problem. In: Huang, D.-S., Jo, K.-H., Li, J., Gribova, V., Bevilacqua, V. (eds.) ICIC 2021. LNCS, vol. 12836, pp. 739–753. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-84522-3_60
Tawanda, T., Nyamugure, P., Kumar, S., Munapo, E.: TANYAKUMU labelling method for travelling salesman problem. In: Advances of Artificial Intelligence and Operational Research in Transportation and Exploration Industry and Business: SAE International (2022)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Tawanda, T., Nyamugure, P., Kumar, S., Munapo, E. (2023). Modified TANYAKUMU Labelling Method to Solve Equality Generalized Travelling Salesman Problem. In: Vasant, P., Weber, GW., Marmolejo-Saucedo, J.A., Munapo, E., Thomas, J.J. (eds) Intelligent Computing & Optimization. ICO 2022. Lecture Notes in Networks and Systems, vol 569. Springer, Cham. https://doi.org/10.1007/978-3-031-19958-5_88
Download citation
DOI: https://doi.org/10.1007/978-3-031-19958-5_88
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-19957-8
Online ISBN: 978-3-031-19958-5
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)