e-space
Manchester Metropolitan University's Research Repository

Two hybrid compaction algorithms for the layout optimization problem

Xiao, Ren-Bin and Xu, Yi-Chun and Amos, Martyn (2007) Two hybrid compaction algorithms for the layout optimization problem. Biosystems, 90 (2). pp. 560-567. ISSN 1872-8324

Full text not available from this repository.

Abstract

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.

Impact and Reach

Statistics

Downloads
Activity Overview
0Downloads
187Hits

Additional statistics for this dataset are available via IRStats2.

Altmetric

Actions (login required)

Edit Item Edit Item