Optimizing the packing strategy for parcel delivery vans

Optimizing the packing strategy for parcel delivery vans

Zwep, Louise (TU Delft Electrical Engineering, Mathematics and Computer Science; TU Delft Discrete Mathematics and Optimization)

Gijswijt, D.C. (mentor)
Nane, G.F. (graduation committee)
Jonkers, T. (graduation committee)

Delft University of Technology

Applied Mathematics

2023-05-23

The increasing popularity of e-commerce has led to a greater emphasis on improving parcel delivery processes. Among the various stages of the delivery process, packing parcels into delivery vans affects the delivery time. The efficiency of delivery is optimized when each parcel is conveniently accessible upon arrival, thereby minimizing the requirement for additional repacking time. Therefore, streamlining parcel packing within delivery vehicles is a crucial aspect of improving overall delivery times in e-commerce. This thesis focuses on developing a packing solution that conforms to the the Last-In-First-Out (LIFO) principle, which is defined as ensuring that a parcel can be accessed by the delivery driver as soon as they reach the destination of the parcel. This is described as the 3D-Bin Packing Problem with Loading Constraints (3L-BPP). To solve this problem, a formulation of a Mixed Integer Linear Program (MILP) has been developed. To improve the speed and accuracy of the solution, a novel placement heuristic has been created. This heuristic is derived from the established Distance to the Front-Top-Right Corner (DFTRC)-2 method and is designed to generate an initial solution.

Both the MILP and the heuristic are tested on a data set of 789 distinct rides, provided by a Dutch postal company. The results demonstrate that (a modified version of) the heuristic successfully generated an initial solution for all rides in the dataset, with 98.9% being found within 3 seconds, and for the remaining 1.1%, the inclusion of a Genetic Algorithm led to a solution being found within 90 seconds. By using the heuristic to establish an initial solution that is then refined through optimization techniques for the MILP, the findings indicate that this approach yields the best outcomes in minimizing the number of incorrectly positioned parcels.

3D-Bin Packing Problem
Mixed integer linear programming
Placement heuristics
LIFO

http://resolver.tudelft.nl/uuid:f127e334-ae93-44dc-93ba-301688a62427

Student theses

master thesis

© 2023 Louise Zwep