Two-dimensional equilibrium constraint layout using simulated annealing

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.

[1]  Tang Fe.  A Modified Genetic Algorithm and Its Application to Layout Optimization , 1999 .

[2]  János D. Pintér,et al.  Solving circle packing problems by global optimization: Numerical results and industrial applications , 2008, Eur. J. Oper. Res..

[3]  Yishou Wang,et al.  An Improved Scatter Search for Circles Packing Problem with the Equilibrium Constraint: An Improved Scatter Search for Circles Packing Problem with the Equilibrium Constraint , 2009 .

[4]  Teng Hong-fei,et al.  Layout Optimization for the Dishes Installed on a Rotating Table——The Packing Problem With Equilibrium Behavioural Constraints , 1994 .

[5]  Zhipeng Lü,et al.  PERM for solving circle packing problem , 2008, Comput. Oper. Res..

[6]  Andrea Lodi,et al.  Two-dimensional packing problems: A survey , 2002, Eur. J. Oper. Res..

[7]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[8]  Lei Kaiyou and Qiu Yuhui.  A Study of Constrained Layout Optimization Using Adaptive Particle Swarm Optimizer , 2006 .

[9]  Huaiqing Wang,et al.  An improved algorithm for the packing of unequal circles within a larger containing circle , 2002, Eur. J. Oper. Res..

[10]  Wenqi Huang,et al.  A Short Note on a Simple Search Heuristic for the Diskspacking Problem , 2004, Ann. Oper. Res..

[11]  Li Ning.  A Study on the Particle Swarm Optimization with Mutation Operator Constrained Layout Optimization , 2004 .

[12]  Mhand Hifi,et al.  A beam search algorithm for the circular packing problem , 2009, Comput. Oper. Res..

[13]  Huang Wen.  A Deterministic Heuristic Algorithm Based on Euclidian Distance for Solving the Rectangles Packing Problem , 2006 .

[14]  Qian Zhi.  Human-Computer Interactive Genetic Algorithm and Its Application to Constrained Layout Optimization , 2001 .

[15]  De-fu Zhang,et al.  An effective hybrid algorithm for the problem of packing circles into a larger containing circle , 2005, Comput. Oper. Res..

[16]  Gang Li,et al.  Basin filling algorithm for the circular packing problem with equilibrium behavioral constraints , 2010, Science China Information Sciences.

[17]  Shengjun Xue,et al.  An improved energy landscape paving algorithm for the problem of packing circles into a larger containing circle , 2009, Comput. Ind. Eng..

[18]  José Mario Martínez,et al.  Optimizing the packing of cylinders into a rectangular container: A nonlinear approach , 2005, Eur. J. Oper. Res..

[19]  E. Hopper,et al.  A genetic algorithm for a 2D industrial packing problem , 1999 .

[20]  Duanbing Chen,et al.  An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem , 2010, Comput. Oper. Res..

[21]  Gerhard Wäscher,et al.  Cutting and packing , 1995, Eur. J. Oper. Res..

[22]  Mhand Hifi,et al.  Adaptive and restarting techniques-based algorithms for circular packing problems , 2008, Comput. Optim. Appl..

[23]  Wang Yi.  An Improved Scatter Search for Circles Packing Problem with the Equilibrium Constraint , 2009 .

[24]  Lijun Wei,et al.  A least wasted first heuristic algorithm for the rectangular packing problem , 2009, Comput. Oper. Res..

[25]  Wenqi Huang,et al.  Note on: An improved algorithm for the packing of unequal circles within a larger containing circle , 2006, Comput. Ind. Eng..

[26]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.