On-Time Last-Mile Delivery: Order Assignment with Travel-Time Predictors

Published Online:https://doi.org/10.1287/mnsc.2020.3741

References

  • Ahipaşaoğlu SD , Arıkan U , Natarajan K (2016) On the flexibility of using marginal distribution choice models in traffic equilibrium. Transportation Res. Part B: Methodological 91:130–158.CrossrefGoogle Scholar
  • Ahipaşaoğlu SD , Meskarian R , Magnanti TL , Natarajan K (2015) Beyond normality: A cross moment-stochastic user equilibrium model. Transportation Res. Part B: Methodological 81(2):333–354.CrossrefGoogle Scholar
  • Anderson R , Huchette J , Ma W , Tjandraatmadja C , Vielma JP (2020) Strong mixed-integer programming formulations for trained neural networks. Math. Programming 183:3–39.CrossrefGoogle Scholar
  • Angalakudati M , Balwani S , Calzada J , Chatterjee B , Perakis G , Raad N , Uichanco J (2014) Business analytics for flexible resource allocation under random emergencies. Management Sci. 60(6):1552–1573.LinkGoogle Scholar
  • Baidu Map (2019) Routematrix api. Accessed August 22, 2018, http://lbsyun.baidu.com/index.php?title=webapi/route-matrix-api-v2.Google Scholar
  • Ban G-Y , Rudin C (2019) The big data newsvendor: Practical insights from machine learning. Oper. Res. 67(1):90–108.LinkGoogle Scholar
  • Barnhart C , Johnson EL , Nemhauser GL , Savelsbergh MWP , Vance PH (1998) Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46(3):316–329.LinkGoogle Scholar
  • Beardwood J , Halton JH , Hammersley JM (1959) The shortest path through many points. Mathematical Proceedings of the Cambridge Philosophical Society, vol. 55 (Cambridge University Press, Cambridge, UK), 299–327.Google Scholar
  • Belavina E , Girotra K , Kabra A (2016) Online grocery retail: Revenue models and environmental impact. Management Sci. 63(6):1781–1799.LinkGoogle Scholar
  • Bertsimas D , Dunn J (2017) Optimal classification trees. Machine Learn . 106(7):1039–1082.CrossrefGoogle Scholar
  • Bertsimas D , Mišic VV (2015) Data-driven assortment optimization. Working paper, Sloan School of Management, Massachusetts Institute of Technology, Cambridge.Google Scholar
  • Bertsimas DJ , Van Ryzin G (1991) A stochastic and dynamic vehicle routing problem in the Euclidean plane. Oper. Res. 39(4):601–615.LinkGoogle Scholar
  • Bertsimas DJ , Van Ryzin G (1993) Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles. Oper. Res. 41(1):60–76.LinkGoogle Scholar
  • Bien J , Tibshirani R (2011) Hierarchical clustering with prototypes via minimax linkage. J. Amer. Statist. Assoc. 106(495):1075–1084.CrossrefGoogle Scholar
  • Biggs M , Hariss R (2018) Optimizing objective functions determined from random forests. Working paper, Darden School of Business at the University of Virginia, Charlottesville.Google Scholar
  • Campbell AA , Cherry CR , Ryerson MS , Yang X (2016) Factors influencing the choice of shared bicycles and shared electric bikes in Beijing. Transportation Res. Part C: Emerging Tech. 67:399–414.CrossrefGoogle Scholar
  • Campbell AM , Thomas BW (2008) Probabilistic traveling salesman problem with deadlines. Transportation Sci. 42(1):1–21.LinkGoogle Scholar
  • Carlsson JG (2012) Dividing a territory among several vehicles. INFORMS J. Comput. 24(4):565–577.LinkGoogle Scholar
  • Carlsson JG , Delage E (2013) Robust partitioning for stochastic multivehicle routing. Oper. Res. 61(3):727–744.LinkGoogle Scholar
  • Carlsson JG , Behroozi M , Mihic K (2018) Wasserstein distance and the distributionally robust TSP. Oper. Res. 66(6):1603–1624.LinkGoogle Scholar
  • Çavdar B , Sokol J (2015) A distribution-free TSP tour length estimation model for random graphs. Eur. J. Oper. Res. 243(2):588–598.CrossrefGoogle Scholar
  • Chien TW (1992) Operational estimators for the length of a traveling salesman tour. Comput. Oper. Res. 19(6):469–478.CrossrefGoogle Scholar
  • Daganzo CF (2005) Logistics Systems Analysis (Springer Science & Business Media, Berlin).Google Scholar
  • Delage E , Ye Y (2010) Distributionally robust optimization under moment uncertainty with application to data-driven problems. Oper. Res. 58(3):595–612.LinkGoogle Scholar
  • Elmachtoub AN , Grigas P (2017) Smart “predict, then optimize.” Working paper, Department of Industrial Engineering and Operations Research, Columbia University, New York.Google Scholar
  • Erera AL , Morales JC , Savelsbergh M (2010) The vehicle routing problem with stochastic demand and duration constraints. Transportation Sci. 44(4):474–492.LinkGoogle Scholar
  • Farias VF , Jagabathula S , Shah D (2013) A nonparametric approach to modeling choice with limited data. Management Sci. 59(2):305–322.LinkGoogle Scholar
  • Ferreira KJ , Bin HAL , Simchi-Levi D (2015) Analytics for an online retailer: Demand forecasting and price optimization. Manufacturing Service Oper. Management 18(1):69–88.LinkGoogle Scholar
  • Fischetti M , Jo J (2018) Deep neural networks and mixed integer linear optimization. Constraints 23(3):296–309.CrossrefGoogle Scholar
  • Friedman J , Hastie T , Tibshirani R (2001) The Elements of Statistical Learning , vol. 1, Springer Series in Statistics (Springer, Berlin).Google Scholar
  • Fukasawa R , Longo H , Lysgaard J , Poggi de Aragão M , Reis M , Uchoa E , Werneck RF (2006) Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Programming 106(3):491–511.CrossrefGoogle Scholar
  • Gademann N , Velde S (2005) Order batching to minimize total travel time in a parallel-aisle warehouse. IIE Trans. 37(1):63–75.CrossrefGoogle Scholar
  • Gendreau M , Laporte G , Séguin R (1996) Stochastic vehicle routing. Eur. J. Oper. Res. 88(1):3–12.CrossrefGoogle Scholar
  • Glover F (1975) Improved linear integer programming formulations of nonlinear integer problems. Management Sci. 22(4):455–460.LinkGoogle Scholar
  • He L , Hu Z , Zhang M (2020) Robust repositioning for vehicle sharing. Manufacturing Service Oper. Management 22(2):241–256.LinkGoogle Scholar
  • Hekimoğlu MH , Kazaz B , Webster S (2016) Wine analytics: Fine wine pricing and selection under weather and market uncertainty. Manufacturing Service Oper. Management 19(2):202–215.LinkGoogle Scholar
  • Hoeffding W (1948) A non-parametric test of independence. Ann. Math. Statist. 19(4):546–557.CrossrefGoogle Scholar
  • Holland C , Levis J , Nuggehalli R , Santilli B , Winters J (2017) UPS optimizes delivery routes. Interfaces 47(1):8–23.LinkGoogle Scholar
  • Jaillet P , Qi J , Sim M (2016) Routing optimization under uncertainty. Oper. Res. 64(1):186–200.LinkGoogle Scholar
  • Jónasson JO , Deo S , Gallien J (2017) Improving HIV early infant diagnosis supply chains in Sub-Saharan Africa: Models and application to Mozambique. Oper. Res. 65(6):1479–1493.LinkGoogle Scholar
  • Klapp MA , Erera AL , Toriello A (2016) The one-dimensional dynamic dispatch waves problem. Transportation Sci. 52(2):402–415.LinkGoogle Scholar
  • Kleywegt AJ , Shapiro A , Homem-de Mello T (2002) The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2):479–502.CrossrefGoogle Scholar
  • Kong N , Schaefer AJ , Hunsaker B , Roberts MS (2010) Maximizing the efficiency of the US liver allocation system through region design. Management Sci. 56(12):2111–2122.LinkGoogle Scholar
  • Kwon O , Golden B , Wasil E (1995) Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks. Comput. Oper. Res. 22(10):1039–1046.CrossrefGoogle Scholar
  • Langford BC , Chen J , Cherry CR (2015) Risky riding: Naturalistic methods comparing safety behavior from conventional bicycle riders and electric bike riders. Accident Anal. Prevention 82:220–226.CrossrefGoogle Scholar
  • Laporte G (2007) What you should know about the vehicle routing problem. Naval Res. Logist. 54(8):811–819.CrossrefGoogle Scholar
  • Laporte G , Louveaux F , Mercure H (1992) The vehicle routing problem with stochastic travel times. Transportation Sci. 26(3):161–170.LinkGoogle Scholar
  • Li Y , Phillips W (2018) Learning from route plan deviation in last-mile delivery. Unpublished master’s thesis, Massachusetts Institute of Technology, Cambridge.Google Scholar
  • Lim MK , Mak H-Y , Shen Z-JM (2016) Agility and proximity considerations in supply chain design. Management Sci. 63(4):1026–1041.LinkGoogle Scholar
  • Lima A , Stanojevic R , Papagiannaki D , Rodriguez P , González MC (2016) Understanding individual routing behaviour. J. Roy. Soc. Interface 13(116):20160021.CrossrefGoogle Scholar
  • Lyu G , Teo CP (2019) Last mile innovation: The case of the locker alliance network. Working paper, NUS Business School, National University of Singapore (NUS), Singapore.Google Scholar
  • Mak HY (2018) Peer-to-peer crowdshipping as an omnichannel retail strategy. Working paper, Said Business School, University of Oxford, Oxford, UK.Google Scholar
  • Mao W , Ming L , Rong Y , Tang CS , Zheng H (2019) Faster deliveries and smarter order assignments for an on-demand meal delivery platform. Working paper, Faculty of Business and Economics, The University of Hong Kong, Hong Kong.Google Scholar
  • Mehrotra A , Johnson EL , Nemhauser GL (1998) An optimization based heuristic for political districting. Management Sci. 44(8):1100–1114.LinkGoogle Scholar
  • Ouyang Y , Daganzo CF (2006) Discretization and validation of the continuum approximation scheme for terminal system design. Transportation Sci. 40(1):89–98.LinkGoogle Scholar
  • Pan Q , Cao J (2015) Recent Developments in Chinese Urban Planning (Springer, Guangzhou, China).CrossrefGoogle Scholar
  • Popescu I (2007) Robust mean-covariance solutions for stochastic optimization. Oper. Res. 55(1):98–112.LinkGoogle Scholar
  • Qi W , Li L , Liu S , Shen Z-JM (2018) Shared mobility for last-mile delivery: Design, operational prescriptions, and environmental impact. Manufacturing Service Oper. Management 20(4):737–751.LinkGoogle Scholar
  • Ryan DM , Foster EA (1981) An integer programming approach to scheduling. Wren A, ed. Computer Scheduling of Public Transport (North-Holland Publishing Company, Amsterdam), 269–280.Google Scholar
  • Savelsbergh M , Van Woensel T (2016) 50th anniversary invited article—City logistics: Challenges and opportunities. Transportation Sci. 50(2):579–590.LinkGoogle Scholar
  • Shen Z-JM , Qi L (2007) Incorporating inventory and routing costs in strategic location models. Eur. J. Oper. Res. 179(2):372–389.CrossrefGoogle Scholar
  • Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2):254–265.LinkGoogle Scholar
  • Wang H , Odoni A (2014) Approximating the performance of a “last mile” transportation system. Transportation Sci. 50(2):659–675.LinkGoogle Scholar
  • Wang X , Lim MK , Ouyang Y (2016) A continuum approximation approach to the dynamic facility location problem in a growing market. Transportation Sci. 51(1):343–357.LinkGoogle Scholar
  • Wiesemann W , Kuhn D , Sim M (2014) Distributionally robust convex optimization. Oper. Res. 62(6):1358–1376.LinkGoogle Scholar
  • Zhang Y , Jiang R , Shen S (2016) Ambiguous chance-constrained bin packing under mean-covariance information. Working paper, Department of Industrial and Systems Engineering, University of Minnesota, Minneapolis.Google Scholar
  • Zheng Z , Natarajan K , Teo C-P (2016) Least squares approximation to the distribution of project completion times with Gaussian uncertainty. Oper. Res. 64(6):1406–1421.LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.