Computer Technology and Control Engineering |
|
|
|
|
Swarm intelligence labor division algorithm for solving unequal circle packing problem |
Ying-cong WANG( ),Ling ZHANG |
School of Electrical and Information Engineering, Zhengzhou University of Light Industry, Zhengzhou 450002, China |
|
|
Abstract The unequal circle packing problem (UCPP) is a non-deterministic polynomial hard (NP-hard) global optimization problem. Aiming at the problem, a novel algorithm based on the idea of space allocation, swarm intelligence labor division (SILD) algorithm, was developed. From the space perspective, the UCPP is to allocate the container space to the circles reasonably and efficiently. The core idea of the proposed algorithm is to abstract the UCPP as a space allocation problem, and use the SILD algorithm to achieve the space allocation in the UCPP. The UCPP problem and the SILD algorithm were analyzed from the allocation perspective, where the actions performed by circles were treated as the tasks performed by individuals. Then, stimuli and thresholds were designed respectively for actions and circles. According to the stimulus-response principle of SILD algorithm, the space allocation in the UCPP was achieved by circles performing appropriate actions. Experiments on engineering instances and benchmark function instances show that the proposed algorithm is effective for the UCPP.
|
Received: 25 December 2018
Published: 21 November 2019
|
|
面向不等圆Packing问题的群智能劳动分工方法
针对具有非确定性多项式难度(NP-hard)的全局优化问题—不等圆Packing问题(UCPP),基于空间分配思路提出新的求解方法—群智能劳动分工(SILD)方法. 从空间的角度来看,不等圆Packing问题就是将容器空间合理高效地分配给圆形物体. 所提出方法的核心思想在于将不等圆Packing问题抽象为空间分配问题,利用群智能劳动分工的任务分配来实现不等圆Packing问题的空间分配. 从分配的角度对比分析不等圆Packing问题和群智能劳动分工,将圆形物体执行的动作看作个体执行的任务,分别为动作和圆形物体设计环境刺激和响应阈值. 在群智能劳动分工刺激-响应原理作用下,圆形物体选择恰当的动作完成空间分配. 实际工程算例和基准函数算例的测试结果表明,所提出方法是求解不等圆Packing问题的有效算法.
关键词:
不等圆Packing问题,
群智能劳动分工,
动作,
刺激,
阈值,
优化,
分配
|
|
[1] |
黄文奇, 付樟华, 许如初 求解不等圆Packing问题的带全局变换禁忌搜索算法[J]. 中国科学: 信息科学, 2012, 42: 843- 858 HUANG Wen-qi, FU Zhang-hua, XU Ru-chu Tabu search algorithm combined with global perturbation for packing arbitrary sized circles into a circular container[J]. Science China: Information Sciences, 2012, 42: 843- 858
|
|
|
[2] |
王鹏, 黄帅, 朱舟全 求解带平衡约束圆形Packing问题的改进人工蜂群算法[J]. 西北工业大学学报, 2014, 32 (2): 240- 245 WANG Peng, HUANG Shuai, ZHU Zhou-quan Exploring improved artificial bee colony algorithm for solving circle packing problem with equilibrium constraints[J]. Journal of Northwestern Polytechnical University, 2014, 32 (2): 240- 245
doi: 10.3969/j.issn.1000-2758.2014.02.016
|
|
|
[3] |
何琨, 杨辰凯, 黄梦龙, 等 动作空间带平衡约束圆形Packing问题的拟物求解算法[J]. 软件学报, 2016, 27 (9): 2218- 2229 HE Kun, YANG Chen-kai, HUANG Meng-long, et al Quasi-physical algorithm based on action space for solving the circles packing problem with equilibrium constraints[J]. Journal of Software, 2016, 27 (9): 2218- 2229
|
|
|
[4] |
张维, 杨康宁, 张民 一种求解不等圆Packing问题的改进遗传模拟退火算法[J]. 西北工业大学学报, 2017, 35 (6): 1033- 1039 ZHANG Wei, YANG Kang-ning, ZHANG Min An improved genetic stimulated annealing algorithm to solve the unequal circle packing problem[J]. Journal of Northwestern Polytechnical University, 2017, 35 (6): 1033- 1039
doi: 10.3969/j.issn.1000-2758.2017.06.015
|
|
|
[5] |
WANG H Q, HUANG W Q, ZHANG Q, et al An improved algorithm for the packing of unequal circles within a larger containing circle[J]. European Journal of Operational Research, 2002, 141 (2): 440- 453
doi: 10.1016/S0377-2217(01)00241-7
|
|
|
[6] |
黄文奇, 付樟华, 许如初 不等圆Packing问题的拟物型邻域搜索算法[J]. 华中科技大学学报: 自然科学版, 2012, 40 (4): 1- 4 HUANG Wen-qi, FU Zhang-hua, XU Ru-chu Neighborhood search algorithm associated with quasi-pgysical method for solving unequal circle packing problem[J]. Journal of Huazhong University of Science and Technology: Natural Science Edition, 2012, 40 (4): 1- 4
|
|
|
[7] |
LOPEZ C O, BEASLEY J E Packing unequal circles using formulation space search[J]. Computers and Operations Research, 2013, 40 (5): 1276- 1288
doi: 10.1016/j.cor.2012.11.022
|
|
|
[8] |
LOPEZ C O, BEASLEY J E A formulation space search heuristic for packing unequal circles in a fixed size circular container[J]. European Journal of Operational Research, 2016, 251 (1): 64- 73
doi: 10.1016/j.ejor.2015.10.062
|
|
|
[9] |
LIU J F, XUE S J, LIU Z X, et al An improved energy landscape paving algorithm for the problem of packing circles into a larger containing circle[J]. Computers and Industrial Engineering, 2009, 57 (3): 1144- 1149
doi: 10.1016/j.cie.2009.05.010
|
|
|
[10] |
刘景发, 李刚 求解带平衡性能约束的圆形装填问题的吸引盘填充算法[J]. 中国科学: 信息科学, 2010, 40 (3): 423- 432 LIU Jing-fa, LI Gang Basin filling algorithm for the circular packing problem with equilibrium behavioral constraints[J]. Science China: Information Sciences, 2010, 40 (3): 423- 432
|
|
|
[11] |
FU Z H, HUANG W Q, LU Z P Iterated tabu search for the circular open dimension problem[J]. European Journal of Operational Research, 2013, 225 (2): 236- 243
doi: 10.1016/j.ejor.2012.10.022
|
|
|
[12] |
ZENG Z Z, YU X G, HE K, et al Iterated Tabu search and variable neighborhood descent for packing unequal circles into a circular container[J]. European Journal of Operational Research, 2016, 250 (2): 615- 627
doi: 10.1016/j.ejor.2015.09.001
|
|
|
[13] |
HUANG W Q, LI Y, LIN C M, et al New heuristics for packing unequal circles into a circular container[J]. Computers and Operations Research, 2006, 33 (8): 2125- 2142
doi: 10.1016/j.cor.2005.01.003
|
|
|
[14] |
LU Z P, HUANG W Q PERM for solving circle packing problem[J]. Computers and Operations Research, 2008, 35 (5): 1742- 1755
doi: 10.1016/j.cor.2006.10.012
|
|
|
[15] |
AKEB H, HIFI M, M'HALLAH R A beam search algorithm for the circular packing problem[J]. Computers and Operations Research, 2009, 36 (5): 1513- 1528
doi: 10.1016/j.cor.2008.02.003
|
|
|
[16] |
AKEB H, HIFI M, M’HALLAH R Adaptive beam search lookahead algorithms for the circular packing problem[J]. International Transactions in Operational Research, 2010, 17 (5): 553- 575
doi: 10.1111/j.1475-3995.2009.00745.x
|
|
|
[17] |
HIFI M, M’HALLAH R A dynamic adaptive local search algorithm for the circular packing problem[J]. European Journal of Operational Research, 2007, 183 (3): 1280- 1294
doi: 10.1016/j.ejor.2005.11.069
|
|
|
[18] |
Al-MUDAHKA I, HIFI M, M'HALLAH R Packing circles in the smallest circle: an adaptive hybrid algorithm[J]. Journal of the Operational Research Society, 2011, 62 (11): 1917- 1930
doi: 10.1057/jors.2010.157
|
|
|
[19] |
XIAO R B, WANG Y C Labour division in swarm intelligence for allocation problems: a survey[J]. International Journal of Bio-Inspired Computation, 2018, 12 (2): 71- 86
doi: 10.1504/IJBIC.2018.094186
|
|
|
[20] |
肖人彬, 王英聪 面向群体利益分配的蚁群劳动分工建模与仿真[J]. 管理科学学报, 2016, 19 (10): 1- 15 XIAO Ren-bin, WANG Ying-cong Modeling and simulation of ant colony’s labor division for interests allocation of social groups[J]. Journal of Management Sciences in China, 2016, 19 (10): 1- 15
doi: 10.3969/j.issn.1007-9807.2016.10.001
|
|
|
[21] |
WU H S, LI H, XIAO R B, et al Modeling and simulation of dynamic ant colony’s labor division for task allocation of UAV swarm[J]. Physica A, 2018, 491: 127- 141
doi: 10.1016/j.physa.2017.08.094
|
|
|
[22] |
WANG Y C, XIAO R B, WANG H M A flexible labour division approach to the polygon packing problem based on space allocation[J]. International Journal of Production Research, 2017, 55 (11): 3025- 3045
doi: 10.1080/00207543.2016.1229070
|
|
|
[23] |
DUARTE A, WEISSING F J, PEN I, et al An evolutionary perspective on self-organized labor division in social insects[J]. Annual Review of Ecology, Evolution, and Systematics, 2011, 42: 91- 110
doi: 10.1146/annurev-ecolsys-102710-145017
|
|
|
[24] |
BONABEAU E, THERAULAZ G, DENEUBOURG J L Quantitative study of the fixed threshold model for the regulation of division of labour in insect societies[J]. Proceedings of the Royal Society of London. Series B: Biological Sciences, 1996, 263 (1376): 1565- 1569
doi: 10.1098/rspb.1996.0229
|
|
|
[25] |
THERAULAZ G, BONABEAU E, DENEUBOURG J L Response threshold reinforcements and division of labour in insect societies[J]. Proceedings of the Royal Society of London. Series B: Biological Sciences, 1998, 265 (1393): 327- 332
doi: 10.1098/rspb.1998.0299
|
|
|
[26] |
刘建, 黄文奇. 求解不等圆装填问题的一种新的连续优化算法[C]// 全国第15届计算机辅助设计与图形学学术会议. 大连: 电子工业出版社, 2008: 611-615. LIU Jian, HUANG Wen-qi. A new continuous optimization algorithm for solving unequal circles packing problem [C]// The 15th China Conference on Computer-Aided Design and Computer Graphics. Dalian: Publishing house of electronics industry, 2008: 611-615.
|
|
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
|
Shared |
|
|
|
|
|
Discussed |
|
|
|
|