An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem

Applied Mathematics and Computation

Volumn 215, Issue 9, 2010, Pages 3356-3368

  Fatih Tasgetiren, M ^a   Suganthan, P N ^b   Pan, Quan Ke ^c  

^a YASAR UNIVERSITY   (Turkey)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^c LIAOCHENG UNIVERSITY   (China)

Author keywords

Discrete differential evolution algorithm; Ensemble of optimization algorithms; Evolutionary algorithms; Generalized traveling salesman problem; Metaheuristic

Indexed keywords

DISCRETE DIFFERENTIAL EVOLUTION ALGORITHM; ENSEMBLE OF OPTIMIZATION ALGORITHMS; GENERALIZED TRAVELING SALESMAN PROBLEM; METAHEURISTIC; OPTIMIZATION ALGORITHMS;

DAMPING; HEURISTIC METHODS; MATHEMATICAL OPERATORS; PARALLEL ALGORITHMS; PARAMETER ESTIMATION; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

EVOLUTIONARY ALGORITHMS;

EID: 71649084635     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2009.10.027     Document Type: Article

References (31)

1. Laporte G., Asef-Vaziri A., and Sriskandarajah C. Some applications of the generalized travelling salesman problem. Journal of the Operational Research Society 47 12 (1996) 461-1467
2. Henry-Labordere A. The record balancing problem-a dynamic programming solution of a generalized travelling salesman problem. Revue Francaise D Informatique DeRecherche Operationnelle 3 NB2 (1969) 43-49
3. C.E. Noon, The generalized traveling salesman problem, Ph.D. Thesis, University of Michigan, 1988.
4. Ben-Arieh D., Gutin G., Penn M., Yeo A., and Zverovitch A. Process planning for rotational parts using the generalized traveling salesman problem. International Journal of Production Research 41 11 (2003) 2581-2596
5. Saskena J.P. Mathematical model of scheduling clients through welfare agencies. Journal of the Canadian Operational Research Society 8 (1970) 185-200
6. Srivastava S.S., Kumar S., Garg R.C., and Sen P. Generalized traveling salesman problem through n sets of nodes. Journal of the Canadian Operational Research Society 7 (1970) 97-101
7. Laporte G., Mercure H., and Nobert Y. Finding the shortest Hamiltonian circuit through n clusters: a Lagrangian approach. Congressus Numerantium 48 (1985) 277-290
8. Laporte G., Mercure H., and Nobert Y. Generalized travelling salesman problem through n-sets of nodes-the asymmetrical case. Discrete Applied Mathematics 18 2 (1987) 185-197
9. Laporte G., and Nobert Y. Generalized traveling salesman problem through n-sets of nodes-an integer programming approach. INFOR 21 1 (1983) 61-75
10. Fischetti M., Salazar-Gonzalez J.J., and Toth P. The symmetrical generalized traveling salesman polytope. Networks 26 2 (1995) 113-123
11. Fischetti M., Salazar-González J.J., and Toth P. A branch-and-cut algorithm for the symmetric generalized travelling salesman problem. Operations Research 45 3 (1997) 378-394
12. Chentsov A.G., and Korotayeva L.N. The dynamic programming method in the generalized traveling salesman problem. Mathematical and Computer Modelling 25 1 (1997) 93-105
13. Noon C.E., and Bean J.C. A Lagrangian based approach for the asymmetric generalized traveling salesman problem. Operations Research 39 4 (1991) 623-632
14. Ben-Arieh D., Gutin G., Penn M., Yeo A., and Zverovitch A. Transformations of generalized ATSP into ATSP. Operations Research Letters 31 (2003) 357-365
15. Renaud J., and Boctor F.F. An efficient composite heuristic for the symmetric generalized traveling salesman problem. European Journal of Operational Research 108 3 (1998) 571-584
16. Renaud J., Boctor F.F., and Laporte G. A fast composite heuristic for the symmetric traveling salesman problem. INFORMS Journal on Computing 4 (1996) 134-143
17. Snyder L.V., and Daskin M.S. A random-key genetic algorithm for the generalized traveling salesman problem. European Journal of Operational research 174 (2006) 38-53
18. M. Fatih Tasgetiren, P.N. Suganthan, Quan-Ke Pan, A discrete particle swarm optimization algorithm for the generalized traveling salesman problem, in: Proceedings of the Ninth Annual Conference on Genetic and Evolutionary Computation (GECCO2007), London, UK, 2007, pp. 158-167.
19. M. Fatih Tasgetiren, P.N. Suganthan, Quan-Ke Pan, Yun-Chia Liang, A genetic algorithm for the generalized traveling salesman problem, in: Proceeding of the World Congress on Evolutionary Computation (CEC2007), Singapore, 2007, pp. 2382-2389.
20. Silberholz J., and Golden B. The generalized traveling salesman problem: a new genetic algorithm approach. In: Baker E.K., et al. (Ed). Extending the Horizons: Advances in Computing. Optimization and Decision Technologies vol. 37 (2007), Springer-Verlag 165-181 10.1007/978-0-387-48793-9_11
21. Gutin G., Karapetyan D., and Krasnogor N. A memetic algorithm for the generalized traveling salesman problem. Nature Inspired Cooperative Strategies for Optimization (NICSO 2007). Studies in Computational Intelligence vol. 129 (2007), Springer, Berlin-Heidelberg 199-210
22. Gutin G., and Karapetyan D. A Memetic Algorithm for the Generalized Traveling Salesman Problem, Natural Computing (2009), Springer, Netherlands 10.1007/s11047-009-9111-6
23. Pan Q.-K., Fatih Tasgetiren M., and Liang Y.-C. A discrete differential evolution algorithm for the permutation flowshop scheduling problem. Computers and Industrial Engineering (2008) 10.1016/j.cie.2008.03.003
24. Fatih Tasgetiren M., Pan Q.-K., and Liang Y.-C. A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times. Computers and Operations Research (2008) 10.1016/j.cor.2008.06.007
25. Ruiz R., and Stutzle T. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 174 (2006) 38-53
26. Nawaz M., Enscore Jr. E.E., and Ham I.A. Heuristic algorithm for the m-machine, n-job flow shop sequencing problem. OMEGA 11 1 (1983) 91-95
27. Lin S., and Kernighan B.W. An effective heuristic algorithm for the traveling salesman problem. Operations Research 21 (1973) 498-516
28. L. Davis, Applying adaptive algorithms to epistatic domains, in: Proceedings of the International Joint Conference on Artificial Intelligence, 1985, pp. 162-164.
29. Goldberg D.E., and Lingle R. Alleles, loci, and the TSP. Proceedings of the First International Conference on Genetic Algorithms (1985), Lawrence Erlbaum Associates, Hillside, NJ 154-159
30. Pan Q.-K., Fatih Tasgetiren M., and Liang Y.-C. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem with makespan and total flowtime criteria. Computers and Operations Research (2007) 10.1016/j.cor.2006.12.030. 2007
31. Reinelt G. TSPLIB-a traveling salesman problem library. ORSA Journal on Computing 4 (1996) 134-143