by Anthony Yiu-Cheung Tang. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1994. / Includes bibliographical references (leaves 145-152). / ACKNOWLEDGMENTS --- p.i / ABSTRACT --- p.ii / LIST OF FIGURES --- p.vii / LIST OF TABLES --- p.ix / Chapter 1. --- INTRODUCTION --- p.1 / Chapter 1.1 --- Introducing evolutionary computation --- p.2 / Chapter 1.2 --- Adaptation and learning --- p.7 / Chapter 1.3 --- Comparing the efficency of evolutionary computation and sequential computation --- p.8 / Chapter 1.4 --- The place of evolutionary computation in computer science --- p.9 / Chapter 1.4.1 --- Mathematical foundation --- p.9 / Chapter 1.4.2 --- Scalability --- p.10 / Chapter 1.4.3 --- Parallelism --- p.11 / Chapter 1.5 --- Enhancing genetic search by local search --- p.11 / Chapter 1.6 --- Thesis Overview --- p.12 / Chapter 2. --- A REVIEW OF GENETIC ALGORITHMS --- p.14 / Chapter 2.1 --- Introduction --- p.14 / Chapter 2.2 --- The canonical genetic algorithm --- p.14 / Chapter 2.3 --- Optimal allocation of trials and schemata analysis --- p.17 / Chapter 2.4 --- Applications --- p.23 / Chapter 2.4.1 --- Function optimizations --- p.23 / Chapter 2.4.2 --- Machine Learning --- p.24 / Chapter 2.4.3 --- Combinatorial optimizations --- p.25 / Chapter 2.5 --- Criticisms --- p.25 / Chapter 2.5.1 --- Parameter settings --- p.25 / Chapter 2.5.2 --- Convergence and divergence --- p.26 / Chapter 2.5.3 --- Genetic algorithms for function optimizations --- p.27 / Chapter 2.5.4 --- The role of crossover and build blocks --- p.28 / Chapter 2.6 --- Future directions --- p.29 / Chapter 2.6.1 --- Is the schemata theorem wrong ？ --- p.29 / Chapter 2.6.2 --- Artificial life --- p.29 / Chapter 2.6.3 --- Parallel genetic algorithms --- p.31 / Chapter 2.6.4 --- Non-binary alphabets --- p.31 / Chapter 2.6.5 --- Investigations on problems that are hard for GA --- p.33 / Chapter 3. --- THE GENERAL STRUCTURE OF TOLKIEN --- p.34 / Chapter 3.1 --- Introduction --- p.34 / Chapter 3.2 --- Class Description --- p.39 / Chapter 3.2.1 --- Collection classes --- p.39 / Chapter 3.2.2 --- Vector classes --- p.39 / Chapter 3.2.3 --- GA-related classes --- p.40 / Chapter 3.2.4 --- Utility classes --- p.42 / Chapter 3.3 --- The TOLKIEN Genetic Algorithm --- p.43 / Chapter 3.3.1 --- Binary and Gray Code Representations --- p.44 / Chapter 3.3.2 --- Crossover Operators --- p.44 / Chapter 3.3.3 --- Haploids and Diploids --- p.47 / Chapter 3.3.4 --- Population --- p.50 / Chapter 3.3.5 --- Selection scheme --- p.50 / Chapter 3.3.6 --- Scaling scheme...: --- p.51 / Chapter 3.4 --- The TOLKIEN Classifier System --- p.52 / Chapter 3.4.1 --- Classifiers --- p.52 / Chapter 3.4.2 --- Messages and Message Lists --- p.53 / Chapter 3.4.3 --- Producing New Messages --- p.55 / Chapter 3.4.4 --- The Bucket Brigade Algorithm --- p.55 / Chapter 3.5 --- Where to obtain TOLKIEN --- p.56 / Chapter 4. --- ILLUSTRATING THE CAPABILITIES OF TOLKIEN --- p.57 / Chapter 4.1 --- de Jong's Test Bed : Function Optimization using GA --- p.57 / Chapter 4.2 --- Royal road function experiments --- p.63 / Chapter 4.2.1 --- RRMF --- p.64 / Chapter 4.2.2 --- RRJH --- p.65 / Chapter 4.2.3 --- Testing royal road functions using TOLKIEN --- p.68 / Chapter 4.2.4 --- Results --- p.71 / Chapter 4.2.5 --- Adding hillclimbing algorithm to solve royal road functions --- p.72 / Chapter 4.2.6 --- Discussions --- p.73 / Chapter 4.3 --- A classifier system to learn a multiplexer --- p.74 / Chapter 4.4 --- A classifier system maze traveller --- p.83 / Chapter 4.4.1 --- Framework of the Animat --- p.84 / Chapter 4.4.2 --- Constructing the maze navigation classifier system --- p.85 / Chapter 4.4.3 --- Results --- p.86 / Chapter 4.5 --- Future Enhancements on TOLKIEN --- p.88 / Chapter 4.6 --- Chapter Summary --- p.88 / Chapter 5. --- SOLVING TSP USING GENETIC ALGORITHMS --- p.89 / Chapter 5.1 --- Introduction --- p.89 / Chapter 5.2 --- Recombination operators for TSP --- p.91 / Chapter 5.2.1 --- PMX Crossover --- p.91 / Chapter 5.2.2 --- Order Crossover --- p.92 / Chapter 5.2.3 --- Edge Recombination operator --- p.93 / Chapter 5.3 --- Simulated Annealing --- p.95 / Chapter 5.4 --- Simulation Comparisons --- p.96 / Chapter 5.4.1 --- The Test Bed --- p.96 / Chapter 5.4.2 --- The Experimental Setup --- p.97 / Chapter 5.4.3 --- Results --- p.97 / Chapter 5.4.4 --- Discussions --- p.100 / Chapter 6. --- AN IMPROVED EDGE RECOMBINATION OPERATOR FOR TSP --- p.101 / Chapter 6.1 --- EDGENN ： a new edge recombination operator --- p.102 / Chapter 6.2 --- Experimental results --- p.104 / Chapter 6.2.1 --- Comparing EdgeNN and Edge-2 --- p.104 / Chapter 6.2.2 --- Comparing EdgeNN and Edge-3 --- p.106 / Chapter 6.3 --- Further improvement : a heuristic genetic algorithm using EdgeNN --- p.106 / Chapter 6.4 --- Discussion --- p.108 / Chapter 7. --- CONCLUSIONS --- p.111 / Chapter 7.1 --- Evaluation on TOLKIEN --- p.111 / Chapter 7.2 --- EdgeNN as a useful recombination operator for solving TSP --- p.112 / Chapter 7.3 --- Genetic algorithm and hillclimbing --- p.112 / EPILOGUE --- p.113 / APPENDIX : PROGRAM LISTINGS --- p.114 / Function optimizations --- p.114 / Maze Navigator --- p.122 / Multiplexer --- p.135 / Royal road functions --- p.141 / BIBLIOGRAPHY --- p.145 / INDEX --- p.153
| Identifer | oai:union.ndltd.org:cuhk.edu.hk/oai:cuhk-dr:cuhk_318083 |
| Date | January 1994 |
| Contributors | Tang, Anthony Yiu-cheung., Chinese University of Hong Kong Graduate School. Division of Computer Science. |
| Publisher | Chinese University of Hong Kong |
| Source Sets | The Chinese University of Hong Kong |
| Language | English |
| Detected Language | English |
| Type | Text, bibliography |
| Format | print, ix, 156 leaves : ill. ; 30 cm. |
| Rights | Use of this resource is governed by the terms and conditions of the Creative Commons “Attribution-NonCommercial-NoDerivatives 4.0 International” License (http://creativecommons.org/licenses/by-nc-nd/4.0/) |
Page generated in 0.0021 seconds