Please use this identifier to cite or link to this item: http://repositorio.inesctec.pt/handle/123456789/5714
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAntónio Galrão Ramosen
dc.contributor.authorJosé Fernando Oliveiraen
dc.contributor.authorLopes,MPen
dc.date.accessioned2018-01-08T10:47:43Z-
dc.date.available2018-01-08T10:47:43Z-
dc.date.issued2016en
dc.identifier.urihttp://repositorio.inesctec.pt/handle/123456789/5714-
dc.identifier.urihttp://dx.doi.org/10.1111/itor.12124en
dc.description.abstractThe container loading problem (CLP) is a combinatorial optimization problem for the spatial arrangement of cargo inside containers so as to maximize the usage of space. The algorithms for this problem are of limited practical applicability if real-world constraints are not considered, one of the most important of which is deemed to be stability. This paper addresses static stability, as opposed to dynamic stability, looking at the stability of the cargo during container loading. This paper proposes two algorithms. The first is a static stability algorithm based on static mechanical equilibrium conditions that can be used as a stability evaluation function embedded in CLP algorithms (e.g. constructive heuristics, metaheuristics). The second proposed algorithm is a physical packing sequence algorithm that, given a container loading arrangement, generates the actual sequence by which each box is placed inside the container, considering static stability and loading operation efficiency constraints. © 2015 The Authors.en
dc.languageengen
dc.relation265en
dc.relation5899en
dc.rightsinfo:eu-repo/semantics/embargoedAccessen
dc.titleA physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditionsen
dc.typearticleen
dc.typePublicationen
Appears in Collections:CEGI - Articles in International Journals

Files in This Item:
File Description SizeFormat 
P-00A-AC2.pdf
  Restricted Access
802.05 kBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.