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
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
Mathematical Programming: Series A and B
Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem
ACM Transactions on Mathematical Software (TOMS)
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
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
Mathematical Programming: Series A and B
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
An Exact Algorithm for Higher-Dimensional Orthogonal Packing
Operations Research
Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
INFORMS Journal on Computing
A Maximal-Space Algorithm for the Container Loading Problem
INFORMS Journal on Computing
A unified exact method for solving different classes of vehicle routing problems
Mathematical Programming: Series A and B
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
Packing first, routing second-a heuristic for the vehicle routing and loading problem
Computers and Operations Research
A GRASP×ELS for the vehicle routing problem with basic three-dimensional loading constraints
Engineering Applications of Artificial Intelligence
Survey of Green Vehicle Routing Problem: Past and future trends
Expert Systems with Applications: An International Journal
Local search techniques for a routing-packing problem
Computers and Industrial Engineering
A decision support system for public logistics information service management and optimization
Decision Support Systems
| Hi-index | 0.01 |
The capacitated vehicle routing problem with three-dimensional loading constraints combines capacitated vehicle routing and three-dimensional loading with additional packing constraints concerning, for example, unloading operations. An efficient hybrid algorithm including a tabu search algorithm for routing and a tree search algorithm for loading is introduced. Computational results are presented for all publicly available test instances. Most of the best solutions previously reported in literature have been improved while the computational effort is drastically reduced compared to other methods.