Conclusions and Future Work
Part of the
Genetic Algorithms and Evolutionary Computation
book series (GENA, volume 6)
In this book we have developed the ordering messy genetic algorithm and have successfully tested its performance in pilot experiments with ordering deceptive problems. By using an adaptive representation scheme, it becomes relatively independent from the underlying problem coding and outperforms the simple GA.
KeywordsSchedule Problem Pilot Experiment Vehicle Route Relative Counterpart Integrate Circuit Design
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
© Springer Science+Business Media New York 2002