Premium
A two‐stage packing problem procedure
Author(s) -
Moura Ana,
Bortfeldt Andreas
Publication year - 2016
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/itor.12251
Subject(s) - pallet , truck , container (type theory) , computer science , packing problems , process (computing) , set (abstract data type) , stage (stratigraphy) , mathematical optimization , operations research , algorithm , mathematics , automotive engineering , engineering , structural engineering , mechanical engineering , paleontology , biology , programming language , operating system
This paper deals with a two‐stage packing problem that has to be solved in the daily distribution process of a Portuguese trading company. In the first stage, boxes including goods are to be packed on pallets, while in the second stage these pallets are loaded into one or more trucks. The boxes have to be transported to different customers, and the main goal is to guarantee a sufficient utilization of the truck loading space. A two‐stage packing procedure is proposed to cover both problem stages. First, boxes are loaded onto pallets by means of a well‐known container loading algorithm. Then, trucks are filled with loaded pallets by a tree search algorithm. The performance of the two‐stage approach was evaluated using a set of instances that are based on actual company data.