Incorporating Intuition in Last-Mile Routing

In last-mile routing, the optimization is often framed as a Traveling Salesman Problem to minimize travel time and associated cost. However, solutions stemming from this approach do not match the realized paths as drivers deviate due to navigational considerations and preferences. To prescribe routes that incorporate this tacit knowledge, a data-driven model is proposed that aligns well with the hierarchical structure of delivery data wherein each stop belongs to a zone—a geographical area. First, on the global level, a zone sequence is found as a result of a minimization over a cost matrix which balances historical information and distances between zones. Second, within zones, a sequence of stops is determined, such that integrated with the predetermined zone sequence a full solution is obtained. The methodology allows for several enrichments, such as replacing distances by travel times, different cost structures, and intuition while traversing from one zone to another ensuring a seamless connection. These directions are particularly promising as they propel the approach in the top-tier of submissions to the Last-Mile Routing Research Challenge while maintaining the elegant decomposition that ensures a feasible implementation into practice. From a cognitive perspective, the concurrence between prescribed and realized routes reveals that delivery drivers adopt a hierarchical breakdown of the full problem combining intuition and locally optimal decisions when navigating. Furthermore, experimenting with the trade-off between historical information and travel times exposes that drivers rely more on their intuition at the start, whereas at the end, when returning to the station, only travel time is the concern.

[1]  N. Biggs THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[2]  Kenneth K. Boyer,et al.  THE LAST MILE CHALLENGE: EVALUATING THE EFFECTS OF CUSTOMER DENSITY AND DELIVERY WINDOW PATTERNS , 2009 .

[3]  T. Ormerod,et al.  Human performance on the traveling salesman problem , 1996, Perception & psychophysics.

[4]  Anirban Saha,et al.  Study and Analysis of Various Heuristic Algorithms for Solving Travelling Salesman Problem—A Survey , 2020 .

[5]  I. Rooij,et al.  Convex hull and tour crossings in the Euclidean traveling salesperson problem: Implications for human performance studies , 2003, Memory & cognition.

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

[7]  E. Voorde,et al.  Characteristics and Typology of Last-mile Logistics from an Innovation Perspective in an Urban Context , 2011 .

[8]  M. Winkenbach,et al.  Characterizing urban last-mile distribution strategies in mature and emerging e-commerce markets , 2020 .

[9]  Douglas Vickers,et al.  Human Performance on Visually Presented Traveling Salesperson Problems with Varying Numbers of Nodes , 2006, J. Probl. Solving.

[10]  Pasi Fränti,et al.  Planning Your Route: Where to Start? , 2018, Computational brain & behavior.

[11]  J. F. Pierce,et al.  ON THE TRUCK DISPATCHING PROBLEM , 1971 .

[12]  Colin Tudge,et al.  Planet , 1999 .

[13]  Gregory Gutin,et al.  The traveling salesman problem , 2006, Discret. Optim..

[14]  David Simchi-Levi,et al.  OM Forum - OM Research: From Problem-Driven to Data-Driven Research , 2014, Manuf. Serv. Oper. Manag..

[15]  Nils Boysen,et al.  Last-mile delivery concepts: a survey from an operational research perspective , 2020, OR Spectr..

[16]  Sunil Chopra,et al.  Designing the distribution network in a supply chain , 2003 .

[17]  Robin Lougee,et al.  The Common Optimization INterface for Operations Research: Promoting open-source software in the operations research community , 2003, IBM J. Res. Dev..

[18]  Daniele Vigo,et al.  Heuristics for the traveling salesman problem with pickup and delivery , 1999, Comput. Oper. Res..

[19]  Thierry Vanelslander,et al.  Cost modelling and simulation of last-mile characteristics in an innovative B2C supply chain environment with implications on urban areas and cities , 2014 .

[20]  Tias Guns,et al.  Vehicle Routing by Learning from Historical Solutions , 2019, BNAIC/BENELEARN.

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

[22]  Michel Gendreau,et al.  A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows , 1998, Oper. Res..

[23]  A. Joshi,et al.  The traveling salesman problem: A hierarchical model , 2000, Memory & cognition.

[24]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[25]  Carlos Obreque,et al.  Accelerating the Miller-Tucker-Zemlin model for the asymmetric traveling salesman problem , 2020, Expert Syst. Appl..

[26]  Richard M. Karp,et al.  Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane , 1977, Math. Oper. Res..

[27]  M. Lee,et al.  The roles of the convex hull and the number of potential intersections in performance on visually presented traveling salesperson problems , 2003, Memory & cognition.

[28]  John Krumm,et al.  A Markov Model for Driver Turn Prediction , 2008 .

[29]  Changan Liu,et al.  A Hierarchical Algorithm Based on Density Peaks Clustering and Ant Colony Optimization for Traveling Salesman Problem , 2018, IEEE Access.

[30]  Yll Haxhimusa,et al.  Traveling Salesman Problem: A Foveating Pyramid Model , 2006, J. Probl. Solving.

[31]  Jairo R. Montoya-Torres,et al.  A literature review on the vehicle routing problem with multiple , 2014 .

[32]  Sai Ho Chung,et al.  Survey of Green Vehicle Routing Problem: Past and future trends , 2014, Expert Syst. Appl..

[33]  Hanspeter A. Mallot,et al.  'Fine-to-Coarse' Route Planning and Navigation in Regionalized Environments , 2003, Spatial Cogn. Comput..

[34]  Reza Malekian,et al.  A method for driving route predictions based on hidden Markov model , 2015 .

[35]  Yuan Ma,et al.  Building Efficient Probability Transition Matrix Using Machine Learning from Big Data for Personalized Route Prediction , 2015, INNS Conference on Big Data.

[36]  Iain Dunning,et al.  PuLP : A Linear Programming Toolkit for Python , 2011 .

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

[38]  H. A. Mallot,et al.  Planning paths to multiple targets: memory involvement and planning heuristics in spatial problem solving , 2009, Psychological research.

[39]  Eiichi Taniguchi,et al.  Modeling City Logistics , 2002 .

[40]  Maria Grazia Speranza,et al.  A survey on matheuristics for routing problems , 2014, EURO J. Comput. Optim..

[41]  H. P. Williams,et al.  A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem , 2007 .

[42]  John R. Current,et al.  The Covering Salesman Problem , 1989, Transp. Sci..

[43]  R. Goodman Whatever you call it, just don't think of last-mile logistics, last , 2005 .

[44]  Christos H. Papadimitriou,et al.  The Euclidean Traveling Salesman Problem is NP-Complete , 1977, Theor. Comput. Sci..

[45]  A. Gunasekaran,et al.  A framework for supply chain performance measurement , 2004 .

[46]  Chunguo Wu,et al.  Hierarchical Solving Method for Large Scale TSP Problems , 2014, ISNN.