Two-dimensional equilibrium constraint layout using simulated annealing |
| |
Affiliation: | 1. Process Dynamics and Operations Group, Department of Biochemical and Chemical Engineering, TechnischeUniversität Dortmund, Emil-Figge Str. 70, 44227, Dortmund, Germany;1. Department of Applied Mathematics, Faculty of Basic Sciences, Sahand University of Technology, Tabriz, Iran;2. Department of Applied Mathematics, Faculty of Mathematics and Computer Science, Amirkabir University of Technology, No. 424, Hafez Ave., Tehran, Iran |
| |
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: | |
本文献已被 ScienceDirect 等数据库收录! |
|