Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Knjazew, D. (2002). Conclusions and Future Work. In: OmeGA. Genetic Algorithms and Evolutionary Computation, vol 6. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0807-6_4
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0807-6_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5249-5
Online ISBN: 978-1-4615-0807-6
eBook Packages: Springer Book Archive