计算机与数字工程2024，Vol.52Issue(3)：641-645,652,6.DOI:10.3969/j.issn.1672-9722.2024.03.001
一种求解等圆装箱问题的种群算法
A Population Algorithm for Solving the Equal Circle Packing Problem
摘要
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.关键词
等圆装箱问题/连接表/自适应搜索/种群算法Key words
equal circle packing problem/connectivity table/adaptive search/population algorithm分类
信息技术与安全科学引用本文复制引用
朱哲彤,向垚,赖向京..一种求解等圆装箱问题的种群算法[J].计算机与数字工程,2024,52(3):641-645,652,6.基金项目
国家自然科学基金项目(编号:61703213)资助. （编号:61703213）
