@inbook{b788d8f5ccdc485a9ef6c94689f43c49,
title = "An improved metaheuristic algorithm for maximizing demand satisfaction in the population harvest cutting stock problem",
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.",
author = "Laura Climent and Barry O{\textquoteright}Sullivan and Wallace, \{Richard J.\}",
note = "Publisher Copyright: Copyright {\textcopyright} 2016, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 9th Annual Symposium on Combinatorial Search, SoCS 2016 ; Conference date: 06-07-2016 Through 08-07-2016",
year = "2016",
doi = "10.1609/socs.v7i1.18397",
language = "English",
series = "Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016",
publisher = "Association for the Advancement of Artificial Intelligence",
pages = "127--128",
editor = "Baier, \{Jorge A.\} and Adi Botea",
booktitle = "Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016",
address = "United States",
}