A biased random key genetic algorithm for 2D and 3D bin packing problems

dc.contributor.author José Fernando Gonçalves en
dc.contributor.author Resende,MGC en
dc.date.accessioned 2018-01-03T11:39:31Z
dc.date.available 2018-01-03T11:39:31Z
dc.date.issued 2013 en
dc.description.abstract In this paper we present a novel biased random-key genetic algorithm (BRKGA) for 2D and 3D bin packing problems. The approach uses a maximal-space representation to manage the free spaces in the bins. The proposed algorithm hybridizes a novel placement procedure with a genetic algorithm based on random keys. The BRKGA is used to evolve the order in which the boxes are packed into the bins and the parameters used by the placement procedure. Two new placement heuristics are used to determine the bin and the free maximal space where each box is placed. A novel fitness function that improves significantly the solution quality is also developed. The new approach is extensively tested on 858 problem instances and compared with other approaches published in the literature. The computational experiment results demonstrate that the new approach consistently equals or outperforms the other approaches and the statistical analysis confirms that the approach is significantly better than all the other approaches. en
dc.identifier.uri http://repositorio.inesctec.pt/handle/123456789/5393
dc.identifier.uri http://dx.doi.org/10.1016/j.ijpe.2013.04.019 en
dc.language eng en
dc.relation 5730 en
dc.rights info:eu-repo/semantics/openAccess en
dc.title A biased random key genetic algorithm for 2D and 3D bin packing problems en
dc.type article en
dc.type Publication en
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
P-006-6QW.pdf
Size:
1.15 MB
Format:
Adobe Portable Document Format
Description: