کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4635479 | 1340711 | 2007 | 11 صفحه PDF | دانلود رایگان |
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.
Journal: Applied Mathematics and Computation - Volume 185, Issue 2, 15 February 2007, Pages 1098–1108