Genetic algorithm performance with different selection strategiesin solving TSP

Proceedings of the World Congress on Engineering 2011, WCE 2011

Volumn 2, Issue , 2011, Pages 1134-1139

  Razali, Noraini Mohd ^a   Geraghty, John ^a  

^a DUBLIN CITY UNIVERSITY   (Ireland)

Author keywords

Genetic algorithm; Optimization; Selection; Travelling salesman problem

Indexed keywords

ALGORITHM PERFORMANCE; CROSSOVER AND MUTATION; GENETIC OPERATORS; PARENT SELECTION; PREMATURE CONVERGENCE; PROBLEM SIZE; ROULETTE WHEEL SELECTION; SELECTION; SOLUTION QUALITY; TOURNAMENT SELECTION; TRAVELLING SALESMAN PROBLEM;

MATHEMATICAL OPERATORS; TRAVELING SALESMAN PROBLEM; WHEELS;

GENETIC ALGORITHMS;

EID: 80755174441     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. D. Beasley, D. Bull, and R. Martin, An Overview of genetic algorithms: Part 1, Fundamentals, University Computing, vol. 2, pp. 58-69, 1993
2. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys, The Traveling Salesman Problem, John Wiley & Sons Ltd., 1985
3. O. A. Jadaan, L. Rajamani, C. R. Rao, "Improved Selection Operator for GA," Journal of Theoretical and Applied Information Technology, 2005
4. J. Zhong, X. Hu, M. Gu, J. Zhang, "Comparison of Performance between Different Selection Strategies on Simple Genetic Algorithms," Proceeding of the International Conference on Computational Intelligence for Modelling, Control and automation, and International Conference of Intelligent Agents, Web Technologies and Internet Commerce, 2005
5. B. A. Julstrom, It?s All the Same to Me: Revisiting Rank-Based Probabilities and Tournaments, Department of Computer Science, St. Cloud State University, 1999
6. S. Mashohor, J. R. Evans, T. Arslan, Elitist Selection Schemes for Genetic Algorithm based Printed Circuit Board Inspection System, Department of Electronics and Electrical Engineering, University of Edinburgh, 974-978, 2005
7. K. S. Goh, A. Lim, B. Rodrigues, Sexual Selection for Genetic Algorithms, Artifial Intelligence Review 19: 123-152, Kluwer Academic Publishers, 2003
8. D.E. Goldberg and K. Deb, A comparative analysis of selection schemes used in genetic algorithms, in: G.J.E. Rawlins (Ed.), Foundations of Genetic Algorithms, Morgan Kaufmann, Los Altos, 1991, pp.69-93.
9. J. H. Holland, Adaptation in natural and artificial systems, The University of Michigan press, 1975
10. P. Larranaga, C. M. H. Kuijpers, R. H. Murga, I. Inza, S. Dizdarevic, Genetic algorithms for the Travelling Salesman Problem: A Review of Representations and Operators, Artificial Intelligence Review 13: 129-170, 1999
11. Handbook of Evolutionary Computation, IOP Publishing Ltd. and Oxford University Press, 1997
12. T. Blickle, L. Thiele, A Comparison of Selection Schemes used in Genetic Algorithms. TIK-Report, Zurich, 1995
13. J. E. Baker, "Adaptive selection methods for genetic algorithm," Proceeding of an International Conference on Genetic Algorithms and Their Applications, 100-111, 1985
14. D. Whitley, "The genitor algorithm and selection pressure: Why rank-based allocation of reproductive trials is the best," In Proceeding of the 3rd International Conference on Genetic Algorithms, 1989
15. G. Reinelt, TSPLIB - A Travelling Salesman Problem Library. ORSA Journal on Computing, Vol.3, No.4, 376-384, 1991
16. K. De Jong, W. M. Spears, "Using Genetic Algorithms to Solve NP Complete Problems," Proceedings of the Third International Conference on Genetic Algorithm, Morgan Kaufman, Los Altos, CA, 124-132, 1989