Planning Approximations to the Average Length of Vehicle Routing Problems with Varying Customer Demands and Routing Constraints

This paper studies approximations to the average length of vehicle routing problems (VRPs). The approximations are valuable for strategic and planning analysis of transportation and logistics problems. The focus is on VRPs with varying numbers of customers, demands, and locations. This modeling environment can be used in transport and logistics models that deal with a distribution center serving an area with daily variations in demand. The routes are calculated daily on the basis of what freight is available. New approximations and experimental settings are introduced. Average distance traveled is estimated as a function of the number of customers served and the number of routes needed. Approximations are tested in instances with different customer spatial distributions, demand levels, numbers of customers, and time windows. Regression results indicate that the proposed approximations can reasonably predict the average length of VRPs in randomly generated problems and real urban networks.

[1]  Miguel A. Figliozzi,et al.  Impacts of Congestion on Commercial Vehicle Tour Characteristics and Costs , 2010 .

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

[3]  Abraham P. Punnen,et al.  The traveling salesman problem and its variations , 2007 .

[4]  Brian Kallehauge,et al.  The Vehicle Routing Problem with Time Windows , 2006, Vehicle Routing.

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

[6]  BräysyOlli,et al.  Vehicle Routing Problem with Time Windows, Part II , 2005 .

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

[8]  Vladimir Vacic,et al.  VEHICLE ROUTING PROBLEM WITH TIME WINDOWS , 2014 .

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

[10]  M. Figliozzi.  The Impacts of Congestion on Commercial Vehicle Tours Characteristics and Costs , 2008 .

[11]  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..

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

[13]  Miguel Ángel Estrada Romeu,et al.  Formulas for Estimating Average Distance Traveled in Vehicle Routing Problems in Elliptic Zones , 2004 .

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

[15]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part II: Metaheuristics , 2005, Transp. Sci..

[16]  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..

[17]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

[18]  P. J. Clark,et al.  Distance to Nearest Neighbor as a Measure of Spatial Relationships in Populations , 1954 .

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

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

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

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

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

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

[25]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms , 2005, Transp. Sci..

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

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

[28]  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..