Analysis of Real-Time Order Fulfillment Policies: When to Dispatch a Batch?

References

• Ansari S, Başdere M, Li X, Ouyang Y, Smilowitz K (2018) Advancements in continuous approximation models for logistics and transportation systems: 1996–2016. Transportation Res. Part B: Methodological 107:229–252.Crossref, Google Scholar
• Anupindi R, Tayur S (1998) Managing stochastic multiproduct systems: Model, measures, and analysis. Oper. Res. 46(3-Supplement-3):S98–S111.Link, Google Scholar
• Azi N, Gendreau M, Potvin JY (2012) A dynamic vehicle routing problem with multiple delivery routes. Ann. Oper. Res. 199:103–112.Crossref, Google Scholar
• Bassett B, Gautam N (2019) The effect of adding stops to a delivery route. 2019 Inst. Indust. Systems Engineers Annual Conf. Expo (Institute of Industrial and Systems Engineers, Peachtree Corners, GA), 529–534.Google Scholar
• Beckwith S (2017) The Amazon effect: No longer a phantom menace. Inbound Logist. (November), https://www.inboundlogistics.com/wp-content/uploads/IL_Digital_November2017.pdf.Google Scholar
• Bookbinder JH, Cai Q, He QM (2011) Shipment consolidation by private carrier: The discrete time and discrete quantity case. Stochastic Models 27(4):664–686.Crossref, Google Scholar
• Boyer KK, Prud’homme AM, Chung W (2009) The last mile challenge: Evaluating the effects of customer density and delivery window patterns. J. Bus. Logist. 30(1):185–201.Crossref, Google Scholar
• Burns L, Hall R, Blumenfeld D, Daganzo C (1985) Distribution strategies that minimize transportation and inventory costs. Oper. Res. 33(3):469–490.Link, Google Scholar
• Buzacott JA, Shanthikumar JG (1993) Stochastic Models of Manufacturing Systems, vol. 4 (Prentice Hall, Englewood Cliffs, NJ).Google Scholar
• Cai Q, He QM, Bookbinder JH (2014) A tree-structured Markovian model of the shipment consolidation process. Stochastic Models 30(4):521–553.Crossref, Google Scholar
• Cattaruzza D, Absi N, Feillet D, González-Feliu J (2017) Vehicle routing problems for city logistics. EURO J. Transportation Logist. 6(1):51–79.Crossref, Google Scholar
• Cavdar B, Sokol J (2015) A distribution-free TSP tour length estimation model for random graphs. Eur. J. Oper. Res. 243(2):588–598.Crossref, Google Scholar
• Ceder A, Yim Y (2003) Integrated smart feeder/shuttle bus service. Working paper, California Partners for Advanced Transportation Technology, Institute of Transportation Studies, University of California at Berkeley, Berkeley, CA.Google Scholar
• Çetinkaya S, Bookbinder JH (2003) Stochastic models for the dispatch of consolidated shipments. Transportation Res. Part B: Methodological 37(8):747–768.Crossref, Google Scholar
• Çeven E, Gue KR (2017) Optimal wave release times for order fulfillment systems with deadlines. Transportation Sci. 51(1):52–66.Link, Google Scholar
• Chen C, Pan S (2016) Using the crowd of taxis to last mile delivery in e-commerce: A methodological research. Borangiu T, Trentesaux D, Thomas A, McFarlane D, eds. Service Orientation in Holonic and Multi-Agent Manufacturing (Springer, Cham, Switzerland), 61–70.Crossref, Google Scholar
• Chen H, Wan YW (2003) The optimal admission and dispatching control policy of a two-terminal transportation system. IIE Trans. 35(9):895–906.Crossref, Google Scholar
• Chew EP, Tang LC (1999) Travel time analysis for general item location assignment in a rectangular warehouse. Eur. J. Oper. Res. 112(3):582–597.Crossref, Google Scholar
• Choi Y, Schonfeld PM (2022) Review of length approximations for tours with few stops. Transportation Res. Rec. 2676(3):201–213.Crossref, Google Scholar
• Coelho LC, Cordeau JF, Laporte G (2013) Thirty years of inventory routing. Transportation Sci. 48(1):1–19.Link, Google Scholar
• Curry GL, Feldman RM (2010) Manufacturing Systems Modeling and Analysis, 2nd ed. (Springer, Heidelberg, Germany).Google Scholar
• Daganzo CF (1984) The distance traveled to visit N points with a maximum of C stops per vehicle: An analytic model and an application. Transportation Sci. 18(4):331–350.Link, Google Scholar
• Daganzo CF (2005) Logistics Systems Analysis (Springer, Berlin).Google Scholar
• De Maio A, Violi A, Laganà D, Beraldi P (2018) A freight adviser for a delivery logistics service e-marketplace. Daniele P, Scrimali L, eds. New Trends in Emerging Complex Real Life Problems (Springer, Cham, Switzerland), 219–226.Crossref, Google Scholar
• Dellaert N (2012) Production to Order: Models and Rules for Production Planning, vol. 333 (Springer-Verlag, Berlin).Google Scholar
• Du T, Wang F, Lu PY (2007) A real-time vehicle-dispatching system for consolidating milk runs. Transportation Res. Part E: Logist. Transportation Rev. 43(5):565–577.Crossref, Google Scholar
• Duin Jv, Kneyber J (2004) Toward a matching system for the auction of transport orders. Taniguchi E, Thompson RG, eds. Logistics Systems for Sustainable Cities (Emerald Group Publishing Limited, Bingley, UK), 163–177.Google Scholar
• Eisenstein DD (2005) Recovering cyclic schedules using dynamic produce-up-to policies. Oper. Res. 53(4):675–688.Link, Google Scholar
• Gendreau M, Guertin F, Potvin JY, Taillard E (1999) Parallel tabu search for real-time vehicle routing and dispatching. Transportation Sci. 33(4):381–390.Link, Google Scholar
• Ghiani G, Guerriero F, Laporte G, Musmanno R (2003) Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. Eur. J. Oper. Res. 151(1):1–11.Crossref, Google Scholar
• Henchiri A, Bellalouna M, Khaznaji W (2014) A probabilistic traveling salesman problem: A survey. Ann. Comput. Sci. Inform. Systems 3:55–60.Crossref, Google Scholar
• Hopp WJ, Spearman ML (2011) Factory Physics (Waveland Press, Long Grove, IL).Google Scholar
• Ichoua S, Gendreau M, Potvin JY (2000) Diversion issues in real-time vehicle dispatching. Transportation Sci. 34(4):426–438.Link, Google Scholar
• Jaillet P (1985) Probabilistic traveling salesman problems. Unpublished PhD thesis, Massachusetts Institute of Technology, Cambridge.Google Scholar
• Klapp M, Erera A, Toriello A (2018a) The dynamic dispatch waves problem for same-day delivery. Eur. J. Oper. Res. 271:519–534.Crossref, Google Scholar
• Klapp M, Erera A, Toriello A (2018b) The one-dimensional dynamic dispatch waves problem. Transportation Sci. 52(2):402–415.Link, Google Scholar
• Kou S, Golden B, Poikonen S (2022) Optimal TSP tour length estimation using standard deviation as a predictor. Comput. Oper. Res. 148:105993.Crossref, Google Scholar
• Kou S, Golden B, Poikonen S (2023) Estimating optimal objective values for the TSP, VRP, and other combinatorial problems using randomization. Internat. Trans. Oper. Res., ePub ahead of print January 17.Crossref, Google Scholar
• Krumke SO, Rambau J, Torres LM (2002) Real-time dispatching of guided and unguided automobile service units with soft time windows. Möhring R, Raman R, eds. Algorithms—ESA2022. Lecture Notes in Computer Science, vol. 2461 (Springer, Berlin), 637–648.Crossref, Google Scholar
• Le-Duc T, De Koster RM (2007) Travel time estimation and order batching in a 2-block warehouse. Eur. J. Oper. Res. 176(1):374–388.Crossref, Google Scholar
• Lee HS, Srinivasan MM (1990) The shuttle dispatch problem with compound Poisson arrivals: Controls at two terminals. Queueing Systems 6(1):207–221.Crossref, Google Scholar
• Lin Z, Dong J, Liu C, Greene D (2012) Estimation of energy use by plug-in hybrid electric vehicles: Validating gamma distribution for representing random daily driving distance. Transportation Res. Rec. 2287(1):37–43.Crossref, Google Scholar
• Liu S, He L, Max Shen ZJ (2021) On-time last-mile delivery: Order assignment with travel-time predictors. Management Sci. 67(7):4095–4119.Link, Google Scholar
• Lynch C (2018) The time has come. DC Velocity 16(1):39.Google Scholar
• Markowitz DM, Wein LM (2001) Heavy traffic analysis of dynamic cyclic policies: A unified treatment of the single machine scheduling problem. Oper. Res. 49(2):246–270.Link, Google Scholar
• Markowitz DM, Reiman MI, Wein LM (2000) The stochastic economic lot scheduling problem: Heavy traffic analysis of dynamic cyclic policies. Oper. Res. 48(1):136–154.Link, Google Scholar
• Minkoff AS (1985) Real-time dispatching of delivery vehicles. Unpublished PhD thesis, Massachusetts Institute of Technology, Cambridge.Google Scholar
• Minkoff AS (1993) A Markov decision model and decomposition heuristic for dynamic vehicle dispatching. Oper. Res. 41(1):77–90.Link, Google Scholar
• Mutlu F, Çetinkaya S, Bookbinder JH (2010) An analytical model for computing the optimal time-and-quantity-based policy for consolidated shipments. IIE Trans. 42(5):367–377.Crossref, Google Scholar
• Nahmias S, Lennon Olsen T (2020) Production and Operations Analysis, 8th ed. (Waveland Press, Long Grove, IL).Google Scholar
• Nandiraju S, Regan A (2008) Freight transportation electronic marketplaces: A survey of the industry and exploration of important research issues. Technical report, University of California Transportation Center, Berkeley, CA.Google Scholar
• Pardo EG, Gil-Borrás S, Alonso-Ayuso A, Duarte A (2023) Order batching problems: Taxonomy and literature review. Eur. J. Oper. Res. 313(1):1–24.Google Scholar
• Polus A (1979) A study of travel time and reliability on arterial routes. Transportation 8(2):141–151.Crossref, Google Scholar
• Powell WB (2007) Real-time dispatching for truckload motor carriers. Logistics Engineering Handbook (CRC Press, Boca Raton, FL), 323–342.Crossref, Google Scholar
• Satir B, Erenay FS, Bookbinder JH (2018) Shipment consolidation with two demand classes: Rationing the dispatch capacity. Eur. J. Oper. Res. 270(1):171–184.Crossref, Google Scholar
• Stroh AM, Erera AL, Toriello A (2022) Tactical design of same-day delivery systems. Management Sci. 68(5):3444–3463.Link, Google Scholar
• Tian J, Fu R, Yuan J (2007) On-line scheduling with delivery time on a single batch machine. Theoret. Comput. Sci. 374(1–3):49–57.Crossref, Google Scholar
• Ulmer MW, Thomas BW, Mattfeld DC (2019) Preemptive depot returns for dynamic same-day delivery. EURO J. Transportation Logist. 8(4):327–361.Crossref, Google Scholar
• Van Heeswijk WJ, Mes MR, Schutten JM (2019) The delivery dispatching problem with time windows for urban consolidation centers. Transportation Sci. 53(1):203–221.Link, Google Scholar
• Voccia S, Campbell A, Thomas B (2019) The same-day delivery problem for online purchases. Transportation Sci. 53(1):167–184.Link, Google Scholar
• Wagner M, Smits SR (2004) A local search algorithm for the optimization of the stochastic economic lot scheduling problem. Internat. J. Production Econom. 90(3):391–402.Crossref, Google Scholar
• Wei B, Çetinkaya S, Cline DB (2022) Analytical results on the service performance of stochastic clearing systems. Probab. Engrg. Inform. Sci. 36(2):217–236.Crossref, Google Scholar
• Winands EM, Adan IJ, van Houtum GJ (2011) The stochastic economic lot scheduling problem: A survey. Eur. J. Oper. Res. 210(1):1–9.Crossref, Google Scholar
• Zhang G, Cai X, Wong C (2001) On-line algorithms for minimizing makespan on batch processing machines. Naval Res. Logist. 48(3):241–258.Crossref, Google Scholar