Robust optimization of dynamic route planning in same‐day delivery networks with one‐time observation of new demand

[1]  Michel Gendreau,et al.  Neighborhood Search Heuristics for a Dynamic Vehicle Dispatching Problem with Pick-ups and Deliveries , 2006 .

[2]  Chelsea C. White,et al.  Precedence constrained pickup and delivery with split loads , 2012 .

[3]  Alejandro Toriello,et al.  The One-Dimensional Dynamic Dispatch Waves Problem , 2016, Transp. Sci..

[4]  Leo G. Kroon,et al.  Crowdsourced Delivery - A Dynamic Pickup and Delivery Problem with Ad Hoc Drivers , 2016, Transp. Sci..

[5]  Temel Öncan,et al.  A comparative analysis of several asymmetric traveling salesman problem formulations , 2009, Comput. Oper. Res..

[6]  H. Psaraftis.  An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows , 1983 .

[7]  Iain Dunning,et al.  Computing in Operations Research Using Julia , 2013, INFORMS J. Comput..

[8]  Alejandro Toriello,et al.  The Dynamic Dispatch Waves Problem for same-day delivery , 2018, Eur. J. Oper. Res..

[9]  Martin W. P. Savelsbergh,et al.  50th Anniversary Invited Article - City Logistics: Challenges and Opportunities , 2016, Transp. Sci..

[10]  F. Ordóñez,et al.  A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty , 2008 .

[11]  Gilbert Laporte,et al.  STOCHASTIC VEHICLE ROUTING. , 1996 .

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

[13]  Gilbert Laporte,et al.  Dynamic pickup and delivery problems , 2010, Eur. J. Oper. Res..

[14]  Gilbert Laporte,et al.  Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints , 1991, Oper. Res. Lett..

[15]  Bruce L. Golden,et al.  Stochastic vehicle routing: A comprehensive approach , 1983 .

[16]  Hanif D. Sherali,et al.  On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems , 2002, Oper. Res..

[17]  Guanghui Sun,et al.  New Developments in Sliding Mode Control and Its Applications , 2014 .

[18]  Barrett W. Thomas,et al.  Same‐day delivery with heterogeneous fleets of drones and vehicles , 2018, Networks.

[19]  Luís Gouveia,et al.  The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints , 1999, Eur. J. Oper. Res..

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

[21]  André Langevin,et al.  A robust optimization approach for the road network daily maintenance routing problem with uncertain service time , 2016 .

[22]  Jean-François Cordeau,et al.  A Branch-and-Cut Algorithm for the Dial-a-Ride Problem , 2006, Oper. Res..

[23]  Bruce L. Golden,et al.  The vehicle routing problem with drones: several worst-case results , 2017, Optim. Lett..

[24]  Melvyn Sim,et al.  The Price of Robustness , 2004, Oper. Res..

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

[26]  Ming-Der May,et al.  On-Line Vehicle Routing with Time Windows: Optimization-Based Heuristics Approach for Freight Demands Requested in Real-Time , 1998 .

[27]  Gianpaolo Ghiani,et al.  Anticipatory algorithms for same-day courier dispatching , 2009 .