Background: Logistics and transport, core of many business processes, are continuously optimized to improve efficiency and market competitiveness. The paper describes a modular coordination of vehicle routing and bin packing problems that enables independent instances of the problems to be joined together, with the aim that the vehicle routing solution satisfies all the constraints from real-world applications. Methods: The vehicle routing algorithm is based on an adaptive memory procedure that also incorporates a simple, one-dimensional bin packing problem. This preliminary packing solution is refined by a complex, three dimensional bin packing for each vehicle to identify the infeasible packages. The method iteratively adjusts virtual volumes until reaching near-optimal routes that respect bin-packing constraints. Results: The coordination enables independent applications of an adaptive memory procedure to vehicle routing and a genetic algorithm approach to bin packing while joining them in a computationally tractable way. Such a coordinated approach is applied to a frequently used public benchmark and proven to provide commensurate costs while significantly lowering algorithm complexity. Conclusions: The proposed method is further validated on a real industrial case study and provided additional savings of 14.48% in average daily distance traveled compared to the current industrial standard.
Modular Coordination of Vehicle Routing and Bin Packing Problems in Last Mile Logistics
2025
Article (Journal)
Electronic Resource
Unknown
Metadata by DOAJ is licensed under CC BY-SA 1.0
Last-Mile-Logistics : best practices
TIBKAT | 2004
|Last-Mile-Logistics: Best Practices
SLUB | 2004
|Last-Mile Logistics in Urban Areas
TIBKAT | 2020
|