Two-dimensional packing problems using Genetic Algorithms

doi:10.1007/BF01215974

Two-dimensional packing problems using Genetic Algorithms

1998-09-01

37

PRE

AI

H

Hae Chang Gea *

DOI：10.1007/BF01215974

原文链接

原文求助

摘要

En 中文

This paper presents a technique for applying genetic algorithms far the two-dimensional packing problem. The approach is applicable to not only convex shaped objects, but can also accommodate mg type Of concave and complex shaped objects including objects with holes fn 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.

Keyword:

Genetic Algorithm

layout problem

packing problem

Two-dimensional packing problems using Genetic Algorithms

摘要

AI总结

期刊

机构

引用论文