The Improved Genetic Algorithms for Multiple Maximum Scatter Traveling Salesperson Problems

  • Wenyong Dong
  • Xueshi DongEmail author
  • Yufeng Wang
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 812)


Maximum scatter traveling salesperson problem (MSTSP), as a variant of traveling salesman problem (TSP), has been successfully applied to the practical cases in manufacturing and medical imaging. However, it cannot model the application problems where there are multiple objectives or individuals. This paper proposes a new model named multiple maximum scatter traveling salesperson problems (MMSTSP) for modeling such problems. The paper applies three improved genetic algorithms (GAs) to solve MMSTSP, where three methods are used to improve GA, the first one is greedy initialization for optimization, the second one is climbing-hill algorithm, and the last one is simulated annealing algorithm. Furthermore, many real-world problems can be modeled by MMSTSP, and the scale of constructed model is usually up to large scale, it is necessary to study large scale MMSTSP problem. Therefore, the paper uses the improved GAs to solve the small scale to large scale MMSTSP. By extensive experiments and analysis, it shows that the improved algorithms are effective, and can demonstrate different characteristics in solving the problem.


Improved genetic algorithms Maximum scatter traveling salesperson problem Greedy algorithm Hill-climbing Simulated annealing 



This work is supported by the National Natural Science Foundation of China under Grant No. 61672024, No. 61170305.


  1. 1.
    Arkin, E.M., Chiang, Y.J., Mitchell, J.S.B., et al.: On the maximum scatter traveling salesperson problem. SIAM J. Comput. 29(2), 515–544 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variations, pp. 585–607. Kluwer Academic Publishers, Boston, Dordrecht, London (2002)zbMATHGoogle Scholar
  3. 3.
    Chiang, Y.J.: New approximation results for the maximum scatter TSP. Algorithmica 41, 309–341 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    John, L.R.: The bottleneck traveling salesman problem and some variants. Master of Science of Simon Fraser University, Canada, pp. 21–23 (2010)Google Scholar
  5. 5.
    Li, J., Zhou, M., Sun, Q., Dai, X., Yu, X.: Colored traveling salesman problem. IEEE Trans. Cybern. 45(11), 2390–2401 (2015)CrossRefGoogle Scholar
  6. 6.
    Li, J., Qiru, S., Zhou, M., Dai, X.: A new multiple traveling salesman problem and its genetic algorithm-based solution. In: Proceedings of the 2013 IEEE International Conference on Systems Man and Cybernetics, Manchester, U.K, pp. 1–6 (2013)Google Scholar
  7. 7.
    Vairaktarakis, G.L.: On gilmore-gomorys open question for the bottleneck TSP. Oper. Res. Lett. 31, 483–491 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Kao, M.Y., Sanghi, M.: An approximation algorithm for a bottleneck traveling salesman problem. J. Discrete Algorithms 7, 315–326 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Kao, M.Y., Sanghi, M.: An approximation algorithm for a bottleneck traveling salesman problem. In: Calamoneri, T., Finocchi, I., Italiano, Giuseppe F. (eds.) CIAC 2006. LNCS, vol. 3998, pp. 223–235. Springer, Heidelberg (2006). CrossRefGoogle Scholar
  10. 10.
    Ahmed, Z.H.: A hybrid genetic algorithm for the bottleneck traveling salesman problem. ACM Trans. Embed. Comput. Syst. 12(1), 9:1–9:10 (2013)CrossRefGoogle Scholar
  11. 11.
    Dong, X.S., Dong, W.Y., Wang, Y.F.: Hybrid algorithms for multi-objective balanced traveling salesman problem. J. Comput. Res. Dev. 54(8), 1751–1762 (2017)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  1. 1.Computer SchoolWuhan UniversityWuhanChina

Personalised recommendations