Admission control in a parcel delivery system with account of the finite capacity of the warehouse at the pick-up point

Authors

  • Alexander N. Dudin Belarusian State University, 4 Niezaliezhnasci Avenue, Minsk 220030, Belarus

Keywords:

parcel delivery system, pick-up point, tandem queue, admission control, multidimensional Markov chain, Markov arrival process, optimisation

Abstract

Parcels delivering via pick-up points have become very popular due to the fast development of online marketplaces, customer-to-customer markets, and the use of parcel lockers as the last mile delivery solution. An adequate modelling of such delivery systems requires the creation of novel queueing models. In this paper, the process of delivering is described as the processing of a parcel in two service areas. The first area corresponds to processing until the parcel’s arrival to the second area. The service in the second area corresponds to the storage of the parcel in a warehouse until it is picked up by a customer. The capacity of the warehouse is finite. A parcel arriving when the warehouse is full is lost. To enhance the efficiency of the system operation, threshold-type control by parcel admission at the first area is applied. Such a system is analysed under quite general assumptions about the parcel arrival flow. The analysis is implemented via consideration of the suitably constructed multidimensional continuous-time Markov chain. The dependence of the main performance measures of the delivery system on the warehouse capacity and the admission threshold are established and numerically illustrated. An optimisation problem is formulated and solved.

Author Biography

  • Alexander N. Dudin, Belarusian State University, 4 Niezaliezhnasci Avenue, Minsk 220030, Belarus

    doctor of science (physics and mathematics), full professor; head of the laboratory of applied probabilistic analysis, department of probability theory and mathematical statistics, faculty of applied mathematics and computer science

