Comparison between metaheuristic and exact models in the packing problem resolution

J. Bautista, A. Gómez, J. Pereira, J. Lozano

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

Abstract

The aim of this work is to present two algorithms designed to optimise the cutting process of an L-type guillotine and to minimise the number of sheets used to manufacture a number of rectangular pieces. Two algorithms are proposed, one based on Genetic Algorithms and the other on Simulated Annealing. They are compared with the help of a bank of examples. Both algorithms provide very good results, although each of them has its peculiarities, which are described in this work.

Original languageEnglish
Title of host publicationProceedings of the 2005 International Conference on Artificial Intelligence, ICAI'05
Pages435-441
Number of pages7
StatePublished - 2005
Externally publishedYes
Event2005 International Conference on Artificial Intelligence, ICAI'05 - Las Vegas, NV, United States
Duration: 27 Jun 200530 Jun 2005

Publication series

NameProceedings of the 2005 International Conference on Artificial Intelligence, ICAI'05
Volume2

Conference

Conference2005 International Conference on Artificial Intelligence, ICAI'05
Country/TerritoryUnited States
CityLas Vegas, NV
Period27/06/0530/06/05

Keywords

  • Genetic algorithms
  • Optimisation
  • Packing

Fingerprint

Dive into the research topics of 'Comparison between metaheuristic and exact models in the packing problem resolution'. Together they form a unique fingerprint.

Cite this