A scenario decomposition algorithm for strategic time window assignment vehicle routing problems
Authors:
- Anirudh SubramanyamASAnirudh Subramanyam
- Akang WangAWAkang Wang
- Chrysanthos E. GounarisCGChrysanthos E. Gounaris
- 1 November 2018
- journal article
- research article
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 117, 296-317
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Science Foundation (CMMI-1434682)
This publication has 31 references indexed in Scilit:
- A template-based Tabu Search algorithm for the Consistent Vehicle Routing ProblemExpert Systems with Applications, 2012
- Planning approximations to the average length of vehicle routing problems with time window constraintsTransportation Research Part B: Methodological, 2009
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cutsMathematical Programming, 2007
- Path inequalities for the vehicle routing problem with time windowsNetworks, 2007
- Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing ProblemMathematical Programming, 2005
- A new branch-and-cut algorithm for the capacitated vehicle routing problemMathematical Programming, 2004
- Benchmarking optimization software with performance profilesMathematical Programming, 2002
- Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cutMathematical Programming, 2001
- Models and exact solutions for a class of stochastic location-routing problemsEuropean Journal of Operational Research, 1989
- The length of tours in zones of different shapesTransportation Research Part B: Methodological, 1984