Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows
Transportation Science
A penalty-based edge assembly memetic algorithm for 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
Multi-objective and multi-constrained non-additive shortest path problems
Computers and Operations Research
Multidimentional self-organization for online time-constrained vehicle routing problems
KES-AMSTA'10 Proceedings of the 4th KES international conference on Agent and multi-agent systems: technologies and applications, Part II
INFORMS Journal on Computing
An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
Operations Research
Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows
Transportation Science
A cross entropy multiagent learning algorithm for solving vehicle routing problems with time windows
ICCL'11 Proceedings of the Second international conference on Computational logistics
New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
Operations Research
New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows
INFORMS Journal on Computing
Vehicle routing problem with time windows considering overtime and outsourcing vehicles
Expert Systems with Applications: An International Journal
Fleet organization models for online vehicle routing problems
Transactions on Computational Collective Intelligence VII
Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
Operations Research
A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem
Transportation Science
An Exact Algorithm for the Multitrip Vehicle Routing Problem
INFORMS Journal on Computing
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
Single liner shipping service design
Computers and Operations Research
Combined location and routing problems for drug distribution
Discrete Applied Mathematics
Hi-index | 0.00 |
This paper presents a branch-and-cut-and-price algorithm for the vehicle-routing problem with time windows. The standard Dantzig-Wolfe decomposition of the arc flow formulation leads to a set-partitioning problem as the master problem and an elementary shortest-path problem with resource constraints as the pricing problem. We introduce the subset-row inequalities, which are Chvatal-Gomory rank-1 cuts based on a subset of the constraints in the master problem. Applying a subset-row inequality in the master problem increases the complexity of the label-setting algorithm used to solve the pricing problem because an additional resource is added for each inequality. We propose a modified dominance criterion that makes it possible to dominate more labels by exploiting the step-like structure of the objective function of the pricing problem. Computational experiments have been performed on the Solomon benchmarks where we were able to close several instances. The results show that applying subset-row inequalities in the master problem significantly improves the lower bound and, in many cases, makes it possible to prove optimality in the root node.