Mutation ant colony algorithms of constrained two-dimensional guillotine cutting problems

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The two-dimensional cutting problem plays an important role in many goods production processes. The two-dimensional cutting problem addressed in this paper consists of cutting a large rectangular plate into a number of stripes which are then cut to obtain ordered smaller rectangles. Its objective is to maximize the total area used and the numbers of ordered pieces are limited to specified numbers. To obtain ant colony algorithm for this problem, an order-cutting method is given and solving this problem is translated to searching an optimal machining order by order-cutting method. Then an ant colony algorithm and its improving algorithm with mutation operator and reproduction in-break operator are given to searching an optimal machining order. Computational results are presented for some large randomly generated problems.

Original languageEnglish
Title of host publicationProceedings of the World Congress on Intelligent Control and Automation (WCICA)
Pages3042-3046
Number of pages5
DOIs
StatePublished - 2006
Externally publishedYes
Event6th World Congress on Intelligent Control and Automation, WCICA 2006 - Dalian, China
Duration: 21 Jun 200623 Jun 2006

Publication series

NameProceedings of the World Congress on Intelligent Control and Automation (WCICA)
Volume1

Conference

Conference6th World Congress on Intelligent Control and Automation, WCICA 2006
Country/TerritoryChina
CityDalian
Period21/06/0623/06/06

Keywords

  • Ant colony algorithm
  • Mutation operator
  • Reproduction in-break operator
  • Two-dimensional guillotine cutting problem

Fingerprint

Dive into the research topics of 'Mutation ant colony algorithms of constrained two-dimensional guillotine cutting problems'. Together they form a unique fingerprint.

Cite this