Multi-objective 3D bin packing problem with load balance and product family concerns

Basit Öğe Kaydı
dc.contributor.authorErbayrak, Seda
dc.contributor.authorOzkir, Vildan
dc.contributor.authorYildirim, U. Mahir
dc.date.accessioned2024-07-18T20:42:31Z
dc.date.available2024-07-18T20:42:31Z
dc.date.issued2021
dc.departmentİstanbul Bilgi Üniversitesien_US
dc.description.abstractThe classical three-dimensional bin packing problem (3D-BPP) orthogonally packs a set of rectangular items with varying dimensions into the minimum number of three-dimensional rectangular bins. While ensuring the minimum number of bins used, the safety of the logistic operations is addressed with the complementary loadbalancing objective for which concepts such as orientation and stability are used in the literature though not at the same time. In this study, we extend the load-balanced 3D-BPP by combining both orientation and stability, and introducing a new concept called family unity which encourages packing a family of products (e.g., from the same order and with the same destination) together. Although item related concerns are very common in practice, there are no multi-objective studies in the bin packing literature that includes family unity concept. Therefore, this is the first study that proposes a multi-objective mixed integer programming model for the extended problem to determine the optimal packing plan that minimizes the number of bins used and the deviation of balance from the ideal barycenter while maximizing family unity ratio via a weighted objective function. A numerical example is provided to analyze the performance of the proposed model. Furthermore, a real-life container loading problem is solved and outputs of the study implies the practical advantages of including family unity and load-balance considerations in solving 3D-BPP problems.en_US
dc.identifier.doi10.1016/j.cie.2021.107518
dc.identifier.issn0360-8352
dc.identifier.issn1879-0550
dc.identifier.scopus2-s2.0-85109034875en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.urihttps://doi.org/10.1016/j.cie.2021.107518
dc.identifier.urihttps://hdl.handle.net/11411/7307
dc.identifier.volume159en_US
dc.identifier.wosWOS:000687470600001en_US
dc.identifier.wosqualityQ1en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherPergamon-Elsevier Science Ltden_US
dc.relation.ispartofComputers & Industrial Engineeringen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectBin Packingen_US
dc.subjectLoad Balanceen_US
dc.subjectFamily Unityen_US
dc.subjectContainer Loadingen_US
dc.subjectMathematical-Modelsen_US
dc.subjectContaineren_US
dc.subjectAlgorithmen_US
dc.titleMulti-objective 3D bin packing problem with load balance and product family concerns
dc.typeArticle

Dosyalar

Koleksiyon

Web of Science Indexed Publications
Scopus Indexed Publications