An Improved Metaheuristic Algorithm for Maximizing Demand Satisfaction in the Population Harvest Cutting Stock Problem
Publication Type:
Refereed Conference Meeting Proceeding
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.
Conference Name:
International Symposium on Combinatorial Search (SoCS)
Proceedings:
Proceeding on the International Symposium on Combinatorial Search
Digital Object Identifer (DOI):
in press
Publication Date:
08/07/2016
Conference Location:
United States of America
Research Group:
Institution:
National University of Ireland, Cork (UCC)
Open access repository:
No