A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration
- 6 April 2013
- journal article
- research article
- Published by Springer Science and Business Media LLC in 4OR
- Vol. 12 (3), 235-259
- https://doi.org/10.1007/s10288-013-0238-z
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial modelEuropean Journal of Operational Research, 2011
- A tutorial on column generation and branch-and-price for vehicle routing problems4OR, 2010
- An exact algorithm for a vehicle routing problem with time windows and multiple use of vehiclesEuropean Journal of Operational Research, 2010
- An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problemComputers & Operations Research, 2009
- An exact algorithm for a single-vehicle routing problem with time windows and multiple routesEuropean Journal of Operational Research, 2007
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problemsNetworks, 2004
- Branch-and-Price: Column Generation for Solving Huge Integer ProgramsOperations Research, 1998
- A New Optimization Algorithm for the Vehicle Routing Problem with Time WindowsOperations Research, 1992
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window ConstraintsOperations Research, 1987
- Complexity of Machine Scheduling ProblemsPublished by Elsevier BV ,1977