Comparative study of some solution methods for traveling salesman problem using genetic algorithms

Cybernetics and Systems

Volumn 40, Issue 1, 2009, Pages 1-24

  Bhattacharyya, Malay ^a   Bandyopadhyay, Anup Kumar ^b  

^a INDIAN STATISTICAL INSTITUTE   (India)

^b JADAVPUR UNIVERSITY   (India)

Author keywords

Genetic algorithms; Network; Traveling salesman problem

Indexed keywords

ELECTRIC NETWORK TOPOLOGY; GENETIC ALGORITHMS; PROBLEM SOLVING;

BEST SOLUTIONS; C PROGRAMS; COMPARATIVE STUDIES; NETWORK; NETWORK TOPOLOGIES; SOLUTION METHODS; VARIATIONS OF;

TRAVELING SALESMAN PROBLEM;

EID: 57849112747     PISSN: 01969722     EISSN: 10876553     Source Type: Journal    
DOI: 10.1080/01969720802492967     Document Type: Article

References (21)

1. Arora, S. 2003. Approximation schemes for NP-hard geometric optimization problems: A survey. Mathematical Programming 97:43-69.
2. Bellmore, M and Nemhauser, G. L. 1968. The traveling salesman problem: A survey. Operations Research 16:538-558.
3. Bhattacharyya, M. 2007a. A hybrid algorithm using genetic adaptive systems and heuristics for partition problem. Proceedings of the International Conference on Intelligent Systems and Networks. Haryana, India, 184-189.
4. Bhattacharyya, M. 2007b. Solving single courier problem using genetic algorithms. ME Thesis, Jadavpur University, India.
5. Cormen, T. H., Leiserson, C. V., Rivest, R. L., and Stein, C. 2005. Introduction to Algorithms, 2nd Ed. PHI. New Delhi, Prentice Hall of India.
6. Dantzig, G. B., Fulkerson, D. R., and Johnson, S. M. 1959. On a linear-programming, combinatorial approach to the traveling salesman problem. JORSA 7:1: 58-66.
7. De Jong, K. A. 1975. An analysis of the behavior of a class of genetic adaptive systems. PhD Disseration. Ann Arbor, MI: University of Michigan.
8. De Jong, K. A. and Sarma, J. 1992. Generation gaps revisited. Proceedings of the Second Workshop on Foundations of Genetic Algorithms (USA), 19-28.
9. Dorigo, M. and Gambardella, L. M. 1997. Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transaction on Evolutionary Computation 1:53-66.
10. Foo, N. Y. and Bosworth, J. L. 1972. Algebraic, geometric and stochastic aspects of genetic operators. National Aeronautics and Space Administration. Washington, DC.
11. Garey, M. R. and Johnson, D. S. 1979. Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman & Co.
12. Goldberg, D. E. 2005. Genetic algorithms in search, optimization, & machine learning (9th reprint), Pearson Education. 9th Indian Reprint, New Delhi.
13. Grefenstette, J., Gopal, J. R., Rosmaita, B. J., and Van Gucht, D. 1985. Genetic algorithms for the traveling salesman problem. Proceedings of an International Conference on Genetic Algorithms and Their Applications, 160-168.
14. Holland, J. H. 1975. Adaptation in natural and artificial systems. Ann Arbor, MI: The University of Michigan Press.
15. Hong, S. 1972. Linear programming approach for the traveling salesman problem. PhD Dissertation. Baltimore: Johns Hopkins University.
16. Konar, A. 2005. Computational intelligence principles, techniques and applications. Netherlands: Springer-Verlag.
17. Lin, S. and Kernighan, B. W. 1973. An effective heuristic algorithm for the traveling salesman problem. Operations Research 21:495-516.
18. Miller, E. Tucker, A. W., and Zemlin, R. A. 1960. Integer programming formulation and traveling salesman problem. Journal of ACM 7:326-329.
19. Sengoku, H. and Yoshihara, I. 1993. An evaluation of optimizing capability of genetic algorithm-GA vs SA. (Japanese). Information Processing Society of Japan 47th National Conv.
20. Sengoku, H. and Yoshihara, I. 1998. A fast TSP solver using GA on JAVA. AROB III 98 Japan (January 19-21) 283-288.
21. Syswerda, G. 1990. A study of reproduction in generational and steady-state genetic algorithms. Proceedings of the Workshop on Foundations of Genetic Algorithms, (Indiana).