Solving a hard Cutting Stock Problem by machine learning and optimisation
dc.contributor.author | Prestwich, Steven D. | |
dc.contributor.author | Fajemisin, Adejuyigbe O. | |
dc.contributor.author | Climent, Laura | |
dc.contributor.author | O'Sullivan, Barry | |
dc.contributor.funder | Science Foundation Ireland | en |
dc.date.accessioned | 2021-04-27T09:49:18Z | |
dc.date.available | 2021-04-27T09:49:18Z | |
dc.date.issued | 2015-09 | |
dc.date.updated | 2021-04-27T09:40:09Z | |
dc.description.abstract | We are working with a company on a hard industrial optimisation problem: a version of the well-known Cutting Stock Problem in which a paper mill must cut rolls of paper following certain cutting patterns to meet customer demands. In our problem each roll to be cut may have a different size, the cutting patterns are semi-automated so that we have only indirect control over them via a list of continuous parameters called a request, and there are multiple mills each able to use only one request. We solve the problem using a combination of machine learning and optimisation techniques. First we approximate the distribution of cutting patterns via Monte Carlo simulation. Secondly we cover the distribution by applying a k-medoids algorithm. Thirdly we use the results to build an ILP model which is then solved. | en |
dc.description.status | Peer reviewed | en |
dc.description.version | Accepted Version | en |
dc.format.mimetype | application/pdf | en |
dc.identifier.citation | Prestwich, S. D., Fajemisin, A. O., Climent, L. and O’Sullivan, B. (2015) 'Solving a Hard Cutting Stock Problem by Machine Learning and Optimisation'. Machine Learning and Knowledge Discovery in Databases, ECML PKDD 2015, Lecture Notes in Computer Science, vol 9284, Cham: Springer International Publishing, pp. 335-347. doi: 10.1007/978-3-319-23528-8_21 | en |
dc.identifier.doi | 10.1007/978-3-319-23528-8_21 | en |
dc.identifier.endpage | 347 | en |
dc.identifier.journaltitle | Lecture Notes in Computer Science | en |
dc.identifier.startpage | 335 | en |
dc.identifier.uri | https://hdl.handle.net/10468/11223 | |
dc.identifier.volume | 9284 | en |
dc.language.iso | en | en |
dc.publisher | Springer | en |
dc.relation.project | info:eu-repo/grantAgreement/SFI/SFI Research Centres/12/RC/2289/IE/INSIGHT - Irelands Big Data and Analytics Research Centre/ | en |
dc.relation.uri | https://link.springer.com/chapter/10.1007/978-3-319-23528-8_21 | |
dc.rights | © Springer International Publishing Switzerland 2015. 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-23528-8_21 | en |
dc.subject | Cutting Stock Problem | en |
dc.subject | Machine learning | en |
dc.subject | Optimisation problems | en |
dc.title | Solving a hard Cutting Stock Problem by machine learning and optimisation | en |
dc.type | Conference item | en |