PACKING DIFFERENT-SIZED CIRCLES INTO A RECTANGULAR CONTAINER

GEORGE, JA

doi:10.1016/0377-2217(95)00032-L

PACKING DIFFERENT-SIZED CIRCLES INTO A RECTANGULAR CONTAINER

1995-08-01

118

PRE

AI

DOI：10.1016/0377-2217(95)00032-L

Original

Original request for help

Save

Abstract

En 中文

This paper is motivated by the problem of fitting pipes of different diameters into a shipping container. Here we study the subproblem of fitting circles of different sizes into a rectangle since that problem is a central part of the larger problem. We formulate this situation as a nonlinear mixed integer programming problem and develop a number of heuristic procedures for (approximately) solving this problem. The heuristics are based on a variety of solution building rules that emulate the process of packing a container. Some of these methods, including a genetic algorithm, were based on a more structured design intended to provide solutions which are 'stable' from a stowage viewpoint. These heuristics are described in detail and their relative performances are compared for a sample set of 66 randomly generated problems. Based on this sample, the best performing heuristic methods were a quasi-random technique and a genetic algorithm of the 'stable' solution structure.

Keywords:

CIRCLE PACKING

HEURISTICS

GENETIC ALGORITHMS

PACKING DIFFERENT-SIZED CIRCLES INTO A RECTANGULAR CONTAINER

Abstract

AI Summary

Journal

Organization

Cited Papers