An improved metaheuristic algorithm for maximizing demand satisfaction in the population harvest Cutting Stock Problem

Loading...
Thumbnail Image
Files
13954-61073-1-PB.pdf(466.9 KB)
Published version
Date
2016-07-06
Authors
Climent, Laura
O'Sullivan, Barry
Wallace, Richard J.
Journal Title
Journal ISSN
Volume Title
Publisher
AAAI Publications
Published Version
Research Projects
Organizational Units
Journal Issue
Abstract
We present a greedy version of an existing metaheuristic algorithm for a special version of the Cutting Stock Problem (CSP). For this version, it is only possible to have indirect control over the patterns via a vector of continuous values which we refer to as a weights vector. Our algorithm iteratively generates new weights vectors by making local changes over the best weights vector computed so far. This allows us to achieve better solutions much faster than is possible with the original metaheuristic.
Description
Keywords
Metaheuritic , Cutting stock problem , Simulated annealing like algorithm , Forestry harvesting
Citation
Climent, L., O'Sullivan, B. and Wallace, R. J. (2016) 'An Improved Metaheuristic Algorithm for Maximizing Demand Satisfaction in the Population Harvest Cutting Stock Problem', SoCS 2016, the 9th Annual Symposium on Combinatorial Search, Tarrytown, New York, USA, 06-08 July.
Copyright
© 2016, Association for the Advancement of Artificial Intelligence (www.aaai.org)