Ant Colony Algorithm for the Weighted Item Layout Optimization Problem

Details Ant Colony Algorithm for the Weighted Item Layout Optimization Problem Ant Colony Algorithm for the Weighted Item Layout Optimization Problem

2010-01-24

arxiv.org/abs/1001.4099v1

Computer Science

Neural and Evolutionary Computing

Submitted. Replaces version with formatting errors due to PDF conversion

Scientific paper

This paper discusses the problem of placing weighted items in a circular container in two-dimensional space. This problem is of great practical significance in various mechanical engineering domains, such as the design of communication satellites. Two constructive heuristics are proposed, one for packing circular items and the other for packing rectangular items. These work by first optimizing object placement order, and then optimizing object positioning. Based on these heuristics, an ant colony optimization (ACO) algorithm is described to search first for optimal positioning order, and then for the optimal layout. We describe the results of numerical experiments, in which we test two versions of our ACO algorithm alongside local search methods previously described in the literature. Our results show that the constructive heuristic-based ACO performs better than existing methods on larger problem instances.

Affiliated with

Also associated with

No associations

Rating

Ant Colony Algorithm for the Weighted Item Layout Optimization Problem 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 Ant Colony Algorithm for the Weighted Item Layout Optimization Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ant Colony Algorithm for the Weighted Item Layout Optimization Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-696335