Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
- 1 November 2011
- journal article
- research article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 214 (3), 536-545
- https://doi.org/10.1016/j.ejor.2011.04.037
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- An exact algorithm for a vehicle routing problem with time windows and multiple use of vehiclesEuropean Journal of Operational Research, 2010
- A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictionsJournal of the Operational Research Society, 2008
- An exact algorithm for a single-vehicle routing problem with time windows and multiple routesEuropean Journal of Operational Research, 2007
- Metaheuristics for the vehicle routing problem with loading constraintsNetworks, 2007
- Chapter 6 Vehicle RoutingHandbooks in Operations Research and Management Science, 2006
- Vehicle Routing Problem with Time Windows, Part II: MetaheuristicsTransportation Science, 2005
- Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search AlgorithmsTransportation Science, 2005
- The multi-trip vehicle routing problemJournal of the Operational Research Society, 1998
- Scheduling of Vehicles from a Central Depot to a Number of Delivery PointsOperations Research, 1964
- The Truck Dispatching ProblemManagement Science, 1959