Genetic Algorithms and Neighbourhood Search

Genetic algorithms (GAs) have proved to be a versatile and effective approach for solving combinatorial optimization problems. Nevertheless, there are many situations in which the simple GA does not perform particularly well, and various methods of hybridization have been proposed. These often involve incorporating other methods such as simulated annealing or local optimization as an ‘add-on’ extra to the basic GA strategy of selection and reproduction.

[1]  Colin Reeves,et al.  Hybrid genetic algorithms for bin-packing and related problems , 1996, Ann. Oper. Res..

[2]  Heinz Mühlenbein,et al.  Evolution in Time and Space - The Parallel Genetic Algorithm , 1990, FOGA.

[3]  Maurizio Rebaudengo,et al.  Hybrid Genetic Algorithms for the Travelling Salesman Problem , 1993 .

[4]  John J. Grefenstette,et al.  Proceedings of the 1st International Conference on Genetic Algorithms , 1985 .

[5]  David E. Goldberg,et al.  An Analysis of Reproduction and Crossover in a Binary-Coded Genetic Algorithm , 1987, ICGA.

[6]  Stephanie Forrest,et al.  Proceedings of the 5th International Conference on Genetic Algorithms , 1993 .

[7]  Darrell Whitley,et al.  The Travelling Salesman and Sequence Scheduling: Quality Solutions using Genetic Edge Recombination , 1990 .

[8]  Felicity A. W. George,et al.  A Study in Set Recombination , 1993, ICGA.

[9]  Gilbert Syswerda,et al.  A Study of Reproduction in Generational and Steady State Genetic Algorithms , 1990, FOGA.

[10]  Larry J. Eshelman,et al.  Crossover's Niche , 1993, ICGA.

[11]  David B. Fogel,et al.  Parallel problem solving from nature, 2: Proceedings of the Second Conference on parallel problem solving from nature: R. Männer and B. Manderick (eds.), North-Holland, Amsterdam, ISBN 0-444-89730-5, xii + 618pp., US$168.50/Dfl. 295.00 , 1993 .

[12]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[13]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[14]  Colin R. Reeves,et al.  Diversity and Diversification in Genetic Algorithms: Some Connections with Tabu Search , 1993 .

[15]  Gunar E. Liepins,et al.  A New Approach on the Traveling Salesman Problem by Genetic Algorithms , 1993, ICGA.

[16]  L. Booker.  Foundations of genetic algorithms. 2: L. Darrell Whitley (Ed.), Morgan Kaufmann, San Mateo, CA, 1993, ISBN 1-55860-263-1, 322 pp., US$45.95 , 1994 .

[17]  Nicholas J. Radcliffe,et al.  Equivalence Class Analysis of Genetic Algorithms , 1991, Complex Syst..

[18]  Jim Antonisse,et al.  A New Interpretation of Schema Notation that Overtums the Binary Encoding Constraint , 1989, ICGA.

[19]  Nicholas J. Radcliffe,et al.  Non-Linear Genetic Representations , 1992, PPSN.

[20]  Michael D. Vose,et al.  Modeling Simple Genetic Algorithms , 1995, Evolutionary Computation.

[21]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[22]  L. Darrell Whitley,et al.  An Executable Model of a Simple Genetic Algorithm , 1992, FOGA.

[23]  Sushil J. Louis,et al.  Syntactic Analysis of Convergence in Genetic Algorithms , 1992, FOGA.

[24]  Roger L. Wainwright,et al.  Multiple Vehicle Routing with Time and Capacity Constraints Using Genetic Algorithms , 1993, ICGA.

[25]  Dirk Van Gucht,et al.  The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem , 1989 .

[26]  Emile H. L. Aarts,et al.  Genetic Local Search Algorithms for the Travelling Salesman Problem , 1990, PPSN.

[27]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[28]  Lawrence Davis,et al.  Shall We Repair? Genetic AlgorithmsCombinatorial Optimizationand Feasibility Constraints , 1993, ICGA.

[29]  Schloss Birlinghoven.  Evolution in Time and Space -the Parallel Genetic Algorithm , 1991 .

[30]  Gilbert Syswerda,et al.  Simulated Crossover in Genetic Algorithms , 1992, FOGA.

[31]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[32]  Pentti Kanerva,et al.  Sparse Distributed Memory , 1988 .

[33]  Lawrence Davis,et al.  Genetic Algorithms and Simulated Annealing , 1987 .

[34]  Nicholas J. Radcliffe,et al.  Forma Analysis and Random Respectful Recombination , 1991, ICGA.

[35]  Alain Delchambre,et al.  A genetic algorithm for bin packing and line balancing , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[36]  Larry J. Eshelman,et al.  The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination , 1990, FOGA.