Abstract
Limitations of existing interactive genetic algorithms are analyzed and interactive genetic algorithms with multi-population adaptive hierarchy proposed. A model for interactive genetic algorithms with multi-population is established and a strategy for individuals’ migration is designed. Adaptive genetic operators are applied to interactive genetic algorithms with a single population, and when a condition for hierarchy is met, the algorithms will evolve in the subspace of the original search space. The algorithms’ implementation based on local networks is also presented. The algorithms proposed in this paper can maintain the diversity of populations as a whole, improve abilities in exploitation and exploration, prevent those good individuals from being eliminated and alleviate users’ fatigue. The application of the algorithms in fashion design validates that they are feasible and efficient.
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.