Two hybrid compaction algorithms for the layout optimization problem

  • Xiao R
  • Xu Y
  • Amos M
  • 5


    Mendeley users who have this article in their library.
  • 34


    Citations of this article.


In this paper we present two new algorithms for the layout optimization problem: this concerns the placement of circular, weighted objects inside a circular container, the two objectives being to minimize imbalance of mass and to minimize the radius of the container. This problem carries real practical significance in industrial applications (such as the design of satellites), as well as being of significant theoretical interest. We present two nature-inspired algorithms for this problem, the first based on simulated annealing, and the second on particle swarm optimization. We compare our algorithms with the existing best-known algorithm, and show that our approaches out-perform it in terms of both solution quality and execution time. © 2007 Elsevier Ireland Ltd. All rights reserved.

Author-supplied keywords

  • Gradient descent
  • Layout optimization
  • Particle swarm optimization
  • Simulated annealing

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free