Preventing premature convergence to local optima in genetic algorithms via random offspring generation

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

Volumn 1611, Issue , 1999, Pages 127-136

  Rocha, Miguel ^a   Neves, José ^a  

^a UNIVERSITY OF MINHO   (Portugal)

Author keywords

Genetic algorithms; Genetic diversity; The traveling sa lesman problem

Indexed keywords

BIODIVERSITY; EXPERT SYSTEMS; INTELLIGENT SYSTEMS; TRAVELING SALESMAN PROBLEM;

CARDINALITIES; CONVERGENCE PROCESS; GENETIC ALGORITHM (GAS); GENETIC DIVERSITY; OBJECTIVE FUNCTIONS; OPTIMIZATION PROBLEMS; PRE-MATURE CONVERGENCES; THE TRAVELING SA-LESMAN PROBLEM;

GENETIC ALGORITHMS;

EID: 84947784223     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48765-4_16     Document Type: Conference Paper

References (11)

1. [Dav91] Lawrence Davis ed. Handbook of Genetic Algorithms, Van Nostrand Reinhold, 1991.
2. [DeJ75] Kenneth A. DeJong, An Analysis of the Behavior of a Class of Genetic Adaptive Systems, Doctoral Dissertation, University of Michigan, 1975.
3. [Gre85] John J. Grenfenstette, Rajeev Gopal, Brian Rosmaita and Dirk Van Gucht, Genetic Algorithms for the Traveling Salesman Problem. In J. Grenfenstette ed. Proceedings of the Second International Conference on Genetic Algorithms and their Applications, MIT, Cambridge, July 1987, Lawrence Erlbaum Associates: Hillsdale, New Jersey.
4. [Hol75] J. H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, 1975.
5. [Kur96] V. Kureichick, A. N. Melikhov, V. V. Miaghick, O. V. Savelev and A. P. Topchy, Some New Features in the Genetic Solution of the Traveling Salesman Problem. In Ian Parmee and M. J. Denham eds. Adaptive Computing in Engineering Design and Control 96(ACEDC'96), 2nd International Conference of the Integration of Genetic Algorithms and Neural Network Computing and Related Adaptive Computing with Current Engineering Practice, Plymouth, UK, March 1996.
6. [Lap91] Gilbert Laporte, The Traveling Salesman Problem: An Overview of Exact and Approximate Algorithms, European Journal of Operational Research, 59: 231247, 1992.
7. [Muh91] H. Muhlenbein, Evolution in Time and Space-The Parallel Genetic Algorithm. In G. Rawlins ed. Foundations of Genetic Algorithms, pages 316-337, San Mateo, 1991. Morgan-Kaufmann.
8. [Rei95] G. Reinelt, TSPLIB95. Universitat Heidelberg, 1995.
9. [RocNev98] M. Rocha and J. Neves, An Analysis of Genetic Algorithms applied to the Traveling Salesman Problem. Technical Report, Universidade do Minho, 1998.
10. [Sch89] M. G. Schleuter, ASPARAGOS-An Asynchronous Parallel Genetic Optimization Strategy. In J. D. Schafer ed. Proceedings of the Third International Conference on Genetic Algorithms, George-Mason University, Morgan Kaufman, 1989.
11. [Sta91] T. Starkweather, S. McDaniel, K. Mathias, D. Whitley and C. Whitley, A Comparison of Genetic Sequencing Algorithms. In R. Belew and L. Booker ed. Proceedings of the Fourth International Conference on Genetic Algorithms, Morgan-Kaufmann, 1991.