Two-dimensional packing problems using genetic algorithms

Sakait Jain, Hae Chang Gea

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 2-D 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)
Title of host publication22nd Design Automation Conference
PublisherAmerican Society of Mechanical Engineers (ASME)
ISBN (Electronic)9780791897591
DOIs
StatePublished - 1996
EventASME 1996 Design Engineering Technical Conferences and Computers in Engineering Conference, DETC-CIE 1996 - Irvine, United States
Duration: Aug 18 1996Aug 22 1996

Publication series

NameProceedings of the ASME Design Engineering Technical Conference
Volume3

Conference

ConferenceASME 1996 Design Engineering Technical Conferences and Computers in Engineering Conference, DETC-CIE 1996
Country/TerritoryUnited States
CityIrvine
Period8/18/968/22/96

All Science Journal Classification (ASJC) codes

  • Mechanical Engineering
  • Computer Graphics and Computer-Aided Design
  • Computer Science Applications
  • Modeling and Simulation

Fingerprint

Dive into the research topics of 'Two-dimensional packing problems using genetic algorithms'. Together they form a unique fingerprint.

Cite this