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.
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.
This website uses cookies. By using this website, you consent to the use of cookies in accordance with the UCC Privacy and Cookies Statement. For more information about cookies and how you can disable them, visit our Privacy and Cookies statement