A reactive MILP approach to the multidepot heterogeneous fleet vehicle routing problem with time windows
Authors:
- Rodolfo DondoRDRodolfo Dondo
- Jaime CerdáJCJaime Cerdá
- 1 September 2006
- journal article
- Published by Wiley in International Transactions in Operational Research
- Vol. 13 (5) , 441-459
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Vehicle Routing with Time Windows: Two Optimization AlgorithmsOperations Research, 1997
- Optimal Solution of Vehicle Routing Problems Using Minimum K-TreesOperations Research, 1994
- The vehicle routing problem: An overview of exact and approximate algorithmsEuropean Journal of Operational Research, 1992
- A New Optimization Algorithm for the Vehicle Routing Problem with Time WindowsOperations Research, 1992
- A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean PlaneOperations Research, 1991
- Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time WindowsManagement Science, 1988
- Vehicle Routing with Time WindowsOperations Research, 1987
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window ConstraintsOperations Research, 1987
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxationsMathematical Programming, 1981
- A Heuristic Algorithm for the Vehicle-Dispatch ProblemOperations Research, 1974