Abstract
Adaptation to dynamic optimization problems is currently receiving growing interest as one of the most important applications of genetic algorithms. Inspired by dualism and dominance in nature, genetic algorithms with the dualism mechanism have been applied for several dynamic problems with binary encoding. This paper investigates the idea of dualism for combinatorial optimization problems in dynamic environments, which are also extensively implemented in the real-world. A new variation of the GA, called the permutation-based dual genetic algorithm (PBDGA), is presented. Within this GA, two schemes based on the characters of the permutation in group theory are introduced: a partial-dualism scheme motivated by a new multi-attribute dualism mechanism and a learning scheme. Based on the dynamic test environments constructed by stationary benchmark problems, experiments are carried out to validate the proposed PBDGA. The experimental results show the efficiency of PBDGA in dynamic environments.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.