Quasi-human seniority-order algorithm for unequal circles packing |
| |
| Institution: | 1. School of Internet of Things Engineering, Jiangnan University, Wuxi 214122, China;2. Key Laboratory of Advanced Process Control for Light Industry Ministry of Education, Jiangnan University, Wuxi 214122, China;3. School of Electrical, Electronic and Computer Engineering, Lancaster University, Bailrigg, Lancaster, LA1 4YW, United Kingdom;1. Jiangsu Provincial Key Lab of Image Processing and Image Communication, Nanjing University of Posts and Telecommunications, Nanjing 210003, China;2. State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210093, China;1. School of information engineering, Guangdong Mechanical & Electrical College, Guangzhou 510550, PR China;2. Department of Information Science and Technology, Guangdong University of Foreign Studies South China Business College, Guangzhou 510545, PR China;1. School of Science, East China Jiaotong University, Nanchang , Jiangxi, Postal code 330013, PR China;2. School of Mathematics, South China Normal University, Guangzhou, Guangdong, Postal code 510631, PR China;3. School of Mathematics and Computer Science, Guizhou Normal University, Guiyang, Guizhou, Postal code 550001, PR China |
| |
| Abstract: | In the existing methods for solving unequal circles packing problems, the initial configuration is given arbitrarily or randomly, but the impact of different initial configurations for existing packing algorithm to the speed of existing packing algorithm solving unequal circles packing problems is very large. The quasi-human seniority-order algorithm proposed in this paper can generate a better initial configuration for existing packing algorithm to accelerate the speed of existing packing algorithm solving unequal circles packing problems. In experiments, the quasi-human seniority-order algorithm is applied to generate better initial configurations for quasi-physical elasticity methods to solve the unequal circles packing problems, and the experimental results show that the proposed quasi-human seniority-order algorithm can greatly improve the speed of solving the problem. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
