The vehicle routing problem
Drive: Dynamic Routing of Independent Vehicles
Operations Research
Solving a Practical Pickup and Delivery Problem
Transportation Science
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics
Transportation Science
Vehicle Scheduling and Routing with Drivers' Working Hours
Transportation Science
Transportation Science
Truck driver scheduling in Australia
Computers and Operations Research
Restricted dynamic programming: A flexible framework for solving realistic VRPs
Computers and Operations Research
Problem transformations for vehicle routing and scheduling in the European Union
INOC'11 Proceedings of the 5th international conference on Network optimization
The Canadian minimum duration truck driver scheduling problem
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
Truck Driver Scheduling in the United States
Transportation Science
Long-Haul Vehicle Routing and Scheduling with Working Hour Rules
Transportation Science
Hi-index | 0.00 |
As of April 2007, the European Union has new regulations concerning driver working hours. These rules force the placement of breaks and rests into vehicle routes when consecutive driving or working time exceeds certain limits. This paper proposes a large neighborhood search method for the vehicle routing problem with time windows and driver regulations. In this method, neighborhoods are explored using a column generation heuristic that relies on a tabu search algorithm for generating new columns (routes). Checking route feasibility after inserting a customer into a route in the tabu search algorithm is not an easy task. To do so, we model all feasibility rules as resource constraints, develop a label-setting algorithm to perform this check, and show how it can be used efficiently to validate multiple customer insertions into a given existing route. We test the overall solution method on modified Solomon instances and report computational results that clearly show the efficiency of our method compared to two other existing heuristics.