A genetic algorithm for the generalized traveling salesman problem

2007 IEEE Congress on Evolutionary Computation, CEC 2007

Volumn , Issue , 2007, Pages 2382-2389

  Tasgetiren, M Fatih ^b   Suganthan, P N ^c   Pan, Quan Ke ^d   Liang, Yun Chia ^a,e  

^a IEEE

^b SULTAN QABOOS UNIVERSITY   (Oman)

^c NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^d LIAOCHENG UNIVERSITY   (China)

^e YUAN ZE UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

LOCAL SEARCH; MINIMUM COST PASSING;

BENCHMARKING; CLUSTER ANALYSIS; COMPUTATIONAL METHODS; TRAVELING SALESMAN PROBLEM;

GENETIC ALGORITHMS;

EID: 79955174030     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2007.4424769     Document Type: Conference Paper

References (20)

1. G. Laporte, A. Asef-Vaziri, C. Sriskandarajah, Some applications of the generalized travelling salesman problem, Journal of the Operational Research Society 47 (12) (1996) 461-1467.
2. A. Henry-Labordere, 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, PhD thesis, University of Michigan, 1988.
4. D. Ben-Arieh, G. Gutin, M. Penn, A. Yeo, A. Zverovitch, Process planning for rotational parts using the generalized traveling salesman problem, International Journal of Production Research 41 (11) (2003) 2581-2596.
5. J.P. Saskena, Mathematical model of scheduling clients through welfare agencies, Journal of the Canadian Operational Research Society 8 (1970) 185-200.
6. S.S. Srivastava, S. Kumar, R.C. Garg, P. Sen, Generalized traveling salesman problem through n sets of nodes, Journal of the Canadian Operational Research Society 7 (1970) 97-101.
7. G. Laporte, H. Mercure, Y. Nobert, Finding the shortest Hamiltonian circuit through n clusters: A Lagrangian approach, Congressus Numerantium 48 (1985) 2"-290.
8. G. Laporte, H. Mercure, Y. Nobert, Generalized travelling salesman problem through n-sets of nodes-the asymmetrical case, Discrete AppliedMathematics 18 (2) (1987) 185-197.
9. G. Laporte, Y. Nobert, Generalized traveling salesman problem through n-sets of nodes - An integer programming approach, INFOR 21 (1) (1983)61-75.
10. M. Fischetti, J.J. Salazar-Gonzalez, P. Toth, The symmetrical generalized traveling salesman polytope, Networks 26(2) (1995) 113-123.
11. M. Fischetti, J.J. Salazar-Gonza'lez, P. Toth, A branch-and-cut algorithm for the symmetric generalized travelling salesman problem, Operations Research 45 (3) (1997) 378-394.
12. A.G. Chentsov, L.N. Korotayeva, The dynamic programming method in the generalized traveling salesman problem, Mathematical and Computer Modelling 25 (1) (1997) 93-105.
13. C.E. Noon, J.C. Bean, A Lagrangian based approach for the asymmetric generalized traveling salesman problem, Operations Research 39 (4) (1991)623-632.
14. J. Renaud, F.F. Boctor, An efficient composite heuristic for the symmetric generalized traveling salesman problem, European Journal of Operational Research 108 (3) (1998) 571-584.
15. J. Renaud, F.F. Boctor, G. Laporte, A fast composite heuristic for the symmetric traveling salesman problem, INFORMS Journal on Computing 4 (1996) 134-143.
16. L. V. Snyder and M. S. Daskin, A random-key genetic algorithm for the generalized traveling salesman problem. European Journal of Operational research 174 (2006)38-53.
17. M. Gen and R Cheng, Genetic Algorithms and Engineering Design, John Wiley & Sons, Wiley Series in Engineering Design and Automation, 1997.
18. G. Reinelt, TSPLIB - A traveling salesman problem library, ORSA Journal on Computing 4 (1996) 134-143.
19. Pan Q-K, Tasgetiren M. F, 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), doi:10.1016/j.cor.2006.12.030.
20. H.R. Lourenc, O. Martin, T. Stutzle, Iterated local search, in: F. Glover, G. Kochenberger (Eds.), Handbook of Metaheuristics, International Series in Operations Research & Management Science, vol. 57, Kluwer Academic Publishers, Norwell, MA, 2002, pp. 321-353. (29).