A genetic algorithm balancing exploration and exploitation for the travelling salesman problem

Proceedings - 4th International Conference on Natural Computation, ICNC 2008

Volumn 1, Issue , 2008, Pages 505-509

  Zhao, Gang ^a   Luo, Wenjuan ^a   Nie, Huiping ^a   Li, Chen ^a  

^a BEIJING INFORMATION SCIENCE AND TECHNOLOGY UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; CONVERGENCE OF NUMERICAL METHODS; DIESEL ENGINES; GENETIC ALGORITHMS; PETROLEUM ENGINEERING; PETROLEUM PROSPECTING; UNMANNED VEHICLES;

COMBINATORIAL PROBLEMS; EMPIRICAL TESTS; PREMATURE CONVERGENCES; RESEARCH FIELDS; SOLUTION QUALITIES; TRAVELLING SALESMAN PROBLEMS;

TRAVELING SALESMAN PROBLEM;

EID: 57649234031     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNC.2008.421     Document Type: Conference Paper

References (22)

1. J. H. Holland, Adaptation in Natural and Artificial Systems, Ann Arbor: The University of Michigan Press, 1975.
2. D. E. Goldberg, Genetic Algorithms in Search Optimization and Machine learning, Addision Wesley, 1989.
3. D. E. Goldberg, The Design of Innovation: Lessons from and for Competent Genetic Algorithms, MA: Kluwer Academic Publishers, Boston, 2002.
4. J. T. Alander, An Indexed Bibliography of Distributed Genetic Algorithms, Technical Report No. 94-1-PARA, Department of Information Technology and Production Economics, University of Vaasa, Finland, 1997.
5. T. Starkweather, D. Whitley, K. Mathias, "Optimization using distributed genetic algorithms in Parallel Problem Solving from Nature", H. P. Schwefel and R. Manner, Eds. New York, NY: Springer-Verlag, 1992, pp. 176-183.
6. A. Chipperfield, P. Fleming, "Parallel genetic algorithms", Handbook of Parallel and Distributed Computing, A. Y. Zomaya, Ed. New York, NY: McGraw-Hill, 1996, pp. 1118-1143.
7. N. Neves, A.-T. Nguyen, and E. L. Torres, "A study of a non-linear optimization problem using a distributed genetic algorithm", 1996 Int'l Conf. Parallel Processing, 1996, Vol. II, pp. 29-36.
8. C. C Pettey, M. Leuze, and J. Grefenstette, "A parallel genetic algorithm", Second Inf Conf. Genetic Algorithms, 1987, pp. 155-164.
9. H. Muhlenbein, "Parallel genetic algorithms, population, genetics and combinatorial optimization", Third Int'l Conf. Genetic Algorithms, 1989, pp. 416-421.
10. E. L. Lawler, J. K. Lenstra, D. B. Shmoys, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, NY: Wiley-Interscience, New York, 1985.
11. J. Grefenstette, R. Gopal, B. Rosmaita and D. Gucht, "Genetic algorithms for the traveling salesman problem," Proceedings of the First International Conference on Genetic Algorithms and Their Applications, 1985, pp. 160-168.
12. D. Whitley, T. Starkweather and D. Fuquay, "Scheduling problems and traveling salesman: the genetic edge recombination operator," Proceedings of the Third International Conference on Genetic Algorithms and Their Applications, 1989, pp. 133-140.
13. G. Syswerda, "Schedule Optimization Using Genetic Algorithms", Davis, L. (Ed), Handbook of genetic algorithms, Van Nostrand Reinhold, New York, 1991, pp.332-349.
14. P. Larranaga, C. Kuijpers, R. Murga, and I. Inza, "Decomposing Bayesian Networks: Triangulation of the Moral Graph with Genetic Algorithm," Statistics and Computing, 1996, pp. 229-239.
15. Zbigniew, Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer-Verlag, 2nd edition, 1994.
16. D. B. Fogel, "Applying Evolutionary Programming to Selected Traveling Salesman Problems", Cybernetics and Systems, 1993, pp.27-36.
17. Q. CHEN, H. WU, X. ZHAO, "Greedy Edge Recombination Crossover to Solve Traveling Salesman Problem", Computer engineering and applications, 2006, pp. 19-22.
18. J. J. Greffenstette, J. E. Baker, How Genetic Algorithms Work: A Critical Look at Implicit Parallelism, ICGA, 1989, 20-27.
19. A. Simões, E. Costa, Using genetic algorithms to deal with dynamic environments: a comparative study of several approaches based on promoting diversity, The Proceedings of the Genetic and Evolutionary Computation Conference, San Francisco, CA: Morgan Kaufmann, New York, 2002.
20. J. Y. Potvin, "Genetic algorithms for the traveling salesman problem," Annals of Operations Research, 1996, Vol. 63, pp. 339-370.
21. P. Larranaga, C. Kuijpers, R. Murga, I. Inza and S. Dizdarevich, "Genetic algorithms for the travelling salesman problem: a review of representations and operators," Artificial Intelligence Review, 1999, Vol. 13, pp. 129-170.
22. G. Reinelt, "TSPLIB - a traveling salesman problem library", ORSA Journal on Computing, 1991, Vol.3, No.4, pp.376-384.