References

  1. Janinhoff L, Klein R, Sailer D, Schoppa JM. Out-of-home delivery in last-mile logistics: a review. Computers and Operations Research. 2024;168:106686. DOI: 10.1016/j.cor.2024.106686.
  2. Nguyen TTT, Cabani A, Cabani I, De Turck K, Kieffer M. Analysis and forecasting of the load of parcel pick-up points: contribution of C2c e-commerce. SSRN. 2024:4887323. DOI: 10.2139/ssrn.4887323.
  3. Wang L, Xu M, Qin H. Joint optimization of parcel allocation and crowd routing for crowdsourced last-mile delivery. Transportation Research Part B: Methodological. 2023;171:111–135. DOI: 10.1016/j.trb.2023.03.007.
  4. Cardenas ID, Dewulf W, Vanelslander T, Smet C, Beckers J. The e-commerce parcel delivery market and the implications of home B2C deliveries vs pick-up points. International Journal of Transport Economics. 2017;44(2):235–256. DOI: 10.19272/201706702004.
  5. Lamas-Fernandez C, Martinez-Sykora A, McLeod F, Bektas T, Cherrett T, Allen J. Improving last-mile parcel delivery through shared consolidation and portering: a case study in London. Journal of the Operational Research Society. 2024;75(6):1043–1054. DOI: 10.1080/01605682.2023.2231095.
  6. van Duin JHR, Wiegmans BW, van Arem B, van Amstel Y. From home delivery to parcel lockers: a case study in Amsterdam. Transportation Research Procedia. 2020;46:37–44. DOI: 10.1016/j.trpro.2020.03.161.
  7. Molin E, Kosicki M, van Duin R. Consumer preferences for parcel delivery methods: the potential of parcel locker use in the Netherlands. European Journal of Transport and Infrastructure Research. 2022;22(2):183–200. DOI: 10.18757/ejtir.2022.22.2.6427.
  8. Cheng X, Liao S, Hua Z. A policy of picking up parcels for express courier service in dynamic environments. International Journal of Production Research. 2017;55(9):2470–2488. DOI: 10.1080/00207543.2016.1231431.
  9. de Assis TF, de Abreu VHS, da Costa MG, D’Agosto MDA. Methodology for prioritizing best practices applied to the sustainable last mile – the case of a Brazilian parcel delivery service company. Sustainability. 2022;14(7):3812. DOI: 10.3390/su14073812.
  10. Zabielska A, Jacyna M, Lasota M, Nehring K. Evaluation of the efficiency of the delivery process in the technical object of transport infrastructure with the application of a simulation model. Eksploatacja i Niezawodnosc – Maintenance and Reliability. 2023;25(1):1–12. DOI: 10.17531/ein.2023.1.1.
  11. Hideyama S, Phung-Duc T, Okada Y. Queueing analysis of home delivery services with parcel lockers. Lecture Notes in Computer Science. 2019;11688:351–368. DOI: 10.1007/978-3-030-27181-7_21.
  12. Liu Y, Escribano Macias JJ, Zhang K, Ye Q, Angeloudis P. Customer behaviour analysis for coordinated delivery service using mobile parcel lockers and autonomous robots: a congestion-game model. SSRN. 2023:4549554. DOI: 10.2139/ssrn.4549554.
  13. Chakravarthy SR. The batch Markovian arrival process: a review and future work. Advances in Probability Theory and Stochastic Processes. 2001;1(1):21–49.
  14. Chakravarthy SR. Introduction to matrix-analytic methods in queues 1: analytical and simulation approach – basics. London: John Wiley and Sons; 2022. 341 p. DOI: 10.1002/9781394165421.
  15. Chakravarthy SR. Introduction to matrix-analytic methods in queues 2: analytical and simulation approach – queues and simulation. London: John Wiley and Sons; 2022. 448 p. DOI: 10.1002/9781394174201.
  16. Lucantoni DM. New results on the single server queue with a batch Markovian arrival process. Communication in Statistics. Stochastic Models. 1991;7(1):1–46. DOI: 10.1080/15326349108807174.
  17. Dudin AN, Klimenok VI, Vishnevsky VM. The theory of queuing systems with correlated flows. Cham: Springer; 2020. 410 p. DOI: 10.1007/978-3-030-32072-0.
  18. Vishnevskii VM, Dudin AN. Queueing systems with correlated arrival flows and their applications to modeling telecommunication networks. Automation and Remote Control. 2017;78:1361–1403. DOI: 10.1134/S000511791708001X.
  19. Klimenok VI. A queueing system with a batch Markovian arrival process and varying priorities. Journal of the Belarusian State University. Mathematics and Informatics. 2022;2:47–56. Russian. DOI: 10.33581/2520-6508-2022-2-47-56.
  20. Dudina OS. Analytical modelling of systems with a ticket queue. Journal of the Belarusian State University. Mathematics and Informatics. 2024;2:40–53. Russian.
  21. Dudin A, Dudin S, Melikov A, Dudina O. Framework for analysis of queueing systems with correlated arrival processes and simultaneous service of a restricted number of customers in scenarios with infinite buffer and retrials. Algorithms. 2024;17(11):493. DOI: 10.3390/a17110493.
  22. Dudin A, Dudin S, Klimenok V, Dudina O. Stability of queueing systems with impatience, balking and non-persistence of customers. Mathematics. 2024;12(14):2214. DOI: 10.3390/math12142214.
  23. Chakravarthy S, Melikov A. A new admission control scheme in queueing-inventory system with two priority classes of demands. Opsearch. 2024;11:1–34. DOI: 10.1007/s12597-024-00877-8.
  24. Melikov A, Lawrence S, Sivakumar B. Analysis and optimization of hybrid replenishment policy in a double-sources queueing-inventory system with MAP arrivals. Annals of Operations Research. 2023;331(2):1249–1267. DOI: 10.1007/s10479-023-05646-2.
  25. Mathew N, Joshua VC, Krishnamoorthy A, Melikov A, Mathew AP. A production inventory model with server breakdown and customer impatience. Annals of Operations Research. 2023;331(2):1269–1304. DOI: 10.1007/s10479-023-05659-x.
  26. Melikov A, Chakravarthy SR, Aliyeva S. A retrial queueing model with feedback. Queueing Models and Service Management. 2023;6(1):63–95.
  27. Dudin A, Dudin S, Manzo R, Rarità L. Queueing system with batch arrival of heterogeneous orders, flexible limited processor sharing and dynamical change of priorities. AIMS Mathematics. 2024;9(5):12144–12169. DOI: 10.3934/math.2024593.
  28. Dudin SA, Dudina OS, Kostyukova OI. Analysis of a queuing system with possibility of waiting customers jockeying between two groups of servers. Mathematics. 2023;11(6):1475. DOI: 10.3390/math11061475.
  29. Nair DV, Krishnamoorthy A, Melikov A, Aliyeva S. MMAP/(PH, PH)/1 queue with priority loss through feedback. Mathematics. 2021;9(15):1797. DOI: 10.3390/math9151797.
  30. Graham A. Kronecker products and matrix calculus with applications. New York: Dover Publications; 2018. 144 p.
  31. Baumann H, Sandmann W. Multi-server tandem queue with Markovian arrival process, phase-type service times, and finite buffers. European Journal of Operational Research. 2017;256(1):187–195. DOI: 10.1016/j.ejor.2016.07.035.
  32. Dudin SA, Dudina OS. Call center operation model as a MAP/ PH / N/ N – R system with impatient customers. Problems of Information Transmission. 2011;47:364–377. DOI: 10.1134/S0032946011040053.

Downloads

Published

2025-06-09

Issue

No. 1 (2025): Journal of the Belarusian State University. Mathematics and Informatics

Section

Probability Theory and Mathematical Statistics

License

The authors who are published in this journal agree to the following:

  1. The authors retain copyright on the work and provide the journal with the right of first publication of the work on condition of license Creative Commons Attribution-NonCommercial. 4.0 International (CC BY-NC 4.0).
  2. The authors retain the right to enter into certain contractual agreements relating to the non-exclusive distribution of the published version of the work (e.g. post it on the institutional repository, publication in the book), with the reference to its original publication in this journal.
  3. The authors have the right to post their work on the Internet (e.g. on the institutional store or personal website) prior to and during the review process, conducted by the journal, as this may lead to a productive discussion and a large number of references to this work. (See The Effect of Open Access.)

How to Cite

[1]
Dudin, A.N. 2025. Admission control in a parcel delivery system with account of the finite capacity of the warehouse at the pick-up point. Journal of the Belarusian State University. Mathematics and Informatics. 1 (Jun. 2025), 68–78.