The ordered clustered travelling salesman problem: A hybrid genetic algorithm

The Scientific World Journal

Volumn 2014, Issue , 2014, Pages

  Ahmed, Zakir Hussain ^a  

^a AL IMAM MOHAMMAD IBN SAUD ISLAMIC UNIVERSITY IMSIU   (Saudi Arabia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE; CHROMOSOME; COMPARATIVE STUDY; GENE MUTATION; GENE STRUCTURE; GENETIC ALGORITHM; HYBRID GENETIC ALGORITHM; STATISTICS; ALGORITHM; THEORETICAL MODEL;

ALGORITHMS; MODELS, THEORETICAL;

EID: 84896374825     PISSN: None     EISSN: 1537744X     Source Type: Journal    
DOI: 10.1155/2014/258207     Document Type: Article

References (26)

1. Chisman J. A., The clustered traveling salesman problem. Computers and Operations Research 1975 2 2 115 119 2-s2.0-0001201888
2. Gendreau M., Hertz A., Laporte G., The traveling salesman problem with backhauls. Computers and Operations Research 1996 23 5 501 508 2-s2.0-0030146320 10.1016/0305-0548(95)00036-4 (Pubitemid 126375156)
3. Guttmann-Beck N., Hassin R., Khuller S., Raghavachari B., Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem. Algorithmica 2000 28 4 422 437 2-s2.0-0011936218 10.1007/s004530010045
4. Lokin F. C. J., Procedures for travelling salesman problems with additional constraints. European Journal of Operational Research 1979 3 2 135 141 2-s2.0-0000852186
5. Laporte G., Potvin J.-Y., Quilleret F., Tabu search heuristic using genetic diversification for the clustered traveling salesman problem. Journal of Heuristics 1997 2 3 187 200 2-s2.0-0031543479
6. Laporte G., Palekar U., Some applications of the clustered travelling salesman problem. Journal of the Operational Research Society 2002 53 9 972 976 2-s2.0-0036723773 10.1057/palgrave.jors.2601420 (Pubitemid 34964222)
7. Ahmed Z. H., Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator. International Journal of Biometrics & Bioinformatics 2010 3 6 96 105
8. Ahmed Z. H., A hybrid sequential constructive sampling algorithm for the bottleneck traveling salesman problem. International Journal of Computational Intelligence Research 2010 6 3 475 484
9. Aramgiatisiris T., An exact decomposition algorithm for the traveling salesman problem with backhauls. Journal of Research in Engineering and Technology 2004 1 151 164
10. TSPLIB,. 1995, http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/
11. Ahmed Z. H., An exact algorithm for the clustered traveling salesman problem. Opsearch 2013 50 2 215 228
12. Little J. D. E., Murthy K. G., Sweeny D. W., Karel C., An algorithm for the travelling salesman problem. Operations Research 1963 11 972 989
13. Jongens K., Volgenant T., The symmetric clustered traveling salesman problem. European Journal of Operational Research 1985 19 1 68 75 2-s2.0-0021817077 (Pubitemid 15458555)
14. Gendreau M., Laporte G., Potvin J. Y., Heuristics for the clustered traveling salesman problem. 1994 CRT-94-54 Montreal, Canada Centre de Recherché sur les Transports, Universite de Montreal
15. Potvin J.-Y., Guertin F., A genetic algorithm for the clustered traveling salesman problem with an a priori order on the clusters. 1995 CRT-95-06 Montréal, Canada Centre de recherchesur les transports, Université de Montréal
16. Potvin J.-Y., Guertin F., Osman I. H., Kelly J., The clustered traveling salesman problem: a genetic approach. Meta-Heuristics: Theory & Applications 1996 Norwell, Mass, USA Kluwer Academic 619 631
17. Anily S., Bramel J., Hertz A., 5/3-Approximation algorithm for the clustered traveling salesman tour and path problems. Operations Research Letters 1999 24 1 29 35 2-s2.0-0032631907 10.1016/S0167-6377(98)00046-7
18. Christofides N., Worst-case analysis of a new heuristic for the traveling salesman problem. 1976 388 Pittsburgh, Pa, USA Graduate School of Industrial Administration, Carnegie-Mellon University
19. Sheng W., Xi N., Song M., Chen Y., Robot path planning for dimensional measurement in automotive manufacturing. Journal of Manufacturing Science and Engineering, Transactions of the ASME 2005 127 2 420 428 2-s2.0-19344371007 10.1115/1.1870013 (Pubitemid 40718398)
20. Ding C., Cheng Y., He M., Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs. Tsinghua Science and Technology 2007 12 4 459 465 2-s2.0-34447636209 10.1016/S1007- 0214(07)70068-8 (Pubitemid 47095389)
21. Goldberg D. E., Genetic Algorithms in Search, Optimization and Machine Learning 1989 New York, NY, USA Addison-Wesley
22. Ahmed Z. H., A hybrid genetic algorithm for the bottleneck traveling salesman problem. ACM Transactions on Embedded Computing Systems 2013 12 1, article 9
23. Deb K., Optimization for Engineering Design: Algorithms and Examples 1995 New Delhi, India Prentice Hall India
24. Ahmed Z. H., Multi-parent extension of sequential constructive crossover for the travelling salesman problem. International Journal of Operational Research 2011 11 3 331 342 2-s2.0-79960676400 10.1504/IJOR.2011.041347
25. Ahmed Z. H., An experimental study of a hybrid genetic algorithm for the maximum travelling salesman problem. Mathematical Sciences 2013 7 1 1 7
26. Wang C.-X., Cui D.-W., Wang Z.-R., Chen D., A novel ant colony system based on minimum 1-tree and hybrid mutation for TSP. Proceedings of the 1st International Conference on Natural Computation (ICNC '05) August 2005 Changsha, China Springer 1269 1278 LNCS 2-s2.0-26844487040