The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
On-Time Last-Mile Delivery: Order Assignment with Travel-Time Predictors
Open accessAbstract
We study how delivery data can be applied to improve the on-time performance of last-mile delivery services. Motivated by the delivery operations and data of a food delivery service provider, we discuss a framework that integrates travel-time predictors with order-assignment optimization. Such integration enables us to capture the driver’s routing behavior in practice as the driver’s decision-making process is often unobservable or intricate to model. Focusing on the order-assignment problem as an example, we discuss the classes of tractable predictors and prediction models that are highly compatible with the existing stochastic and robust optimization tools. We further provide reformulations of the integrated models, which can be efficiently solved with the proposed branch-and-price algorithm. Moreover, we propose two simple heuristics for the multiperiod order-assignment problem, and they are built upon single-period solutions. Using the delivery data, our numerical experiments on a real-world application not only demonstrate the superior performance of our proposed order-assignment models with travel-time predictors, but also highlight the importance of learning behavioral aspects from operational data. We find that a large sample size does not necessarily compensate for the misspecification of the driver’s routing behavior. This paper was accepted by Hamid Nazerzadeh, big data analytics.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
Solomon, M. M. (1987) · Operations Research · doi:10.1287/opre.35.2.254 · Cited by 4,298
Branch-and-price: column generation for solving huge integer programs
Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1998) · Operations Research · doi:10.1287/opre.46.3.316 · Cited by 2,219
The Sample Average Approximation Method for Stochastic Discrete Optimization
Kleywegt, A. J., Shapiro, A., & Homem-de-Mello, T. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623499363220 · Cited by 1,983
Delage, E., & Ye, Y. (2010) · Operations Research · doi:10.1287/opre.1090.0741 · Cited by 1,893
Distributionally Robust Convex Optimization
Wiesemann, W., Kuhn, D., & Sim, M. (2014) · Operations Research · doi:10.1287/opre.2014.1314 · Cited by 947
The shortest path through many points
Beardwood, J., Halton, J. H., & Hammersley, J. M. (1959) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100034095 · Cited by 937
50th Anniversary Invited Article—City Logistics: Challenges and Opportunities
Savelsbergh, M. W. P., & Woensel, T. V. (2016) · Transportation Science · doi:10.1287/trsc.2016.0675 · Cited by 885
Gendreau, M., Laporte, G., & Séguin, R. (1996) · European Journal of Operational Research · doi:10.1016/0377-2217(95)00050-x · Cited by 640
Bertsimas, D., & Dunn, J. (2017) · Machine Learning · doi:10.1007/s10994-017-5633-9 · Cited by 638
A Non-Parametric Test of Independence
Hoeffding, W. (1948) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177730150 · Cited by 627
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
Fukasawa, R., Longo, H., Lysgaard, J., Aragão, M. P. D., Reis, M., Uchoa, E., & Werneck, R. F. (2006) · Mathematical Programming · doi:10.1007/s10107-005-0644-x · Cited by 539
Analytics for an Online Retailer: Demand Forecasting and Price Optimization
Ferreira, K. J., Lee, B. H. A., & Simchi-Levi, D. (2016) · Manufacturing & Service Operations Management · doi:10.1287/msom.2015.0561 · Cited by 538
The Big Data Newsvendor: Practical Insights from Machine Learning
Ban, G.-Y., & Rudin, C. (2019) · Operations Research · doi:10.1287/opre.2018.1757 · Cited by 507
Factors influencing the choice of shared bicycles and shared electric bikes in Beijing
Campbell, A. A., Cherry, C. R., Ryerson, M. S., & Yang, X. (2016) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2016.03.004 · Cited by 486
A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
Bertsimas, D. J., & van Ryzin, G. (1991) · Operations Research · doi:10.1287/opre.39.4.601 · Cited by 437
The Vehicle Routing Problem with Stochastic Travel Times
Laporte, G., Louveaux, F., & Mercure, H. (1992) · Transportation Science · doi:10.1287/trsc.26.3.161 · Cited by 435
What you should know about the vehicle routing problem
Gilbert Laporte, A. (2007) · Naval Research Logistics (NRL) · doi:10.1002/nav.20261 · Cited by 329
A Nonparametric Approach to Modeling Choice with Limited Data
Farias, V. F., Jagabathula, S., & Shah, D. (2013) · Management Science · doi:10.1287/mnsc.1120.1610 · Cited by 304
Preprint repository arXiv achieves milestone million uploads
(2014) · Physics Today · doi:10.1063/pt.5.028530 · Cited by 302
Order batching to minimize total travel time in a parallel-aisle warehouse
GADEMANN, N., & VELDE, S. (2005) · IIE Transactions · doi:10.1080/07408170590516917 · Cited by 295
Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
Bertsimas, D. J., & van Ryzin, G. (1993) · Operations Research · doi:10.1287/opre.41.1.60 · Cited by 274
Deep neural networks and mixed integer linear optimization
Fischetti, M., & Jo, J. (2018) · Constraints · doi:10.1007/s10601-018-9285-6 · Cited by 272
Robust Mean-Covariance Solutions for Stochastic Optimization
Popescu, I. (2007) · Operations Research · doi:10.1287/opre.1060.0353 · Cited by 235
Hierarchical Clustering With Prototypes via Minimax Linkage
Bien, J., & Tibshirani, R. (2011) · Journal of the American Statistical Association · doi:10.1198/jasa.2011.tm10183 · Cited by 197
Strong mixed-integer programming formulations for trained neural networks
Anderson, R., Huchette, J., Ma, W., Tjandraatmadja, C., & Vielma, J. P. (2020) · Mathematical Programming · doi:10.1007/s10107-020-01474-5 · Cited by 182
Online Grocery Retail: Revenue Models and Environmental Impact
Belavina, E., Girotra, K., & Kabra, A. (2017) · Management Science · doi:10.1287/mnsc.2016.2430 · Cited by 176
Robust Repositioning for Vehicle Sharing
He, L., Hu, Z., & Zhang, M. (2019) · Manufacturing & Service Operations Management · doi:10.1287/msom.2018.0734 · Cited by 138
Self-citationUnderstanding individual routing behaviour
Lima, A., Stanojević, R., Papagiannaki, D., Rodríguez, P., & González, M. C. (2016) · Journal of The Royal Society Interface · doi:10.1098/rsif.2016.0021 · Cited by 121
Probabilistic Traveling Salesman Problem with Deadlines
Campbell, A. M., & Thomas, B. W. (2008) · Transportation Science · doi:10.1287/trsc.1070.0203 · Cited by 115
The One-Dimensional Dynamic Dispatch Waves Problem
Klapp, M. A., Erera, A. L., & Toriello, A. (2016) · Transportation Science · doi:10.1287/trsc.2016.0682 · Cited by 113
Holland, C., Levis, J., Nuggehalli, R., Santilli, B., & Winters, J. (2017) · Interfaces · doi:10.1287/inte.2016.0875 · Cited by 95
The Vehicle Routing Problem with Stochastic Demand and Duration Constraints
Erera, A. L., Morales, J. C., & Savelsbergh, M. W. P. (2010) · Transportation Science · doi:10.1287/trsc.1100.0324 · Cited by 88
Agility and Proximity Considerations in Supply Chain Design
Lim, M. K., Mak, H., & Shen, Z. M. (2016) · Management Science · doi:10.1287/mnsc.2015.2380 · Cited by 86
Business Analytics for Flexible Resource Allocation Under Random Emergencies
Angalakudati, M., Balwani, S., Calzada, J., Chatterjee, B., Perakis, G., Raad, N., & UICHANCO, J. A. V. (2014) · Management Science · doi:10.1287/mnsc.2014.1919 · Cited by 50
Faster Deliveries and Smarter Order Assignments for an On-Demand Meal Delivery PlatformPreprint
Mao, W., Ming, L., Rong, Y., et al. (2019) · SSRN Electronic Journal · doi:10.2139/ssrn.3469015 · Cited by 47
Jónasson, J. O., Deo, S., & Gallien, J. (2017) · Operations Research · doi:10.1287/opre.2017.1646 · Cited by 43
Beyond normality: A cross moment-stochastic user equilibrium model
Ahipaşaoğlu, S. D., Meskarian, R., Magnanti, T. L., & Natarajan, K. (2015) · Transportation Research Part B Methodological · doi:10.1016/j.trb.2015.01.005 · Cited by 35
Optimizing Objective Functions Determined from Random ForestsPreprint
Biggs, M., & Hariss, R. (2017) · SSRN Electronic Journal · doi:10.2139/ssrn.2986630 · Cited by 32
Zheng, Z., Natarajan, K., & Teo, C. (2016) · Operations Research · doi:10.1287/opre.2016.1528 · Cited by 8
Cited by
Predictive and prescriptive analytics toward passenger-centric ground delay programs
Jacquillat, A. (2022) · Transportation Science · doi:10.1287/trsc.2021.1081 · Cited by 18
Metadata
- Authors
- Liu, S., He, L., & Max Shen, Z.-J.
- Venue
- Management Science
- Published
- 2021-07
- Volume
- 67
- Issue
- 7
- Pages
- 4095-4119
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W3125883116
- Cited by
- 268
- References
- 40
- FWCI
- 12.37
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.