Robust vehicle routing problem with deadlines and travel time/demand uncertainty
Authors:
- 1 September 2012
- journal article
- research article
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 63 (9) , 1294-1306
Abstract
No abstract availableKeywords
This publication has 34 references indexed in Scilit:
- Runtime reduction techniques for the probabilistic traveling salesman problem with deadlinesComputers & Operations Research, 2009
- Probabilistic Traveling Salesman Problem with DeadlinesTransportation Science, 2008
- Vehicle Routing Problem with elementary shortest path based column generationComputers & Operations Research, 2006
- Robust linear optimization under general normsOperations Research Letters, 2004
- The Price of RobustnessOperations Research, 2004
- A new hybrid genetic algorithm for the capacitated vehicle routing problemJournal of the Operational Research Society, 2003
- Robust discrete optimization and network flowsMathematical Programming, 2003
- Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow ProblemsOperations Research, 2000
- Branch-and-Price: Column Generation for Solving Huge Integer ProgramsOperations Research, 1998
- A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing UncertaintyOperations Research, 1996