A Population Algorithm for Solving the Equal Circle Packing Problem
ZHU Zhetong
XIANG Yao
LAI Xiangjing
Abstract：To solve the equal circles packing problem(ECPP),this paper proposes a new variant of population basin hopping(PBH)algorithm based on the connectivity table.In the paper,the connectivity table between circles is used to define the distance function between two packing configurations and then a population updating strategy is designed for the proposed algorithm.The per-formance of the proposed algorithm is assessed on the 100 benchmark instances with N≤100,and the experimental results show that the proposed algorithm outperforms the state-of-the-art algorithms in the literature both in terms of solution quality and compu-tational efficiency.
Keywords：equal circle packing problemconnectivity tableadaptive searchpopulation algorithm
Publication Date：2024-03-20
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：6( 641-645,652 )