Bounding the search space of the Population Harvest Cutting Problem with Multiple Size Stock Selection

dc.contributor.authorCliment, Laura
dc.contributor.authorO'Sullivan, Barry
dc.contributor.authorPrestwich, Steven D.
dc.contributor.editorFesta, P.
dc.contributor.editorSellman, M.
dc.contributor.editorVanschoren, J.
dc.contributor.funderScience Foundation Irelanden
dc.date.accessioned2021-04-20T16:21:03Z
dc.date.available2021-04-20T16:21:03Z
dc.date.issued2016-12-01
dc.date.updated2021-04-20T16:05:18Z
dc.description.abstractIn this paper we deal with a variant of the Multiple Stock Size Cutting Stock Problem (MSSCSP) arising from population harvesting, in which some sets of large pieces of raw material (of different shapes) must be cut following certain patterns to meet customer demands of certain product types. The main extra difficulty of this variant of the MSSCSP lies in the fact that the available patterns are not known a priori. Instead, a given complex algorithm maps a vector of continuous variables called a values vector into a vector of total amounts of products, which we call a global products pattern. Modeling and solving this MSSCSP is not straightforward since the number of value vectors is infinite and the mapping algorithm consumes a significant amount of time, which precludes complete pattern enumeration. For this reason a representative sample of global products patterns must be selected. We propose an approach to bounding the search space of the values vector and an algorithm for performing an exhaustive sampling using such bounds. Our approach has been evaluated with real data provided by an industry partneren
dc.description.statusPeer revieweden
dc.description.versionAccepted Versionen
dc.format.mimetypeapplication/pdfen
dc.identifier.citationCliment L., O’Sullivan B., Prestwich S.D. (2016) 'Bounding the Search Space of the Population Harvest Cutting Problem with Multiple Size Stock Selection', in Festa P., Sellmann M. and Vanschoren J. (eds)., Learning and Intelligent Optimization, LION 2016, Lecture Notes in Computer Science, vol 10079, pp. 75-90. doi: 10.1007/978-3-319-50349-3_6en
dc.identifier.doi10.1007/978-3-319-50349-3_6en
dc.identifier.endpage90en
dc.identifier.issn0302-9743
dc.identifier.journaltitleLecture Notes in Computer Sciencen
dc.identifier.startpage75en
dc.identifier.urihttps://hdl.handle.net/10468/11217
dc.language.isoenen
dc.publisherSpringeren
dc.relation.projectinfo:eu-repo/grantAgreement/SFI/SFI Research Centres/12/RC/2289/IE/INSIGHT - Irelands Big Data and Analytics Research Centre/en
dc.relation.urihttps://link.springer.com/chapter/10.1007/978-3-319-50349-3_6
dc.rights© Springer International Publishing AG 2016. This is a post-peer-review, pre-copyedit version of an article published in Lecture Notes in Computer Science. The final authenticated version is available online at: http://dx.doi.org/10.1007/978-3-319-50349-3_6en
dc.subjectPopulation harvestingen
dc.subjectGlobal production patternsen
dc.subjectVector valuesen
dc.subjectCutting Stock Problem (CSP)en
dc.subjectValued search spaceen
dc.titleBounding the search space of the Population Harvest Cutting Problem with Multiple Size Stock Selectionen
dc.typeConference itemen
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
lion16.pdf
Size:
505.03 KB
Format:
Adobe Portable Document Format
Description:
Accepted version
License bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
2.71 KB
Format:
Item-specific license agreed upon to submission
Description: