An empirical validation and data-driven extension of continuum approximation approaches for urban route distances
Corresponding Author
Daniel Merchán
Center for Transportation and Logistics, Massachusetts Institute of Technology, Cambridge, Massachusetts
Correspondence
Daniel Merchán, Center for Transportation and Logistics, Massachusetts Institute of Technology, 77 Massachusetts Avenue E40 Floor 2, Cambridge, MA 02139.
Email: [email protected]
Search for more papers by this authorMatthias Winkenbach
Center for Transportation and Logistics, Massachusetts Institute of Technology, Cambridge, Massachusetts
Search for more papers by this authorCorresponding Author
Daniel Merchán
Center for Transportation and Logistics, Massachusetts Institute of Technology, Cambridge, Massachusetts
Correspondence
Daniel Merchán, Center for Transportation and Logistics, Massachusetts Institute of Technology, 77 Massachusetts Avenue E40 Floor 2, Cambridge, MA 02139.
Email: [email protected]
Search for more papers by this authorMatthias Winkenbach
Center for Transportation and Logistics, Massachusetts Institute of Technology, Cambridge, Massachusetts
Search for more papers by this authorAbstract
We introduce a data-driven extension to continuum approximation (CA)-based methods used to predict urban route distances. This extension efficiently incorporates the circuity of the underlying road network into the approximation method to improve distance predictions in more realistic settings. The proposed extension significantly outperforms traditional methods, which build on the assumption of travel according to the rectilinear distance metric. While only marginally increasing the data collection effort, the proposed extension yields reductions of 26 percent points in mean absolute percentage error compared to traditional approximation methods. The obtained distance estimates are within 5%-15% of near-optimal solutions obtained with a large neighborhood search heuristic, depending on the circuity of the region and the density of stops. Further, by providing a real-world validation of CA methods, we explore how novel sources of geo-spatial and traffic-related data can be efficiently leveraged to improve the predictive performance of CA methods. The proposed extension is particularly relevant to increase the real-world validity of CA methods applied to large-scale optimization problems in logistics system design and planning within urban areas.
REFERENCES
- 1N. Agatz, A. Campbell, M. Fleischmann, and M. Savelsbergh, Time slot management in attended home delivery, Transp. Sci. 45 (2011), 435–449.
- 2S. Ansari, M. Başdere, X. Li, Y. Ouyang, and K. Smilowitz, Advancements in continuous approximation models for logistics and transportation systems: 1996–2016, Transp. Res. B 107 (2018), 229–252.
- 3R.H. Ballou, H. Rahardja, and N. Sakai, Selected country circuity factors for road travel distance estimation, Transp. Res. A 36 (2002), 843–848.
- 4M. Barthélemy, Spatial networks, Phys. Rep. 499 (2011), 1–101.
- 5J. Beardwood, J.H. Halton, and J.M. Hammersley, The shortest path through many points, Math. Proc. Camb. Philos. Soc. 55 (1959), 299–327.
10.1017/S0305004100034095 Google Scholar
- 6G. Boeing, OSMnx: New methods for acquiring, constructing, analyzing, and visualizing complex street networks, Comput. Environ. Urban Syst. 65 (2017), 126–139.
- 7K. Braekers, K. Ramaekers, and I. Van Nieuwenhuyse, The vehicle routing problem: State of the art classification and review, Comput. Ind. Eng. 99 (2016), 300–313.
- 8L. Breiman, Random forests, Mach. Learn. 45 (2001), 5–32.
- 9E.A. Bright, P.R. Coleman, A.N. Rose, and M.L. Urban, LandScan, Oak Ridge National Laboratory, Oak Ridge, TN, 2015 http://www.ornl.gov/landscan/.
- 10J.F. Campbell, Comments on: Continuous approximation models in freight distribution management, Top 25 (2017), 434–437.
- 11T.W. Chien, Operational estimators for the length of a traveling salesman tour, Comput. Oper. Res. 19 (1992), 469–478.
- 12G. Clarke and J.W. Wright, Scheduling of vehicles from a central depot to a number of delivery points, Oper. Res. 12 (1964), 568–581.
- 13C.F. Daganzo, The distance traveled to visit N points with a maximum of C stops per vehicle: An analytic model and an application, Transp. Sci. 18 (1984), 331–350.
- 14C.F. Daganzo, The length of tours in zones of different shapes, Transp. Res. B 18 (1984), 135–145.
- 15C.F. Daganzo, Logistics Systems Analysis, Springer-Verlag Berlin Heidelberg, New York, 2005.
- 16S. Eilon, C.D.T. Watson-Gandy, and N. Christofides, Distribution Management: Mathematical Modelling and Practical Analysis, Hafner, New York, 1971.
- 17M. Figliozzi, Planning approximations to the average length of vehicle routing problems with varying customer demands and routing constraints, Transp. Res. Rec 2089 (2008), 1–8.
10.3141/2089-01 Google Scholar
- 18M. Figliozzi, Planning approximations to the average length of vehicle routing problems with time window constraints, Transp. Res. B 43 (2009), 438–447.
- 19A. Franceschetti, O. Jabali, and G. Laporte, Continuous approximation models in freight distribution management, Top 25 (2017), 413–433.
- 20M. Gendreau and J.Y. Potvin, Handbook of Metaheuristics, vol. 157, 2nd edn, Springer, New York, 2010.
- 21D.J. Giacomin and D.M. Levinson, Road network circuity in metropolitan areas, Environ. Plann. B: Plann. Des. 42 (2015), 1040–1053.
10.1068/b130131p Google Scholar
- 22B.E. Gillett and L.R. Miller, A heuristic algorithm for the vehicle-dispatch problem, Oper. Res. 22 (1974), 340–349.
- 23 Google, 2017. Google Distance Matrix API, Mountain View. https://developers.google.com/maps/documentation/distance-matrix/.
- 24 Google, 2017. Google Optimization Tools. https://developers.google.com/optimization/Mountain View.
- 25M. Haimovich and A.H.G. Rinnooy Kan, Bounds and heuristics for capacitated routing problems, Math. Oper. Res. 10 (1985), 527–542.
- 26T. Hastie, R. Tibshirani, and J. Friedman, The Elements of Statistical Learning, 2nd edn, Springer, New York, 2009.
10.1007/978-0-387-84858-7 Google Scholar
- 27 M. Joerss, J. Schröder, F. Neuhaus, C. Klink, and F. Mann, Parcel Delivery: The Future of Last Mile, McKinsey & Company, New York, 2016.
- 28O. Kwon, B. Golden, and E. Wasil, Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks, Comput. Oper. Res. 22 (1995), 1039–1046.
- 29A. Langevin, P. Mbaraga, and J.F. Campbell, Continuous approximation models in freight distribution: An overview, Transp. Res. B 30 (1996), 163–188.
- 30R.C. Larson and V.O.K. Li, Finding minimum rectilinear distance paths in the presence of barriers, Networks 11 (1981), 285–304.
- 31R.C. Larson and A. Odoni, Urban Operations Research, 1st edn, Prentice Hall, Upper Saddle River, NJ, 1981.
- 32A.M. Law and D. Kelton, Simulation Modeling and Analysis, 3rd edn, McGraw-Hill, New York, 2000.
- 33D. Levinson and A. El-Geneidy, The minimum circuity frontier and the journey to work, Region. Sci. Urban Econ. 39 (2009), 732–738.
- 34R.F. Love and J.G. Morris, Mathematical models of road travel distances, Manage. Sci. 25 (1979), 130–139.
- 35D. Merchán and M. Winkenbach, Quantifying the impact of urban road networks on the efficiency of local trips, SCALE Work. Pap. Ser., pp. 1–24 (2018).
- 36J.R. Montoya-Torres, J. López Franco, S. Nieto Isaza, H. Felizzola Jiménez, and N. Herazo-Padilla, A literature review on the vehicle routing problem with multiple depots, Comput. Ind. Eng. 79 (2015), 115–129.
- 37G.F. Newell, Traffic Flow on Transportation Networks, The MIT Press, Cambridge, MA, 1980.
- 38G.F. Newell and C.F. Daganzo, Design of multiple vehicle delivery tours – II: Other metrics, Transp. Res. B 20 (1986), 365–376.
- 39G.F. Newell and C.F. Daganzo, Design of multiple-vehicle delivery tours – I: A ring-radial network, Transp. Res. B 20 (1986), 345–363.
- 40D. Nicola, R. Vetschera, and A. Dragomir, Total distance approximations for routing solutions, Comput. Oper. Res. 102 (2019), 67–74.
- 41F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, et al., Scikit-learn: Machine learning in python, J. Mach. Learn. Res. 12 (2012), 2825–2830.
- 42L. Perron, “ Operations research and constraint programming at Google,” Principles and Practice of Constraint Programming – CP 2011, J. Lee (ed.), Springer, Berlin, Heidelberg, 2011.
10.1007/978-3-642-23786-7_2 Google Scholar
- 43D. Pisinger and S. Ropke, “ Large neighborhood search,” Handbook of Metaheuristics, 2nd edn, M. Gendreau and J.Y. Potvin (eds), Springer, New York, 2010, pp. 399–420.
- 44
M. Poggi and E. Uchoa, “ New exact algorithms for the capacitated vehicle routing problem,” Vehicle Routing Problems, Methods and Applications, 2nd edn, P. Toth and D. Vigo (eds), 2014, Industrial and Applied Mathematics, Philadelphia. pp. 59–86.
10.1137/1.9781611973594.ch3 Google Scholar
- 45F. Robusté, C.F. Daganzo, and R.R. Souleyrette, Implementing vehicle routing models, Transp. Res. B 24 (1990), 263–286.
- 46P.J. Rousseeuw, Silhouettes: A graphical aid to the interpretation and validation of cluster analysis, J. Comput. Appl. Math. 20(C) (1987), 53–65.
- 47P. Shaw, “ Using constraint programming and local search methods to solve vehicle routing problems,” Principles and Practice of Constraint Programming CP98. Lecture Notes in Computer Science, vol. 1520, M. Maher and J.F. Puget (eds), Springer, Berlin, Heidelberg, 1998, pp. 417–431.
10.1007/3-540-49481-2_30 Google Scholar
- 48K. Smilowitz, Comments on: Continuous approximation models in freight distribution management, Top 25 (2017), 440–442.
- 49K. Smilowitz and C.F. Daganzo, Continuum approximation techniques for the design of integrated package distribution systems, Networks 50 (2007), 183–196.
- 50D.M. Stein, An asymptotic, probabilistic analysis of a routing problem, Math. Oper. Res. 3 (1978), 89–102.
10.1287/moor.3.2.89 Google Scholar
- 51S. Steinerberger, New bounds for the traveling salesman constant, Adv. Appl. Probab. 47 (2015), 27–36.
- 52 The OpenStreetMap Foundation, 2017. OpenStreetMap. The OpenStreetMap Foundation, Cambridge. http://www.openstreetmap.org/.
- 53
P. Toth and D. Vigo (eds), Vehicle Routing Problems, Methods and Applications, 2nd edn, Society for Industrial and Applied Mathematics, Mathematical Optimization Society, Philadelphia, 2014.
10.1137/1.9781611973594 Google Scholar
- 54 United Nations Population Division, World Urbanization Prospects, the 2014 Revision, United Nations, New York, 2014.
- 55C.L. Valenzuela and A.J. Jones, Estimating the Held-Karp lower-bound for the geometric TSP, Eur. J. Oper. Res. 102 (1997), 157–175.
- 56M. Winkenbach, P.R. Kleindorfer, and S. Spinler, Enabling urban logistics services at La Poste through multi-echelon location-routing, Transp. Sci. 50 (2016), 520–540.