Two-dimensional equilibrium constraint layout using simulated annealing

Authors:
Jingfa Liu;Gang Li;Duanbing Chen;Wenjie Liu;Yali Wang
Affiliations:
School of Computer and Software, Nanjing University of Information Science and Technology, Nanjing 210044, China;School of Mathematics and Physics, Nanjing University of Information Science and Technology, Nanjing 210044, China;School of Computer Science, University of Electronic Science and Technology of China, Chengdu 610054, China;School of Computer and Software, Nanjing University of Information Science and Technology, Nanjing 210044, China;School of Electronic and Information Engineering, Nanjing University of Information Science and Technology, Nanjing 210044, China
Venue:
Computers and Industrial Engineering
Year:
2010

Citing 10
Cited 1

A genetic algorithm for a 2D industrial packing problem

Computers and Industrial Engineering
Metaheuristics in combinatorial optimization: Overview and conceptual comparison

ACM Computing Surveys (CSUR)
An effective hybrid algorithm for the problem of packing circles into a larger containing circle

Computers and Operations Research
Note on: an improved algorithm for the packing of unequal circles within a larger containing circle

Computers and Industrial Engineering
PERM for solving circle packing problem

Computers and Operations Research
Adaptive and restarting techniques-based algorithms for circular packing problems

Computational Optimization and Applications
A beam search algorithm for the circular packing problem

Computers and Operations Research
A least wasted first heuristic algorithm for the rectangular packing problem

Computers and Operations Research
An improved energy landscape paving algorithm for the problem of packing circles into a larger containing circle

Computers and Industrial Engineering
An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem

Computers and Operations Research

A coarse-to-fine quasi-physical optimization method for solving the circle packing problem with equilibrium constraints

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

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.