Fast pattern-based algorithms for cutting stock

Please use this identifier to cite or link to this item: http://repositorio.inesctec.pt/handle/123456789/5623

Full metadata record

DC Field	Value	Language
dc.contributor.author	Filipe Daniel Brandão	en
dc.contributor.author	João Pedro Pedroso	en
dc.date.accessioned	2018-01-06T09:43:33Z	-
dc.date.available	2018-01-06T09:43:33Z	-
dc.date.issued	2014	en
dc.identifier.uri	http://repositorio.inesctec.pt/handle/123456789/5623	-
dc.identifier.uri	http://dx.doi.org/10.1016/j.cor.2014.03.003	en
dc.description.abstract	The conventional assignment-based first/best fit decreasing algorithms (FFD/BFD) are not polynomial in the one-dimensional cutting stock input size in its most common format. Therefore, even for small instances with large demands, it is difficult to compute FFD/BFD solutions. We present pattern-based methods that overcome the main problems of conventional heuristics in cutting stock problems by representing the solution in a much more compact format Using our pattern-based heuristics, FFD/BFD solutions for extremely large cutting stock instances, with billions of items, can be found in a very short amount of time.	en
dc.language	eng	en
dc.relation	5857	en
dc.relation	4747	en
dc.rights	info:eu-repo/semantics/embargoedAccess	en
dc.title	Fast pattern-based algorithms for cutting stock	en
dc.type	article	en
dc.type	Publication	en
Appears in Collections:	CEGI - Articles in International Journals

Files in This Item:

File	Description	Size	Format
P-009-BXK.pdf Restricted Access		815.89 kB	Adobe PDF	View/Open Request a copy