A two‐stage packing problem procedure. (12th January 2016)

• Record Type: Journal Article
• Authors: Moura, Ana; Bortfeldt, Andreas
• Other Names: Cancela Héctor guestEditor.; Martins Simone guestEditor.; Mauttone Antonio guestEditor.; Urquhart María E. guestEditor.
• Is Part Of: International transactions in operational research. Volume 24:Number 1/2(2017)
• Page Start: 43
• Page End: 58
• Publication Date: 2016-01-12
• Subjects: bin packing -- pallet loading -- GRASP -- tree search; Operations research -- Periodicals; 003
• DOI: 10.1111/itor.12251
• Languages: English
• ISSNs: 0969-6016

Abstract

Abstract: 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.