Vehicle routing with split deliveries
Discrete Applied Mathematics
Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
INFORMS Journal on Computing
The Three-Dimensional Bin Packing Problem
Operations Research
EasyLocal++: an object-oriented framework for the flexible design of local-search algorithms
Software—Practice & Experience
D-Ants: savings based ants divide and conquer the vehicle routing problem
Computers and Operations Research
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem
Transportation Science
Worst-Case Analysis for Split Delivery Vehicle Routing Problems
Transportation Science
A Tabu Search Algorithm for a Routing and Container Loading Problem
Transportation Science
An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem
Transportation Science
Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
INFORMS Journal on Computing
IEEE Transactions on Intelligent Transportation Systems
A Tree Search Algorithm for Solving the Container Loading Problem
INFORMS Journal on Computing
Two natural heuristics for 3D packing with practical loading constraints
PRICAI'10 Proceedings of the 11th Pacific Rim international conference on Trends in artificial intelligence
Three-dimensional container loading models with cargo stability and load bearing constraints
Computers and Operations Research
Computers and Operations Research
The Pallet-Packing Vehicle Routing Problem
Transportation Science
Local search for a multi-drop multi-container loading problem
Journal of Heuristics
Hi-index | 0.00 |
We propose a complex real-world problem in logistics that integrates routing and packing aspects. It can be seen as an extension of the Three-Dimensional Loading Capacitated Vehicle Routing Problem (3L-CVRP) introduced by Gendreau, Iori, Laporte, and Martello (2006). The 3L-CVRP consists in finding a set of routes that satisfies the demand of all customers, minimizes the total routing cost, and guarantees a packing of items that is feasible according to loading constraints. Our problem formulation includes additional constraints in relation to the stability of the cargo, to the fragility of items, and to the loading and unloading policy. In addition, it considers the possibility of split deliveries, so that each customer can be visited more than once. We propose a local search approach that considers the overall problem in a single stage. It is based on a composite strategy that interleaves simulated annealing with large-neighborhood search. We test our solver on 13 real-world instances provided by our industrial partner, which are very diverse in size and features. In addition, we compare our solver on benchmarks from the literature of the 3L-CVRP showing that our solver performs well compared to other approaches proposed in the literature.