Practical Approximations to Quantify the Impact of Time Windows and Delivery Sizes on Freight VMT in Urban Areas

[1]  Miguel A. Figliozzi.  Modeling Impact of Technological Changes on Urban Commercial Trips by Commercial Activity Routing Type , 2006 .

[2]  Miguel A. Figliozzi,et al.  Planning Approximations to the Average Length of Vehicle Routing Problems with Varying Customer Demands and Routing Constraints , 2008 .

[3]  David Simchi-Levi,et al.  Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands , 1992, Oper. Res..

[4]  M. H. J. Webb,et al.  Cost Functions in the Location of Depots for Multiple-Delivery Journeys , 1968 .

[5]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[6]  Bruce L. Golden,et al.  Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks , 1995, Comput. Oper. Res..

[7]  José Holguín-Veras,et al.  Observed Trip Chain Behavior of Commercial Vehicles , 2005 .

[8]  Carlos F. Daganzo,et al.  The Distance Traveled to Visit N Points with a Maximum of C Stops per Vehicle: An Analytic Model and an Application , 1984, Transp. Sci..

[9]  Miguel A. Figliozzi,et al.  Modeling Impact of Technological Changes on Urban Commercial Trips by Commercial Activity Routing Type , 2006 .

[10]  Awi Federgruen,et al.  Probabilistic Analysis of a Generalized Bin Packing Problem and Applications , 1997, Oper. Res..

[11]  Patrick Jaillet,et al.  A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited , 1988, Oper. Res..

[12]  Nan Xia,et al.  A model for the fleet sizing of demand responsive transportation services with time windows , 2006 .

[13]  David Simchi-Levi,et al.  Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows , 1996, Oper. Res..

[14]  Miguel A. Figliozzi,et al.  Analysis of the efficiency of urban commercial vehicle tours: Data collection, methodology, and policy implications , 2007 .

[15]  Miguel A. Figliozzi,et al.  An iterative route construction and improvement algorithm for the vehicle routing problem with soft time windows , 2010 .

[16]  T. William Chien,et al.  Operational estimators for the length of a traveling salesman tour , 1992, Comput. Oper. Res..

[17]  Carlos F. Daganzo.  Modeling Distribution Problems with Time Windows. Part II: Two Customer Types , 1987, Transp. Sci..

[18]  J. Beardwood,et al.  The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.

[19]  Nicos Christofides,et al.  EXPECTED DISTANCES IN DISTRIBUTION PROBLEMS , 1969 .

[20]  Miguel A. Figliozzi,et al.  Analysis of Freight Tours in a Congested Urban Area Using Disaggregated Data: Characteristics and Data Collection Challenges , 2007 .

[21]  Carlos F. Daganzo,et al.  Modeling Distribution Problems with Time Windows: Part I , 1987, Transp. Sci..

[22]  David M. Stein,et al.  An Asymptotic, Probabilistic Analysis of a Routing Problem , 1978, Math. Oper. Res..

[23]  Francesc Robusté,et al.  Formulas for Estimating Average Distance Traveled in Vehicle Routing Problems in Elliptic Zones , 2004 .

[24]  Miguel A. Figliozzi,et al.  An Iterative Route Construction and Improvement Algorithm for the Vehicle Routing Problem with Soft and Hard Time Windows , 2008 .

[25]  Carlos F. Daganzo.  MODELING DISTRIBUTION PROBLEMS WITH TIME WINDOWS , 1985 .

[26]  H. Ong,et al.  Asymptotic expected performance of some TSP heuristics: An empirical evaluation , 1989 .

[27]  Richard C. Larson,et al.  Urban Operations Research , 1981 .

[28]  Nicos Christofides,et al.  Distribution management : mathematical modelling and practical analysis , 1971 .

[29]  Alan L. Erera,et al.  DESIGN OF LARGE-SCALE LOGISTICS SYSTEMS FOR UNCERTAIN ENVIRONMENTS , 2001 .