A novel genetic algorithm for the layout optimization problem

In this paper we present a new algorithm 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 a genetic algorithm solution and compare it with two existing nature-inspired methods, one of which is the best published algorithm for this problem. Experimental results show that our approach out-performs these existing methods in terms of both solution quality and execution time.