Title
An Evolutionary Algorithm For The One-Dimensional Cutting Stock Problem
Abstract
This paper deals with the one-dimensional integer cutting stock problem, which consists of cutting a set of available objects in stock in order to produce ordered smaller items in such a way as to minimize the waste of material. The case in which there are various types of objects available in stock in limited quantities is studied. A new heuristic method based on the evolutionary algorithm concept is proposed to solve the problem. This heuristic is empirically analyzed by solving randomly generated instances and the results are compared with other methods from the literature.
Year
DOI
Venue
2011
10.1111/j.1475-3995.2009.00760.x
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH
Keywords
Field
DocType
integer optimization, cutting stock problem, evolutionary algorithm
Integer,Mathematical optimization,Heuristic,Evolutionary algorithm,Cutting stock problem,Operations management,Mathematics
Journal
Volume
Issue
ISSN
18
1
0969-6016
Citations 
PageRank 
References 
5
0.46
17
Authors
3
Name
Order
Citations
PageRank
Silvio A. Araujo11048.44
Ademir A. Constantino250.46
Kelly C. Poldi350.46