Hybrid Approach to Optimal Packing Using Genetic Algorithm and Coulomb Potential Algorithm

It is difficult and computationally time-consuming to find the best possible solutions for blank packing problems, because they include a lot of underlying combinational conditions. This paper presents two approaches for packing two-dimensional irregular-shaped polygonal elements-a real-encoded gene...

Full description

Saved in:
Bibliographic Details
Published in:Materials and manufacturing processes 2007-06, Vol.22 (5), p.668-677
Main Authors: Mahanty, Biswajit, Agrawal, Rajneesh Kumar, Shrin, Shrikrishna, Chakravarty, Sourish
Format: Article
Language:English
Subjects:
Blank packing
Coulomb potential algorithm
Real-encoded genetic algorithm
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:It is difficult and computationally time-consuming to find the best possible solutions for blank packing problems, because they include a lot of underlying combinational conditions. This paper presents two approaches for packing two-dimensional irregular-shaped polygonal elements-a real-encoded genetic algorithm and a hybrid algorithm using a real-encoded genetic algorithm and a local optimization algorithm. The local optimization algorithm presented is a novel one utilizing the Coulomb potential technique. In the hybrid approach, the real-encoded genetic algorithm generates the order of the polygons while the coulomb potential algorithm determines the embodiment layout under the fixed combinations so as to minimize the scrap. The hybrid genetic algorithm is found to give better results for problems of larger size although it takes more computational time.
ISSN:1042-6914
1532-2475
DOI:10.1080/10426910701323714