Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
Computers and Operations Research
The vehicle routing problem
Branch-and-cut algorithms for the capacitated VRP
The vehicle routing problem
A Savings Based Ant System For The Vehicle Routing Problem
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
INFORMS Journal on Computing
A new branch-and-cut algorithm for the capacitated vehicle routing problem
Mathematical Programming: Series A and B
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
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
INFORMS Journal on Computing
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
Networks - Networks Optimization Workshop, August 22–25, 2006
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
Survey: matheuristics for rich vehicle routing problems
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
Multiple pickup and delivery TSP with LIFO and distance constraints: a VNS approach
IEA/AIE'11 Proceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part II
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
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 |
The multi-pile vehicle routing problem is a particular combination of loading and routing problems, in which items have to be loaded into different piles within vehicles, and then delivered with minimum cost. The problem is motivated by a real-world timber distribution problem, and is of both theoretical and practical interest. In this paper, we first develop heuristic and exact methods to solve the loading problem. We then include these methods into a tailored combination of Variable Neighborhood Search and Branch-and-Cut, to solve the overall problem. Extensive computational results show how the resulting algorithms are capable of solving to optimality a large number of small-size instances, and of consistently outperforming previous algorithms from the literature on large-size and real-world instances.