Two hybrid compaction algorithms for the layout optimization problem

Citations of this article
Mendeley users who have this article in their library.
Get full text


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.




Xiao, R. B., Xu, Y. C., & Amos, M. (2007). Two hybrid compaction algorithms for the layout optimization problem. BioSystems, 90(2), 560–567.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free