Self-adaptive Chaotic Differential Evolution Algorithm for Solving Constrained Circular Packing Problem

Binary Information Press
Publication Type:
Journal Article
Journal of Computational Information Systems, 2012, 8 (18), pp. 7747 - 7755
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2012003099OK.pdf386.18 kB
Adobe PDF
Circles packing into a circular container with equilibrium constraint is a NP hard layout optimization problem. It has a broad application in engineering. This paper studies a two-dimensional constrained packing problem. Classical di?erential evolution for solving this problem is easy to fall into local optima. An adaptive chaotic di?erential evolution algorithm is proposed to improve the performance in this paper. The weighting parameters are dynamically adjusted by chaotic mutation in the searching procedure. The penalty factors of the ?tness function are modi?ed during iteration. To keep the diversity of the population, we limit the populations concentration. To enhance the local search capability, we adopt adaptive mutation of the global optimal individual. The improved algorithm can maintain the basic algorithms structure as well as extend the searching scales, and can hold the diversity of population as well as increase the searching accuracy. Furthermore, our improved algorithm can escape from premature and speed up the convergence. Numerical examples indicate the e?ectiveness and efficiency of the proposed algorithm.
Please use this identifier to cite or link to this item: