Created by W.Langdon from gp-bibliography.bib Revision:1.4951
GENETIC PROGRAMMING AND DATA STRUCTURES shows how abstract data types (stacks, queues and lists) can be evolved using genetic programming, demonstrate GP can evolve general programs which solve the nested brackets problem, recognise a Dyck context free language and implement a simple four function calculator. In these cases an appropriate data structure is beneficial compared to simple indexed memory. This book also includes a survey of GP, including a critical review of experiments with evolving memory and reports investigations of real world electrical network maintenance scheduling problems that demonstrate that Genetic Algorithms can find low cost viable solutions to such problems.
GENETIC PROGRAMMING AND DATA STRUCTURES should be of direct interest to computer scientists doing research on genetic programming, genetic algorithms, data structures, and artificial intelligence. In addition, this book will be of interest to practitioners working in all of these areas and to those interested in automatic programming.
Foreword by John R. Koza.
Preface. 1. Introduction. 2. Survey. 3. Advanced Genetic Programming Techniques. 4. Evolving a Stack. 5. Evolving a Queue. 6. Evolving a List. 7. Problems Solved Using Data Structures. benchmarks: http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/gp-code/grammar_test_ilp.tar.gz
8. Evolution of GP Populations. 9. Conclusions.
Appendices: A. Number of Fitness Evaluations Required. B. Glossary. C. Scheduling Planned Maintenance of the National Grid. D. Implementation. Index.
Kluwer Accademic Publishers, Order Dept., Box 358, Accord Station, Hingham, MA 02018-0358, USA Tel: +1 781 871-6600 FAX: +1 781 871-6528
Tangent distribution of constants. reverse polish notation calculator",
Genetic Programming entries for William B Langdon