Bäck, T., Hoffmeister, F., and Schwefel, H. (1991).
A survey of evolution strategies.
In Proceedings of the Fourth International Conference on Genetic
Algorithms, pages 1-10. Morgan Kauffman, San Mateo, CA.
Caldwell, C. and Johnston, V. S. (1991).
Tracking a criminal suspect through "Face-Space" with a genetic
algorithm.
In Proceedings of Fourth International Conference on Genetic
Algorithms, pages 416-421. Morgan Kauffman.
Deb, K. and Goldberg, D. E. (1989).
An investigation of niche and species formation in genetic function
optimization.
In Proceedings of the Third International Conference on Genetic
Algorithms, pages 42-50. Morgan Kauffman, San Mateo, CA.
DeJong, K. A. (1975).
An Analysis of the Behavior of a class of Genetic Adaptive
Systems.
PhD thesis, University of Michigan, Ann Arbour.
Department of Computer and Communication Sciences.
Eshelman, L. J. (1991).
The chc adaptive search algorithm: How to have safe search when
engaging in nontraditional genetic recombination.
In Rawlins, G. J. E., editor, Foundations of Genetic
Algorithms-1, pages 265-283. Morgan Kauffman.
Gero, J. S. and Jo, J. H. (1991).
Design mutation as a computational process.
Working Paper, Design Computing Unit, Department of Architectural and
Design Science, University of Sydney, NSW 2006, Australia.
Gero, J. S., Louis, S. J., and Kundu, S. (1993).
Evolutionary learning of novel grammars for design improvement.
Artificial Intelligence for Engineering Design, Analysis and
Manufacturing, to appear.
Goel, A. and Chandresekaran, B. (1992).
Case-based design: A task analysis.
In Tong, C. and Sriram, D., editors, Artificial Intelligence in
Engineering Design, Vol II, pages 165-184. Academic Press, Inc.
Goldberg, D. E., Korb, B., and Deb, K. (1989).
Messy genetic algorithms: Motivation, analysis, and first results.
Technical Report TCGA Report No. 89002, The Clearinghouse for Genetic
Algorithms, University of Alabama, Tuscaloosa.
Goldberg, D. E. and Lingle, R. (1985).
Alleles, loci and the traveling salesman problem.
In Proceedings of an International Conference on Genetic
Algorithms, pages 10-19. Morgan Kauffman.
Goldberg, D. E. and Segrest, P. (1987).
Finite markov chain analysis of genetic algorithms.
In Proceedings of the Second International Conference on Genetic
Algorithms, pages 1-8. Lawrence Erlbaum Associates.
Huhns, M. and Acosta, R. (1992).
Argo: An analogical reasoning system for solving design problems.
In Tong, C. and Sriram, D., editors, Artificial Intelligence in
Engineering Design, Vol II, pages 105-144. Academic Press, Inc.
Le Grand, S. M. and Merz Jr., K. M. (1993).
The application of the genetic algorithm to the minimization of
potential energy functions.
Journal of Global Optimization, 3:49-66.
Lenat, D. B. (1983).
The role of heuristics in learning by discovery: Three case studies.
In Michalski, R. S., Carbonell, J. G., and Mitchell, T. M., editors,
Machine Learning, An Artificial Intelligence Approach, pages 243-306.
Morgan Kauffman.
Louis, S. J., McGraw, G., and Wyckoff, R. (1993).
Case-based reasoning assisted explanation of genetic algorithm
results.
Journal of Experimental and Theoretical Artificial
Intelligence, 5:21-37.
Louis, S. J. and Rawlins, G. J. E. (1991).
Designer genetic algorithms: Genetic algorithms in structure design.
In Proceedings of the Fourth International Conference on Genetic
Algorithms, pages 53-60. Morgan Kauffman, San Mateo, CA.
Louis, S. J. and Rawlins, G. J. E. (1993a).
Pareto optimality, ga-easiness and deception.
In Proceedings of the Fifth International Conference on Genetic
Algorithms, pages 118-123. Morgan Kauffman, San Mateo, CA.
Louis, S. J. and Rawlins, G. J. E. (1993b).
Syntactic analysis of convergence in genetic algorithms.
In Whitley, L. D., editor, Foundations of Genetic Algorithms -
2, pages 141-152. Morgan Kauffman, San Mateo, CA.
Mahfoud, S. W. and Goldberg, D. E. (1992).
Parallel recombinative simulated annealing: A genetic algorithm.
Technical Report IlliGAL Report No. 92002, The Illinois Genetic
Algorithm Laboratory, Department of General Engineering, University of
Illinois at Urbana-Champaign.
McGraw, G. (1992).
Letter spirit: Recognition and creation of letterforms based on fluid
concepts.
Technical Report 61, Center for Research on Concepts and Cognition,
Indiana University.
Mitchell, M. and Forrest, S. (1993).
Relative building-block fitness and the building-block hypothesis.
In Whitley, L. D., editor, Foundations of Genetic Algorithms -
2, pages 109-126. Morgan Kauffman, San Mateo, CA.
Mostow, J., Barley, M., and Weinrich, T. (1992).
Automated reuse of design plans in bogart.
In Tong, C. and Sriram, D., editors, Artificial Intelligence in
Engineering Design, Vol II, pages 57-104. Academic Press, Inc.
Powell, D. J., Tong, S. S., and Skolnik, M. M. (1989).
Engeneous domain independent machine learning for design
optimization.
In Proceedings of the Third International Conference on Genetic
Algorithms, pages 151-159. Morgan Kauffman.
Schaeffer, D. J., Eshelman, L. J., and Offut, D. (1991).
Spurious correlations and premature convergence in genetic
algorithms.
In Rawlins, G. J. E., editor, Foundations of Genetic
Algorithms-1, pages 102-114. Morgan Kauffman.
Schaeffer, D. J. and Morishima, A. (1987).
An adaptive crossover distribution mechanism for genetic algorithms.
In Proceedings of the Second International Conference on Genetic
Algorithms, pages 36-40. Lawrence Erlbaum Associates.
Schaeffer, D. J. and Morishima, A. (1988).
Adaptive knowledge representation: A content sensitive recombination
mechanism for genetic algorithms.
International Journal of Intelligent Systems, 3:229-246.
Smith, D. (1985).
Bin packing with adaptive search.
In Proceedings of an International Conference on Genetic
Algorithms, pages 202-206. Morgan Kauffman.
Smith, R. E., Forrest, S., and Perelson, A. S. (1993).
Population diversity in immune system models: Implications for
genetic search.
In Whitley, L. D., editor, Foundations of Genetic Algorithms -
2, pages 153-166. Morgan Kauffman, San Mateo, CA.
Spears, W. M. and DeJong, K. A. (1991).
An analysis of multi-point crossover.
In Rawlins, G. J. E., editor, Foundations of Genetic
Algorithms-1, pages 301-315. Morgan Kauffman.
Sycara, K. and Navinchandra, D. (1992).
Retrieval strategies in case-based design system.
In Tong, C. and Sriram, D., editors, Artificial Intelligence in
Engineering Design, Vol II, pages 145-164. Academic Press, Inc.
Syswerda, G. (1989).
Uniform crossover in genetic algorithms.
In Proceedings of the Third International Conference on Genetic
Algorithms, pages 2-8. Morgan Kauffman.
Thierens, D. and Goldberg, D. E. (1993).
Mixing in genetic algorithms.
In Proceedings of Fifth International Conference on Genetic
Algorithms, pages 38-45. Morgan Kauffman.
Tong, C. (1992).
Using exploratory design to cope with problem complexity.
In Tong, C. and Sriram, D., editors, Artificial Intelligence in
Engineering Design, Vol II, pages 287-332. Academic Press, Inc.
Tong, C. and Sriram, D. (1992b).
Introduction.
In Tong, C. and Sriram, D., editors, Artificial Intelligence in
Engineering Design, pages 1-53. Academic Press, Inc.
Tong, S. S., Powell, D., and Cornett, D. (1992).
Engineous: A unified method for design automation, optimization, and
integration.
In Tong, C. and Sriram, D., editors, Artificial Intelligence in
Engineering Design, Vol III, pages 235-254. Academic Press, Inc.
Ulrich, K. and Seering, W. (1992).
Function sharing in mechanical design.
In Tong, C. and Sriram, D., editors, Artificial Intelligence in
Engineering Design, Vol II, pages 185-214. Academic Press, Inc.
Wilson, S. W. (1991).
Ga-easy does not imply steepest-ascent optimizable.
In Proceedings of the Fourth International Conference on Genetic
Algorithms, pages 85-89. Morgan Kauffman, San Mateo, CA.