Lagrangean decomposition: A model yielding stronger lagrangean bounds
Mathematical Programming: Series A and B
Vehicle routing with time windows
Operations Research
Integer and combinatorial optimization
Integer and combinatorial optimization
A new optimization algorithm for the vehicle routing problem with time windows
Operations Research
Modern heuristic techniques for combinatorial problems
The precedence-constrained asymmetric traveling salesman polytope
Mathematical Programming: Series A and B
A new approach to the minimum cut problem
Journal of the ACM (JACM)
Integer Programming Formulation of Traveling Salesman Problems
Journal of the ACM (JACM)
Software—Practice & Experience - Special issue on discrete algorithm engineering
The vehicle routing problem
Branch-and-bound algorithms for the capacitated VRP
The vehicle routing problem
Branch-and-cut algorithms for the capacitated VRP
The vehicle routing problem
Set-covering-based algorithms for the capacitated VRP
The vehicle routing problem
The vehicle routing problem
The vehicle routing problem
The vehicle routing problem
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
2-Path Cuts for the Vehicle Routing Problem with Time Windows
Transportation Science
A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
Transportation Science
A computational study of vehicle routing applications
A computational study of vehicle routing applications
Lagrangian duality applied to the vehicle routing problem with time windows
Computers and Operations Research
Vehicle routing problem with elementary shortest path based column generation
Computers and Operations Research
The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
INFORMS Journal on Computing
Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints
Operations Research Letters
A local search heuristic for the pre- and end-haulage of intermodal container terminals
Computers and Operations Research
The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem
Applied Soft Computing
Localized genetic algorithm for vehicle routing problem with time windows
Applied Soft Computing
Layered formulation for the robust vehicle routing problem with time windows
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
The Pickup and Delivery Problem with Cross-Docking
Computers and Operations Research
Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows
Transportation Science
Survey of Green Vehicle Routing Problem: Past and future trends
Expert Systems with Applications: An International Journal
Journal of Computational and Applied Mathematics
A bi-objective vehicle routing problem with time windows: A real case in Tenerife
Applied Soft Computing
| Hi-index | 0.01 |
In this paper we review the exact algorithms proposed in the last three decades for the solution of the vehicle routing problem with time windows (VRPTW). The exact algorithms for the VRPTW are in many aspects inherited from work on the traveling salesman problem (TSP). In recognition of this fact this paper is structured relative to four seminal papers concerning the formulation and exact solution of the TSP, i.e. the arc formulation, the arc-node formulation, the spanning tree formulation, and the path formulation. We give a detailed analysis of the formulations of the VRPTW and a review of the literature related to the different formulations. There are two main lines of development in relation to the exact algorithms for the VRPTW. One is concerned with the general decomposition approach and the solution to certain dual problems associated with the VRPTW. Another more recent direction is concerned with the analysis of the polyhedral structure of the VRPTW. We conclude by examining possible future lines of research in the area of the VRPTW.