The vehicle routing problem
The Three-Dimensional Bin Packing Problem
Operations Research
Guided Local Search for the Three-Dimensional Bin-Packing Problem
INFORMS Journal on Computing
The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
INFORMS Journal on Computing
Very large-scale vehicle routing: new test problems, algorithms, and results
Computers and Operations Research
A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
Computers and Operations Research
A GRASP Approach to the Container-Loading Problem
IEEE Intelligent Systems
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
Mathematical Programming: Series A and B
A general heuristic for vehicle routing problems
Computers and Operations Research
An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
Computers and Operations Research
Active-guided evolution strategies for large-scale capacitated vehicle routing problems
Computers and Operations Research
Active guided evolution strategies for large-scale vehicle routing problems with time windows
Computers and Operations Research
A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows
Transportation Science
A Tabu Search Algorithm for a Routing and Container Loading Problem
Transportation Science
Journal of Global Optimization
A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints
Networks - Special Issue In Memory of Stefano Pallottino
Ant colony optimization for the two-dimensional loading vehicle routing problem
Computers and Operations Research
An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints
Transportation Science
A Maximal-Space Algorithm for the Container Loading Problem
INFORMS Journal on Computing
IEEE Transactions on Intelligent Transportation Systems
Neighborhood structures for the container loading problem: a VNS implementation
Journal of Heuristics
Honey Bees Mating Optimization algorithm for large scale vehicle routing problems
Natural Computing: an international journal
Edge assembly crossover for the capacitated vehicle routing problem
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
A Tree Search Algorithm for Solving the Container Loading Problem
INFORMS Journal on Computing
A parallel multi-population biased random-key genetic algorithm for a container loading problem
Computers and Operations Research
Computers and Operations Research
| Hi-index | 0.01 |
The Vehicle Routing and Loading Problem (VRLP) results by combining vehicle routing, possibly with time windows, and three-dimensional loading. Some packing constraints of high practical relevance, among them an unloading sequence constraint and a support constraint, are also part of the VRLP. Different formulations of the VRLP are considered and the issue is discussed under which circumstances routing and packing should be tackled as a combined task. A two-stage heuristic is presented following a ''packing first, routing second'' approach, i.e. the packing of goods and the routing of vehicles is done in two strictly separated stages. High quality results are achieved in short computation times for the 46 VRLP instances recently introduced by Moura and Oliveira. Moreover 120 new large benchmark instances including up to 1000 customers and 50,000 boxes are introduced and results for these instances are also reported.