Shall We Repair? Genetic AlgorithmsCombinatorial Optimizationand Feasibility Constraints

............................................................................................................................. ii Dedication ......................................................................................................................... iii Acknowledgements .......................................................................................................... iv List of Figures.................................................................................................................. xii

[1]  C. Darwin,et al.  On the Origin of Species by Charles Darwin , 1999 .

[2]  George B. Dantzig,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, Oper. Res..

[3]  Richard M. Friedberg,et al.  A Learning Machine: Part I , 1958, IBM J. Res. Dev..

[4]  Richard M. Friedberg,et al.  A Learning Machine: Part II , 1959, IBM J. Res. Dev..

[5]  A. Land,et al.  An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.

[6]  Lawrence J. Fogel,et al.  Artificial Intelligence through Simulated Evolution , 1966 .

[7]  E. Mayr.  Populations, Species, and Evolution, An Abridgment of Animal Species and Evolution , 1970 .

[8]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[9]  Nichael Lynn Cramer,et al.  A Representation for the Adaptive Generation of Simple Sequential Programs , 1985, ICGA.

[10]  Lawrence Davis,et al.  Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.

[11]  John J. Grefenstette,et al.  Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[12]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.

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

[14]  Heinz Mühlenbein,et al.  Evolution algorithms in combinatorial optimization , 1988, Parallel Comput..

[15]  L. D. Whitley,et al.  Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator , 1989, ICGA.

[16]  George Luger,et al.  Artificial Intelligence: Structures and Strategies for Complex Problem Solving (5th Edition) , 2004 .

[17]  Heinz Mühlenbein,et al.  Parallel Genetic Algorithms, Population Genetics, and Combinatorial Optimization , 1989, Parallelism, Learning, Evolution.

[18]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

[19]  Martina Gorges-Schleuter,et al.  ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy , 1989, ICGA.

[20]  Donald E. Brown,et al.  A Parallel Genetic Heuristic for the Quadratic Assignment Problem , 1989, ICGA.

[21]  David B. Fogel,et al.  Simulated Evolution: A 30-Year Perspective , 1990, 1990 Conference Record Twenty-Fourth Asilomar Conference on Signals, Systems and Computers, 1990..

[22]  Kenneth A. De Jong,et al.  An Analysis of Multi-Point Crossover , 1990, FOGA.

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

[24]  Gunar E. Liepins,et al.  Genetic Algorithms Applications to Set Covering and Traveling Salesman Problems , 1990 .

[25]  John R. Searle,et al.  Minds, brains, and programs , 1980, Behavioral and Brain Sciences.

[26]  A. M. Turing,et al.  Computing Machinery and Intelligence , 1950, The Philosophy of Artificial Intelligence.

[27]  Takeshi Yamada,et al.  Conventional Genetic Algorithm for Job Shop Problems , 1991, ICGA.

[28]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[29]  R. A. Brooks,et al.  Intelligence without Representation , 1991, Artif. Intell..

[30]  G. Syswerda,et al.  Schedule Optimization Using Genetic Algorithms , 1991 .

[31]  C. McDiarmid.  SIMULATED ANNEALING AND BOLTZMANN MACHINES A Stochastic Approach to Combinatorial Optimization and Neural Computing , 1991 .

[32]  David E. Goldberg,et al.  Real-coded Genetic Algorithms, Virtual Alphabets, and Blocking , 1991, Complex Syst..

[33]  Sushil J. Louis,et al.  Designer Genetic Algorithms: Genetic Algorithms in Structure Design , 1991, ICGA.

[34]  Philip Husbands,et al.  Genetic algorithms in optimisation and adaptation , 1992 .

[35]  Kalyanmoy Deb,et al.  Massive Multimodality, Deception, and Genetic Algorithms , 1992, PPSN.

[36]  William M. Spears,et al.  Crossover or Mutation? , 1992, FOGA.

[37]  Alberto Colorni,et al.  A genetic algorithm to solve the timetable problem , 1992 .

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

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

[40]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[41]  L. Darrell Whitley,et al.  Dataflow Parallelism in Genetic Algorithms , 1992, PPSN.

[42]  D. Fogel.  Applying evolutionary programming to selected traveling salesman problems , 1993 .

[43]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[44]  John H. Holland,et al.  When will a Genetic Algorithm Outperform Hill Climbing , 1993, NIPS.

[45]  Alice E. Smith,et al.  Expected Allele Coverage and the Role of Mutation in Genetic Algorithms , 1993, ICGA.

[46]  David Beasley,et al.  An overview of Genetic Algorithms: Pt1, Fundamentals , 1993 .

[47]  Panos M. Pardalos,et al.  The Quadratic Assignment Problem: A Survey and Recent Developments , 1993, Quadratic Assignment and Related Problems.

[48]  Y. L. Chan,et al.  A Genetic Algorithm (GA) Shell for Iterative Timetabling , 1994 .

[49]  Rok Sosic,et al.  Using the quality-time tradeoff in local optimization , 1994, Proceedings of ANZIIS '94 - Australian New Zealnd Intelligent Information Systems Conference.

[50]  L. Darrell Whitley,et al.  Modeling Simple Genetic Algorithms for Permutation Problems , 1994, FOGA.

[51]  Darrell Whitley,et al.  A genetic algorithm tutorial , 1994, Statistics and Computing.

[52]  Andrew L. Tuson.  The Implementation of a Genetic Algorithm for the Scheduling and Topology Optimisation of Chemical Flowshops , 1994 .

[53]  Z. Michalewicz,et al.  Genocop III: a co-evolutionary algorithm for numerical optimization problems with nonlinear constraints , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[54]  Theodore C. Belding,et al.  The Distributed Genetic Algorithm Revisited , 1995, ICGA.

[55]  Thomas Bäck,et al.  A Comparative Study of a Penalty Function, a Repair Heuristic and Stochastic Operators with the Set-Covering Problem , 1995, Artificial Evolution.

[56]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[57]  Alice E. Smith,et al.  A genetic approach to the quadratic assignment problem , 1995, Comput. Oper. Res..

[58]  D. Wilson.  Darwinism Evolving: Systems Dynamics and the Genealogy of Natural Selection. , 1995, Artificial Life.

[59]  D. Wolpert,et al.  No Free Lunch Theorems for Search , 1995 .

[60]  John R. Koza,et al.  Parallel Genetic Programming on a Network of Transputers , 1995 .

[61]  David E. Goldberg,et al.  Genetic Algorithms, Tournament Selection, and the Effects of Noise , 1995, Complex Syst..