Abstract
This chapter develops the ordering messy GA (OmeGA), a fast messy GA (fmGA) specialized for permutation problems. It represents the solutions by vectors of real numbers—the so-calledrandom keysintroduced by Bean (1994). In a number of experiments it is shown that the OmeGA significantly outperforms the simple GA in solving ordering deceptive problems, which are hard sequencing problems defined elsewhere (Kargupta et al., 1992).
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
Preview
Unable to display preview. Download preview PDF.
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). Development of the Ordering Messy Genetic Algorithm. In: OmeGA. Genetic Algorithms and Evolutionary Computation, vol 6. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0807-6_1
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0807-6_1
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5249-5
Online ISBN: 978-1-4615-0807-6
eBook Packages: Springer Book Archive