Two-dimensional equilibrium constraint layout using simulated annealing |
| |
| Authors: | Jingfa Liu Gang Li Duanbing Chen Wenjie Liu Yali Wang |
| |
| Affiliation: | 1. School of Computer and Software, Nanjing University of Information Science and Technology, Nanjing 210044, China;2. School of Mathematics and Physics, Nanjing University of Information Science and Technology, Nanjing 210044, China;3. School of Computer Science, University of Electronic Science and Technology of China, Chengdu 610054, China;4. School of Electronic and Information Engineering, Nanjing University of Information Science and Technology, Nanjing 210044, China |
| |
| Abstract: | This paper studies the layout optimization problem with equilibrium constraint. It is a two-dimensional packing problem with the industrial background of simplified satellite module layout design, and is known as NP-hard problem. By incorporating the heuristic neighborhood search mechanism and the adaptive gradient method into the simulated annealing procedure, a heuristic simulated annealing algorithm is put forward for this problem. The special neighborhood search mechanism can avoid the disadvantage of blind search in the simulated annealing algorithm, and the adaptive gradient method is used to execute local search and speed up finding the global optimal solution. Numerical examples are illustrated to verify the effectiveness of the proposed algorithm. |
| |
| Keywords: | Packing problem Equilibrium constraint Layout optimization Simulated annealing |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
