2Peng Wang; Cesar Sanin; Edward Szczerbicki. Evolutionaryalgorithm and decisional DNA for multiple travelling salesmanproblem [J]. Neurocomputing, 2015, 150(A): 50-57.
3Arantza Estevez-Fernandez; Peter Borma and HerbertHamersa. On the core of multiple longest traveling salesman games[J]. European Journal of Operational Research, 2006, 174(3): 1816-1827.
4Gilles Peasanta; Michel Gendreaua;Jean-Yves Potvina andJean-Marc Rousseaua. On the flexibility of constraint programmingmodels: From single to multiple time windows for the travelingsalesman problem [J]. European Journal of Operational Research,1999, 117(2): 253-263.
8Syslo M M,Deo N,Kowalik J S.Discrete optimization algorithms[M]. Englewood Cliffs, New Jersey :Prentice-Hall lnc, 1983 : 370-373.
9Samanlioglu F,Ferrell W G J,Kurz M E.A memetic random-key genetic algorithm for a symmetric muhi -objective traveling salesman problem[J].Computers & Industrial Engineering,2008,55 ( 2 ) : 439-449.
10Bhattacharyya M,Bandyopadhyay A K.Comparative study of some solution methods for traveling salesman program using genetic algorithms[J].Cybernelics and Systems, 2009,40( 1 ): 1-24.
