Abstract
The algorithms belonging to the Ant Colony Optimization metaheuristic can be naturally applied to shortest path related problems. Although not so intensively studied as TSP, the multiple traveling salesman problem (multiple-TSP) is a straightforward extension of TSP of practical importance, requiring more than one salesman to be used for covering the whole set of cities. This work tackles the MinMax formulation of multiple-TSP, which aims at obtaining balanced subtours for the salesmen. An Ant Colony System that follows the MinMax formulation is proposed. Two other algorithms combining K-Means and Fuzzy C-Means clustering with Ant Colony Systems are described. The experimental analysis investigates the performance of the proposed algorithms from a bi-objective perspective, counting for the total length/cost of a solution and its balancing degree measured as the amplitude of its subtours.
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
Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3), 209–219 (2006)
Junjie, P., Dingwei, W.: An ant colony optimization algorithm for multiple travelling salesman problem. In: ICICIC 2006, vol. 1, pp. 210–213 (2006)
França, P.M., Gendreau, M., Laporte, G., Müller, F.M.: The m-traveling salesman problem with minmax objective. Transp. Sci. 29(3), 267–275 (1995)
Somhom, S., Modares, A., Enkawa, T.: Competition-based neural network for the multiple travelling salesmen problem with minmax objective. Comput. Oper. Res. 26(4), 395–407 (1999)
Vallivaara, I.: A team ant colony optimization algorithm for the multiple travelling salesmen problem with minmax objective. In: MIC 2008, pp. 387-392 (2008)
Carter, A.E., Ragsdale, C.T.: A new approach to solving the multiple traveling salesperson problem using genetic algorithms. EJOR 175(1), 246–257 (2006)
Venkatesh, P., Singh, A.: Two metaheuristic approaches for the multiple traveling salesperson problem. Appl. Soft Comput. 26, 74–89 (2015)
Kivelevitch, E., Cohen, K., Kumar, M.: A market-based solution to the multiple traveling salesmen problem. JIRS J. 72(1), 21–40 (2013)
Liu, W., Li, S., Zhao, F., Zheng, A.: An ant colony optimization algorithm for the multiple traveling salesmen problem. In: ICIEA 2009, pp. 1533–1537 (2009)
Chandran, N., Narendran, T.T., Ganesh, K.: A clustering approach to solve the multiple travelling salesmen problem. Int. J. Ind. Syst. Eng. 1(3), 372–387 (2006)
Sofge, D., Schultz, A., De Jong, K.: Evolutionary computational approaches to solving the multiple traveling salesman problem using a neighborhood attractor schema. In: Applications of Evolutionary Computing, pp. 153-162 (2002)
Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53–66 (1997)
Necula, R., Breaban, M., Raschip, M., Performance evaluation of ant colony systems for the single-depot multiple traveling salesman problem. In: HAIS 2015, vol. 9121, pp. 257-268 (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Necula, R., Raschip, M., Breaban, M. (2018). Balancing the Subtours for Multiple TSP Approached with ACS: Clustering-Based Approaches Vs. MinMax Formulation. In: Tantar, AA., Tantar, E., Emmerich, M., Legrand, P., Alboaie, L., Luchian, H. (eds) EVOLVE - A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation VI. Advances in Intelligent Systems and Computing, vol 674. Springer, Cham. https://doi.org/10.1007/978-3-319-69710-9_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-69710-9_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-69708-6
Online ISBN: 978-3-319-69710-9
eBook Packages: EngineeringEngineering (R0)