Two-dimensional packing problems using genetic algorithms

被引：0

作者：

Sakait Jain

Hae Chang Gea

机构：

[1] The State University of New Jersey,Department of Mechanical and Aerospace Engineering, Rutgers

来源：

Engineering with Computers | 1998年 / 14卷

关键词：

Genetic algorithm; Layout problem; Packing problem;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

This paper presents a technique for applying genetic algorithms for the two-dimensional packing problem. The approach is applicable to not only convex shaped objects, but can also accommodate any type of concave and complex shaped objects including objects with holes. In this approach, a new concept of a two-dimensional genetic chromosome is introduced. The total layout space is divided into a finite number of cells for mapping it into this 2D genetic algorithm chromosome. The mutation and crossover operators have been modified and are applied in conjunction with connectivity analysis for the objects to reduce the creation of faulty generations. A new feature has been added to the Genetic Algorithm (GA) in the form of a new operator called compaction. Several examples of GA-based layout are presented.

引用

页码：206 / 213

页数：7