Abstract
This investigation took an attempt to solve the cluster traveling salesman problem (CTSP) by the heuristic approach. In this problem, nodes are clustered with given a set of vertices (nodes). Given the set of vertices is divided into a prespecified number of clusters. The size of each cluster is also pre-specified. The main aim is to find the least cost Hamiltonian tour based on the given vertices. Here vertices of each cluster visited contiguously, and the clusters are visited in a specific order. Standard GA is used to find a Hamiltonian path for each cluster. The performance of the algorithm has been examined against two existing algorithms for some symmetric TSPLIB instances of various sizes. The computational results show the proposed algorithm works well among the studied metaheuristics regarding the best result and computational time.
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
References
Ahmed, Z.H.: An exact algorithm for the clustered traveling salesman problem. Opsearch 50(2), 215–228 (2013)
Ahmed, Z.H.: The ordered clustered travelling salesman problem: a hybrid genetic algorithm. Sci. World J. 2014, 13 (2014). Article ID 258207
Pop, P.C., et al.: A novel two-level optimization approach for clustered vehicle routing problem. Comput. Ind. Eng. 115, 304–318 (2018)
Chisman, J.A.: The clustered traveling salesman problem. Comput. Oper. Res. 2(2), 115–119 (1975)
Helsgaun, K.: Solving the clustered traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm, May 2014
Laporte, G., Palekar, U.: Some applications of the clustered travelling salesman problem. J. Oper. Res. Soc. 53(9), 972–976 (2002)
Lokin, F.C.J.: Procedures for travelling salesman problems with additional constraints. Eur. J. Oper. Res. 3(2), 135–141 (1979)
Hertz, A., Gendreau, M., Laporte, G.: The traveling salesman problem with backhauls. Comput. Oper. Res. 23(5), 501–508 (1996)
Roy, A., Maity, S., Maiti, M.: An intelligent hybrid algorithm for 4-dimensional TSP. J. Ind. Inf. Integr. 5, 39–50 (2017)
Mestria, M.: Heuristic methods using variable neighborhood random local search for the clustered traveling salesman problem. Revista Produo Online 14 (2014). https://doi.org/10.14488/1676-1901.v14i4.1721
Mestria, M.: New hybrid heuristic algorithm for the clustered traveling salesman problem. Comput. Ind. Eng. 116 (2017). https://doi.org/10.1016/j.cie.2017.12.018.
Phuong, H.N., et al.: Solving the clustered traveling salesman problem with d-relaxed priority rule, October 2018
Reinelt, G.: TSPLIBA traveling salesman problem library. ORSA J. Comput. 3, 376–384 (1991). ISSN 0899-1499
Zhang, F., Zhang, Y.F., Nee, A.Y.C.: Using genetic algorithms in process planning for job shop machining. IEEE Trans. Evol. Comput. 1(4), 278–289 (1997)
Zhang, T., et al.: Metaheuristics for the tabu clustered traveling salesman problem. Comput. Oper. Res. 89 (2017). https://doi.org/10.1016/j.cor.2017.07.008.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Manna, A., Maity, S., Roy, A. (2020). A Heuristic Approach for Cluster TSP. In: Castillo, O., Jana, D., Giri, D., Ahmed, A. (eds) Recent Advances in Intelligent Information Systems and Applied Mathematics. ICITAM 2019. Studies in Computational Intelligence, vol 863. Springer, Cham. https://doi.org/10.1007/978-3-030-34152-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-34152-7_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-34151-0
Online ISBN: 978-3-030-34152-7
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)