.png){kind=icon}
返回
A dynamic adaptive local search algorithm for the circular packing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2005.11.069.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper studies the circular packing problem (CPP) which consists of packing n non-identical circles C-i of known radius r(i), i is an element of N = { 1,...,n}, into the smallest containing circle C. The objective is to determine the coordinates (x(i),y(i)) of the center of C-i, i is an element of N, as well as the radius r and center (x,y) of C. This problem, which is a variant of the two-dimensional open dimension problem, is solved using a two-step, dynamic, adaptive, local search algorithm. At each iteration, the algorithm identifies the set of potential best local positions of a circle C-i, i is an element of N, given the positions of the previously packed circles, and determines for each of these positions the coordinates and radius of the smallest containing circle. The best local position minimizes the radius of the current containing circle. That is, every time an additional circle is packed, both the center and the radius of the containing circle are dynamically updated, and the smallest containing circle is known. The experimental results reflect the good performance of the algorithm. (C) 2006 Elsevier B. V. All rights reserved.
Keyword:
heuristics
combinatorial optimization
cutting and packing
dynamic search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Light-dependent toxicity of α-terthienyl and anthracene toward late embryonic stages ofRana pipiens
PREAI
分享收藏
查看更多内容