The improved initialization method of genetic algorithm for solving the optimization problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4234 LNCS - III, Issue , 2006, Pages 789-796

  Kang, Rae Goo ^a   Jung, Chai Yeoung ^a  

^a Chosun University   (South Korea)

Author keywords

GA; Genetic Algorithm; Initialization; Optimization

Indexed keywords

CLASSIFICATION (OF INFORMATION); COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; NUMERICAL METHODS; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES; TRAVELING SALESMAN PROBLEM;

RANDOM INITIALIZATION METHODS;

GENETIC ALGORITHMS;

EID: 33750725698     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11893295_87     Document Type: Conference Paper

References (9)

1. Jin gang gou.: Genetic Algorithm and the application, kousa (2000)
2. Goldberg, D.: Genetic Algorithms in search, Optimization, and Machine Learning Addison Wesley, Reading, MA (1989)
3. K.D. Boese, "Cost Versus Distance In the Traveling Salesman Problem", Technical Report CSD-950018, UCLA (1995)
4. Mun byoung ro.: Genetic Algorithm, duyangsa(2003)
5. Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, Springer-Verlag (1992)
6. Grefenstette, J. Gopal,R. Rosmaita, B and Gucht, D.: "Genetic Algorithms for the Traveling Salesman Problem", Proc. the 1st Inter. Conf. on GAs and Their Applications (1985)
7. Whitley, D. Starkweather, T and Fuquay, D.: "Scheduling problems and traveling salesman: the genetic edge recombination and operator", Proc. Third Int. Conf. G As (1989) 133-140
8. D. Whitley, T. Starkweather, and D. Fuquay. Scheduling Problems and the Traveling Salesman: the Genetic Edge Recombination Operator. Proc. Third Int. Conf. on Genetic Algorithms and Their Applications (1989)
9. Chuan-Kang Ting: Improving Edge Recombination through Alternate Inheritance and Greedy Manner, EvoCOP 2004, LNCS 3004 (2004) 210-219