New insertion and postoptimization procedures for the traveling salesman problem
Operations Research
Computers and Operations Research
The vehicle routing problem
The Three-Dimensional Bin Packing Problem
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
A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints
Networks - Special Issue In Memory of Stefano Pallottino
An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints
Transportation Science
INFORMS Journal on Computing
Optimal vehicle routing with real-time traffic information
IEEE Transactions on Intelligent Transportation Systems
Truck route planning in nonstationary stochastic networks with time windows at customer locations
IEEE Transactions on Intelligent Transportation Systems
Computers and Operations Research
A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
Computers and Operations Research
Computers and Operations Research
Pheromone-Based heuristic column generation for vehicle routing problems with black box feasibility
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
The Pallet-Packing Vehicle Routing Problem
Transportation Science
Packing first, routing second-a heuristic for the vehicle routing and loading problem
Computers and Operations Research
Local search for a multi-drop multi-container loading problem
Journal of Heuristics
A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
Computers and Operations Research
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
Hi-index | 0.00 |
This paper examines a recently addressed practical variant of the capacitated vehicle routing problem (VRP) called the Capacitated Vehicle Routing Problem with 3-D Loading Constraints (3L-CVRP). This problem considers customer demand to be formed by 3-D rectangular items. Additional loading constraints often encountered in real-life applications of transportation logistics are imposed on the examined problem model. In addition to 3L-CVRP, we also introduce and solve a new practical problem version that was dictated by a transportation logistics company and covers cases in which transported items are manually unloaded from the loading spaces of the vehicles. Both problem versions are solved by a hybrid metaheuristic methodology that combines the strategies of tabu search (TS) and guided local search (GLS). The loading characteristics are tackled by employing a collection of packing heuristics. The proposed algorithm's robustness was tested for both problem versions, solving benchmark instances derived from the literature and new benchmark problems with diverse features in terms of customer set size and transported-item dimensions. It produced fine results, improving most of the best solutions that were previously reported.