A new optimization algorithm for the vehicle routing problem with time windows
Operations Research
MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows
New ideas in optimization
Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics
Journal of Heuristics
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Operations Research
Formulations and exact algorithms for the vehicle routing problem with time windows
Computers and Operations Research
Computers and Operations Research
Decomposition, reformulation, and diving in university course timetabling
Computers and Operations Research
A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
Computers and Operations Research
Solving the Curfew Planning Problem
Transportation Science
Vehicle routing under time-dependent travel times: The impact of congestion avoidance
Computers and Operations Research
New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
Operations Research
Chebyshev center based column generation
Discrete Applied Mathematics
Vehicle routing problem with time windows considering overtime and outsourcing vehicles
Expert Systems with Applications: An International Journal
Lifted and Local Reachability Cuts for the Vehicle Routing Problem with Time Windows
Computers and Operations Research
Using the primal-dual interior point algorithm within the branch-price-and-cut method
Computers and Operations Research
Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows
Transportation Science
Hi-index | 0.01 |
The usual column generation model for a Vehicle Routing Problem involves an elementary shortest-path subproblem. The worst-case complexity of the known algorithms for this problem being too high, the elementary-path constraint is usually relaxed. Indeed, as each customer must be visited exactly once, the two problems with and without the elementary-path constraint have the same optimal integer solutions. In this article, we propose one theoretical and several practical improvements to the algorithm for elementary paths. We obtain better lower bounds and pruning of the search tree, and these improvements allowed us to find an exact solution to 17 instances of the Solomon benchmark suite which were previously open