Bitte benutzen Sie diese Kennung, um auf die Ressource zu verweisen: http://doi.org/10.25358/openscience-7216
Autoren: Heßler, Katrin
Irnich, Stefan
Kreiter, Tobias
Pferschy, Ulrich
Titel: Bin packing with lexicographic objectives for loading weight- and volume-constrained trucks in a direct-shipping system
Online-Publikationsdatum: 27-Jun-2022
Erscheinungsdatum: 2022
Sprache des Dokuments: Englisch
Zusammenfassung/Abstract: We consider a packing problem that arises in a direct-shipping system in the food and beverage industry: Trucks are the containers, and products to be distributed are the items. The packing is constrained by two independent quantities, weight (e.g., measured in kg) and volume (number of pallets). Additionally, the products are grouped into the three categories: standard, cooled, and frozen (the latter two require refrigerated trucks). Products of different categories can be transported in one truck using separated zones, but the cost of a truck depends on the transported product categories. Moreover, splitting orders of a product should be avoided so that (un-)loading is simplified. As a result, we seek for a feasible packing optimizing the following objective functions in a strictly lexicographic sense: minimize the (1) total number of trucks; (2) number of refrigerated trucks; (3) number of refrigerated trucks which contain frozen products; (4) number of refrigerated trucks which also transport standard products; (5) and minimize splitting. This is a real-world application of a bin-packing problem with cardinality constraints a.k.a. the two-dimensional vector packing problem with additional constraints. We provide a heuristic and an exact solution approach. The heuristic meta-scheme considers the multi-compartment and item fragmentation features of the problem and applies various problem-specific heuristics. The exact solution algorithm covering all five stages is based on branch-and-price using stabilization techniques exploiting dual-optimal inequalities. Computational results on real-world and difficult self-generated instances prove the applicability of our approach.
DDC-Sachgruppe: 330 Wirtschaft
330 Economics
650 Management
650 Management and auxiliary services
Veröffentlichende Institution: Johannes Gutenberg-Universität Mainz
Organisationseinheit: FB 03 Rechts- und Wirtschaftswissenschaften
Veröffentlichungsort: Mainz
ROR: https://ror.org/023b0x485
DOI: http://doi.org/10.25358/openscience-7216
Version: Published version
Publikationstyp: Zeitschriftenaufsatz
Nutzungsrechte: CC BY
Informationen zu den Nutzungsrechten: https://creativecommons.org/licenses/by/4.0/
Zeitschrift: OR spectrum
44
2
Seitenzahl oder Artikelnummer: 375
417
Verlag: Springer
Verlagsort: Berlin u.a.
Erscheinungsdatum: 2022
ISSN: 1436-6304
DOI der Originalveröffentlichung: 10.1007/s00291-021-00628-x
Enthalten in den Sammlungen:JGU-Publikationen

Dateien zu dieser Ressource:
  Datei Beschreibung GrößeFormat
Miniaturbild
bin_packing_with_lexicographi-20220624141747293.pdf1.15 MBAdobe PDFÖffnen/Anzeigen