Planning approximations to the average length of vehicle routing problems with time window constraints
- 31 May 2009
- journal article
- Published by Elsevier BV in Transportation Research Part B: Methodological
- Vol. 43 (4), 438-447
- https://doi.org/10.1016/j.trb.2008.08.004
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- A model for the fleet sizing of demand responsive transportation services with time windowsTransportation Research Part B: Methodological, 2006
- Probabilistic Analysis of a Generalized Bin Packing Problem and ApplicationsOperations Research, 1997
- Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time WindowsOperations Research, 1996
- Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit DemandsOperations Research, 1992
- Operational estimators for the length of a traveling salesman tourComputers & Operations Research, 1992
- Modeling Distribution Problems with Time Windows. Part II: Two Customer TypesTransportation Science, 1987
- Modeling Distribution Problems with Time Windows: Part ITransportation Science, 1987
- The Distance Traveled to Visit N Points with a Maximum of C Stops per Vehicle: An Analytic Model and an ApplicationTransportation Science, 1984
- Expected Distances in Distribution ProblemsJournal of the Operational Research Society, 1969
- The shortest path through many pointsMathematical Proceedings of the Cambridge Philosophical Society, 1959