[1]钱志勤, 滕弘飞. 复杂布局设计问题的算法[J]. 中国机械工程, 2002, 13(8):696-699.
QIAN Zhiqin, TENG Hongfei. Algorithm of Complex Layout Design Problems[J]. China Mechanical Engineering, 2002, 13(8):696-699.
[2]刘昕, 余隋怀, 王淑侠, 等. 用户决策驱动的乘用车舱改进PSO布局优化模型[J]. 中国机械工程, 2016, 27(1):114-121.
LIU Xin, YU Suihuai, WANG Shuxia, et al. Improved PSO Layout Optimization Model for Saloon Cabin Driven by Users Decision Making[J]. China Mechanical Engineering, 2016, 27(1):114-121.
[3]LIU J, JIANG Y, LI G, et al. Heuristic-based Energy Landscape Paving for the Circular Packing Problem with Performance Constraints of Equilibrium[J]. Physica A:Statistical Mechanics and Its Applications, 2015, 431:166-174.
[4]青巧, 吴红乐, 管卫利. 圆形件卷材排样问题的启发式优化算法[J]. 锻压技术, 2018, 43(4):175-179.
QING Qiao, WU Hongle, GUAN Weili. Heuristic Optimization Algorithms of Coiled Material Layout for Circular Parts [J]. Forging & Stamping Technology, 2018, 43(4):175-179.
[5]EKANAYAKE D B, RANPATIDEWAGE M M, LAFOUNTAIN D J. Optimal Packings for Filled Rings of Circles[J]. Applications of Mathematics, 2020, 65(1):1-22.
[6]HUANG W Q, LI Y, LIN C, et al. New Heuristics for Packing Unequal Circles into a Circular Container[J]. Computers & Operations Research, 2006, 33 (8):2125-2142.
[7]LYU Z P, HUANG W Q. PERM for Solving Circle Packing Problem[J]. Computers & Operations Research, 2008, 35(5):1742-1755.
[8]黎自强, 田茁君, 王奕首, 等. 求解平衡约束圆形Packing问题的快速启发式并行蚁群算法[J]. 计算机研究与发展, 2012, 49(9):1899-1909.
LI Ziqiang, TIAN Zhuojun, WANG Yishou, et al. A Fast Heuristic Parallel Ant Colony Algorithms for Circles Packing Problem with the Equilibrium Constraints[J]. Journal of Computer Research and Development, 2012, 49(9):1899-1909.
[9]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.
[10]FEKETE S P, von HOVELING S, SCHEFFER C, et al. Online Circle Packing[C]∥ Workshop on Algorithms and Data Structures. Edmonton, 2019:366-379.
[11]LINTZMAYER C N, MIYAZAWA F K, XAVIER EC, et al. Online Circle and Sphere Packing[J]. Theoretical Computer Science, 2019, 776:75-94.
[12]黄文奇, 付樟华, 许如初. 求解不等圆 Packing 问题的带全局变换禁忌搜索算法[J]. 中国科学:信息科学, 2012, 42:843-858.
HUANG Wenqi, FU Zhanghua, XU Ruchu. Tabu Search Algorithm Combined with Global Perturbation for Packing Arbitrary Sized Circles into a Circular Container[J]. Scientia Sinica Informationis, 2012, 42:843-858.
[13]何琨, 杨辰凯, 黄梦龙, 等. 动作空间带平衡约束圆形Packing问题的拟物求解算法[J]. 软件学报, 2016, 27(9):2218-2229.
HE Kun, YANG Chenkai, HUANG Menglong, 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.
[14]ZENG Z Z, YU X G, HE K, et al. Iterated Tabu Search and Variable Neighborhood Descent forPacking Unequal Circles into a Circular Container[J]. European Journal of Operational Research, 2016, 250(2):615-627.
[15]张维, 杨康宁, 张民. 一种求解不等圆Packing问题的改进遗传模拟退火算法[J]. 西北工业大学学报, 2017, 35(6):1033-1039.
ZHANG Wei, YANG Kangning, ZHANG Min. An Improved Genetic Simulated Annealing Algorithm to Solve the Unequal Circle Packing Problem[J]. Journal of Northwestern Polytechnical University, 2017, 35(6):1033-1039.
[16]王英聪, 肖人彬. 基于蚁群劳动分工的空间分配方法求解带平衡约束的圆形装填问题[J]. 计算机集成制造系统, 2019, 25(2):359-372.
WANG Yingcong, XIAO Renbin. Space Allocation Method Based on Ant Colonys Labor Division for Circular Packing Problem with Equilibrium Constraints[J]. Computer Integrated Manufacturing Systems, 2019, 25(2):359-372.
[17]LPEZC O, BEASLEY J E. Packing a Fixed Number of Identical Circles in a Circular Container with Circular Prohibited Areas[J]. Optimization Letters, 2019, 13(7):1449-1468.
[18]CHEN M, TANG X Y, SONG T, et al. Greedyheuristic Algorithm for Packing Equal Circles into a Circular Container [J]. Computers & Industrial Engineering, 2018, 119:114-120.
[19]黄文奇, 叶涛. 求解等圆Packing 问题的拟物型全局优化算法[J]. 中国科学:信息科学, 2011, 41(6):686-693.
HUANG Wenqi, YE Tao. Quasi-physical Global Optimization Method for Solving the Equal Circle Packing Problem[J]. Scientia Sinica Informationis, 2011, 41(6):686-693.
[20]HE K, YE H, WANG Z L, et al. An Efficient Quasi-physical Quasi-human Algorithm for Packing Equal Circles in a Circular Container[J]. Computers and Operations Research, 2018, 92:26-36.
[21]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.
[22]BONABEAU E, THERAULAZ G, DENEUBOURG J L. QuantitativeStudy 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.
[23]THERAULAZ G, BONABEAU E, DENEUBOURG J N. 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.
[24]IMAMICHI T, YAGIURA M, NAGAMOCHI H. An Iterated Local Search Algorithm Based on Nonlinear Programming for the Irregular Strip Packing Problem[J]. Discrete Optimization, 2009, 6(4):345-361. |