A Hybrid Genetic Algorithm for Optimization of Two-dimensional Cutting-Stock Problem

A Hybrid Genetic Algorithm for Optimization of Two-dimensional Cutting-Stock Problem

Ahmed Mellouli, Faouzi Masmoudi, Imed Kacem, Mohamed Haddar
Copyright: © 2010 |Pages: 16
DOI: 10.4018/jamc.2010040103
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

In this paper, the authors present a hybrid genetic approach for the two-dimensional rectangular guillotine oriented cutting-stock problem. In this method, the genetic algorithm is used to select a set of cutting patterns while the linear programming model permits one to create the lengths to produce with each cutting pattern to fulfil the customer orders with minimal production cost. The effectiveness of the hybrid genetic approach has been evaluated through a set of instances which are both randomly generated and collected from the literature.
Article Preview
Top

Problem Formulation

In this paper, we study the two-dimensional rectangular guillotine oriented cutting-stock problem. This problem can be stated as follows. N customer orders of rectangular pieces with dimensions wili (i=1,…, N) are requested with quantity di (i=1,…, N). di is usually a very large number, greater than one hundred, and it is to be cut from K rolls of material with standard width Wk (k=1,…, K), each in sufficient length to satisfy the entire demand.

Complete Article List

Search this Journal:
Reset
Volume 15: 1 Issue (2024)
Volume 14: 1 Issue (2023)
Volume 13: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 12: 4 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing