The vehicle routing problem
The vehicle routing problem
GVR: A New Genetic Representation for the Vehicle Routing Problem
AICS '02 Proceedings of the 13th Irish International Conference on Artificial Intelligence and Cognitive Science
On the influence of GVR in vehicle routing
Proceedings of the 2003 ACM symposium on Applied computing
A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
Computers and Operations Research
Lagrangian duality applied to the vehicle routing problem with time windows
Computers and Operations Research
A Hybrid Multiobjective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows
Computational Optimization and Applications
A column generation approach to the heterogeneous fleet vehicle routing problem
Computers and Operations Research
A general heuristic for vehicle routing problems
Computers and Operations Research
Location-Routing Problems with Distance Constraints
Transportation Science
The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
INFORMS Journal on Computing
Selected Topics in Column Generation
Operations Research
A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
Operations Research
Routing for a Just-in-Time Supply Pickup and Delivery System
Transportation Science
Dynamic Column Generation for Dynamic Vehicle Routing with Time Windows
Transportation Science
Discrete Applied Mathematics
Formulations and exact algorithms for the vehicle routing problem with time windows
Computers and Operations Research
Computers and Operations Research
Computers and Industrial Engineering
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows
Transportation Science
Lagrangian duality applied to the vehicle routing problem with time windows
Computers and Operations Research
Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling
INFORMS Journal on Computing
A hybrid algorithm for vehicle routing problem with time windows
Expert Systems with Applications: An International Journal
Parallel simulated annealing for the vehicle routing problem with time windows
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
An improved LNS algorithm for real-time vehicle routing problem with time windows
Computers and Operations Research
A multi-agent approach to load consolidation in transportation
Advances in Engineering Software
Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows
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
Ant colony system for optimizing vehicle routing problem with time windows (VRPTW)
ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
Accelerated label setting algorithms for the elementary resource constrained shortest path problem
Operations Research Letters
A dual ascent procedure for the set partitioning problem
Discrete Optimization
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
Combined location and routing problems for drug distribution
Discrete Applied Mathematics
Hi-index | 0.00 |
This paper introduces a strong valid inequality, the 2-path cut, to produce better lower bounds for the vehicle routing problem with time windows. It also develops an effective separation algorithm to find such inequalities. We next incorporate them as needed in the master problem of a Dantzig-Wolfe decomposition approach. In this enhanced optimization algorithm, the coupling constraints require that each customer be serviced. The subproblem is a shortest path problem with time window and capacity constraints. We apply branch and bound to obtain integer solutions. We first branch on the number of vehicles if this is fractional, and then on the flow variables. The algorithm has been implemented and tested on problems of up to 100 customers from the Solomon datasets. It has succeeded in solving to optimality several previously unsolved problems and a new 150-customer problem. In addition, the algorithm proved faster than algorithms previously considered in the literature. These computational results indicate the effectiveness of the valid inequalities we have developed.