Pro-active real-time routing in applications with multiple request patterns

Recent research reveals that pro-active real-time routing approaches that use stochastic knowledge about future requests can significantly improve solution quality compared to approaches that simply integrate new requests upon arrival. Many of these approaches assume that request arrivals on different days follow an identical pattern. Thus, they define and apply a single profile of past request days to anticipate future request arrivals. In many real-world applications, however, different days may follow different patterns. Moreover, the pattern of the current day may not be known beforehand, and may need to be identified in real-time during the day. In such cases, applying approaches that use a single profile is not promising. In this paper, we propose a new pro-active real-time routing approach that applies multiple profiles. These profiles are generated by grouping together days with a similar pattern of request arrivals. For each combination of identified profiles, stochastic knowledge about future request arrivals is derived in an offline step. During the day, the approach repeatedly evaluates characteristics of request arrivals and selects a suitable combination of profiles. The performance of the new approach is evaluated in computational experiments in direct comparison with a previous approach that applies only a single profile. Computational results show that the proposed approach significantly outperforms the previous one. We analyze further potential for improvement by comparing the approach with an omniscient variant that knows the actual pattern in advance. Based on the results, managerial implications that allow for a practical application of the new approach are provided.

[1]  Russell Bent,et al.  Online Stochastic Optimization Without Distributions , 2005, ICAPS.

[2]  Stefan Bock,et al.  Production , Manufacturing and Logistics Real-time control of freight forwarder transportation networks by integrating multimodal transport chains , 2009 .

[3]  Russell Bent,et al.  The Value of Consensus in Online Stochastic Scheduling , 2004, ICAPS.

[4]  Gilbert Laporte,et al.  A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems , 2007 .

[5]  George M. Giaglis,et al.  Minimizing logistics risk through real‐time vehicle routing and mobile technologies: Research to date and future trends , 2004 .

[6]  Martin W. P. Savelsbergh,et al.  Drive: Dynamic Routing of Independent Vehicles , 1998, Oper. Res..

[7]  Sergei Vassilvitskii,et al.  k-means++: the advantages of careful seeding , 2007, SODA '07.

[8]  A. Parasuraman,et al.  A Conceptual Model of Service Quality and Its Implications for Future Research , 1985 .

[9]  Sven Oliver Krumke,et al.  Pruning in column generation for service vehicle dispatching , 2008, Ann. Oper. Res..

[10]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[11]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[12]  Russell Bent,et al.  Online stochastic combinatorial optimization , 2006 .

[13]  Jano I. van Hemert,et al.  Dynamic Routing Problems with Fruitful Regions: Models and Evolutionary Computation , 2004, PPSN.

[14]  Michel Gendreau,et al.  A pro-active real-time control approach for dynamic vehicle routing problems dealing with the delivery of urgent goods , 2013, Eur. J. Oper. Res..

[15]  Francesco Ferrucci Pro-active Dynamic Vehicle Routing: Real-Time Control and Request-Forecasting Approaches to Improve Customer Service , 2013 .

[16]  A. Parasuraman,et al.  The Behavioral Consequences of Service Quality , 1996 .

[17]  Joris van de Klundert,et al.  ASAP: The After-Salesman Problem , 2010, Manuf. Serv. Oper. Manag..

[18]  Russell Bent,et al.  Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers , 2004, Oper. Res..

[19]  Michel Gendreau,et al.  Diversion Issues in Real-Time Vehicle Dispatching , 2000, Transp. Sci..

[20]  J. MacQueen Some methods for classification and analysis of multivariate observations , 1967 .

[21]  Vinícius Amaral Armentano,et al.  Adaptive granular local search heuristic for a dynamic vehicle routing problem , 2009, Comput. Oper. Res..

[22]  Dimitris Bertsimas,et al.  Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles , 1993, Oper. Res..

[23]  Jens J. Dahlgaard,et al.  On measurement of customer satisfaction , 1992 .

[24]  Michael J. Maggard,et al.  An analysis of customer satisfaction with waiting times in a two-stage service process , 1990 .

[25]  Andreas Klose,et al.  On line Routing per Mobile Phone A Case on Subsequent Deliveries of Newspapers , 2009 .

[26]  Marius M. Solomon,et al.  Partially dynamic vehicle routing—models and algorithms , 2002, J. Oper. Res. Soc..

[27]  T. Moon Error Correction Coding: Mathematical Methods and Algorithms , 2005 .

[28]  Gilbert Laporte,et al.  Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic , 2006, Transp. Sci..

[29]  Roberto Musmanno,et al.  Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies , 2003, Eur. J. Oper. Res..

[30]  Gilbert Laporte,et al.  Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows , 2004 .

[31]  Michel Gendreau,et al.  Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching , 1999, Transp. Sci..

[32]  Michel Gendreau,et al.  A review of dynamic vehicle routing problems , 2013, Eur. J. Oper. Res..

[33]  Russell Bent,et al.  Waiting and Relocation Strategies in Online Stochastic Vehicle Routing , 2007, IJCAI.

[34]  Bruce L. Golden,et al.  The vehicle routing problem : latest advances and new challenges , 2008 .

[35]  Christos A. Kontovas,et al.  Dynamic vehicle routing problems: Three decades and counting , 2016, Networks.

[36]  Russell Bent,et al.  Regrets Only! Online Stochastic Optimization under Time Constraints , 2004, AAAI.

[37]  Burak Eksioglu,et al.  The vehicle routing problem: A taxonomic review , 2009, Comput. Ind. Eng..

[38]  Michel Gendreau,et al.  Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching , 2006, Transp. Sci..

[39]  Marius M. Solomon,et al.  Classification Of Dynamic Vehicle Routing Systems , 2007 .