Two-Dimensional Packing Problems Using Genetic Algorithms

Sakait Jain, Hae Chang Gea

Research output: Contribution to journalArticlepeer-review

37 Scopus citations

Abstract

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.

Original languageEnglish (US)
Pages (from-to)206-213
Number of pages8
JournalEngineering with Computers
Volume14
Issue number3
DOIs
StatePublished - 1998

All Science Journal Classification (ASJC) codes

  • Software
  • Modeling and Simulation
  • Engineering(all)
  • Computer Science Applications

Keywords

  • Genetic algorithm
  • Layout problem
  • Packing problem

Fingerprint

Dive into the research topics of 'Two-Dimensional Packing Problems Using Genetic Algorithms'. Together they form a unique fingerprint.

Cite this