Abstract
This paper presents a scaling analysis of the ordering messy genetic algorithm (OmeGA), a fast messy genetic algorithm that uses random keys to represent solutions. In experiments with hard permutation problems--so-called ordering deceptive problems--it is shown that the algorithm scales up as O(l1.4) with the problem length l ranging from 32 to 512. Moreover, the OmeGA performs efficiently with small populations thereby consuming little memory. Since the algorithm is independent of the structure of the building blocks, it outperforms the random key-based simple genetic algorithm (RKGA) for loosely coded problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
