Simulated annealing for weighted polygon packing

Details Simulated annealing for weighted polygon packing Simulated annealing for weighted polygon packing

2008-09-29

arxiv.org/abs/0809.5005v1

Computer Science

Computational Geometry

Submitted to Engineering Optimization. 13 pages, 7 figures, 5 tables

Scientific paper

In this paper we present a new algorithm for a layout optimization problem: this concerns the placement of weighted polygons 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. Previous work has dealt with circular or rectangular objects, but here we deal with the more realistic case where objects may be represented as polygons and the polygons are allowed to rotate. We present a solution based on simulated annealing and first test it on instances with known optima. Our results show that the algorithm obtains container radii that are close to optimal. We also compare our method with existing algorithms for the (special) rectangular case. Experimental results show that our approach out-performs these methods in terms of solution quality.

Affiliated with

Also associated with

No associations

Rating

Simulated annealing for weighted polygon packing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Simulated annealing for weighted polygon packing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simulated annealing for weighted polygon packing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-49569