Courier Assignment and Routing Problem Algorithm in Online Food Delivery System with Multi-Customer Delivery Patterns
DOI:
https://doi.org/10.9744/jti.27.1.93-104Keywords:
OFD, MDRP, FMD-ARP, Maximum Covering ModelAbstract
Online food delivery (OFD) businesses face several challenges, including the need for fast deliveries, a high volume of orders, and effective route planning to optimize service efficiency. This study employs the Meal Delivery Routing Problem (MDRP) algorithm to address issues related to courier assignment and capacity management in food delivery operations. The research focuses on scenarios involving a single courier, a single merchant, and multiple demand nodes. Two main methods were used in the study: (1) The Maximum Covering Model (MCM) algorithm, which identifies the coverage area of the courier, and (2) The Flexible Meal Delivery Assignment and Routing Problem (FMD-ARP) algorithm, which tackles routing challenges. Various scenarios were tested to validate the model based on the chosen routes. The aim of this research is to develop a new model and algorithm that reduces delivery time and increases the number of orders that couriers can handle. After processing and analyzing the numerical data, the study identified the most effective scenario that led to improved delivery times and benefits for couriers, enabling them to manage more orders and achieve faster delivery compared to existing algorithms.
Downloads
References
[1] A. Sharma, N. Sharma, and A. Baiswar, “Food delivery app: trend, features and technologies used for app development,” International Journal of Scientific Research in Engineering and Management IJSREM, vol. 06, no. 04, Apr. 2022, doi: 10.55041/IJSREM12569.
[2] M. Elsiana and A. F. Maradona, “Service quality and customer loyalty in the online food delivery service industry,” Quantitative Economics and Management Studies, vol. 5, no. 1, pp. 197–203, Feb. 2024, doi: 10.35877/454RI.qems2407.
[3] C. A. R. Arias and R. I. Bayna-Mariano, “Online food delivery service satisfaction, food choices, and usage frequency among UPLB students aged 18-24 during the covid-19 pandemic,” Journal of Human Ecology and Sustainability, vol. 2, no. 1, p. 4, Feb. 2024, doi: 10.56237/jhes23012.
[4] N. Idris, M. N. F. Abu Bakar, Y. Yakub, D. Arabi, and M. N. Almunawar, “Online food delivery services during covid-19: A case study in Brunei Darussalam,” in Advances in Finance, Accounting, and Economics, P. Ordóñez De Pablos, X. Zhang, and M. N. Almunawar, Eds., IGI Global, 2022, pp. 335–365. doi: 10.4018/978-1-6684-5849-5.ch019.
[5] M. H. Jalis, N. S. C. Deraman, A. N. Ayub, N. ‘Aqilah Hazlan, and N. F. Y. A. Latib, “Influential factors of utilising the online food delivery (ofd) service among students at Dungun Campus, UiTM Terengganu Branch,” E-Academia Journal, vol. 12, no. 1, pp. 47–61, May 2023, doi: 10.24191/e-aj.v12i1.21540.
[6] N. J. A. Maalouf, E. Sayegh, W. Makhoul, and N. Sarkis, “Consumers’ attitudes and purchase intentions toward food ordering via online platforms,” Journal of Retailing and Consumer Services, vol. 82, p. 104151, Jan. 2025, doi: 10.1016/j.jretconser.2024.104151.
[7] S. Sujatha and G. Phaneendra, “A study on customer’s satisfaction and perception towards online food delivery apps,” International Journal for Multidisciplinary Research, vol. 6, no. 3, p. 23326, Jun. 2024, doi: 10.36948/ijfmr.2024.v06i03.23326.
[8] M. Keeble, T. Burgoine, and J. Adams, “P14 investigating frequent online food delivery service use: a qualitative study in UK adults,” in SSM Annual Scientific Meeting, BMJ Publishing Group Ltd, Aug. 2022, p. A54.3-A55. doi: 10.1136/jech-2022-SSMabstracts.113.
[9] A. Gupta et al., “Use of online food delivery services among adults in five countries from the International Food Policy Study 2018–2021,” Preventive Medicine Reports, vol. 43, p. 102766, Jul. 2024, doi: 10.1016/j.pmedr.2024.102766.
[10] J J.-F. Chen et al., “An imitation learning-enhanced iterated matching algorithm for on-demand food delivery,” IEEE Transactions on Intelligent Transportation Systems, vol. 23, no. 10, pp. 18603–18619, Oct. 2022, doi: 10.1109/TITS.2022.3163263.
[11] N. B. T. Nguyen, G.-H. Lin, and T.-T. Dang, “Fuzzy multi-criteria decision-making approach for online food delivery (OFD) companies’ evaluation and selection: A case study in Vietnam,” Processes, vol. 9, no. 8, p. 1274, Jul. 2021, doi: 10.3390/pr9081274.
[12] I. W. E. Gaida and M. Mittal, “Efficient supply chain delivery planning considering dynamic route selection using Ant Colony Optimization,” in 2022 10th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO), Noida, India: IEEE, Oct. 2022, pp. 1–8. doi: 10.1109/ICRITO56286.2022.9964847.
[13] Z. Du, Z.-P. Fan, and Z. Chen, “Implications of on-time delivery service with compensation for an online food delivery platform and a restaurant,” International Journal of Production Economics, vol. 262, p. 108896, Aug. 2023, doi: 10.1016/j.ijpe.2023.108896.
[14] R. Pan, Y. Huang, and X. Xiao, “Evaluating consumers’ willingness to pay for delay compensation services in intra-city delivery—A value optimization study using choice,” Information, vol. 12, no. 3, p. 127, Mar. 2021, doi: 10.3390/info12030127.
[15] W. Liu and W. J. Florkowski, “Online Meal delivery services: Perception of service quality and delivery speed among Chinese consumers,” 2018, doi: 10.22004/AG.ECON.266866.
[16] A. Putra, Z. J. H. Tarigan, and H. Siagian, “Influence of information quality on retailer satisfaction through supply chain flexibility and supplier relationship management in the retail industry,” Jurnal Teknik Industri, vol. 22, no. 2, pp. 93–102, Dec. 2020, doi: 10.9744/jti.22.2.93-102.
[17] R. P. Moghe, S. Rathee, B. Nayak, and K. M. Adusumilli, “Machine learning based batching prediction system for food delivery,” in Proceedings of the 3rd ACM India Joint International Conference on Data Science & Management of Data (8th ACM IKDD CODS & 26th COMAD), Bangalore India: ACM, Jan. 2021, pp. 316–322. doi: 10.1145/3430984.3430999.
[18] J. Zheng, L. Wang, L. Wang, S. Wang, J.-F. Chen, and X. Wang, “Solving stochastic online food delivery problem via iterated greedy algorithm with decomposition-based strategy,” IEEE Transactions on Systems, Man, and Cybernetics: Systems, vol. 53, no. 2, pp. 957–969, Feb. 2023, doi: 10.1109/TSMC.2022.3189771.
[19] C. Duthie et al., “Online on-demand delivery services of food and alcohol: A scoping review of public health impacts,” SSM - Population Health, vol. 21, p. 101349, Mar. 2023, doi: 10.1016/j.ssmph.2023.101349.
[20] X. Lu, X. Guo, J. Zhang, X. Li, L. Li, and S. Jones, “Reducing traffic violations in the online food delivery industry—A case study in Xi’an City, China,” Front. Public Health, vol. 10, p. 974488, Oct. 2022, doi: 10.3389/fpubh.2022.974488.
[21] M. Sun, Y. Xu, F. Xiao, H. Ji, B. Su, and F. Bu, “Optimizing multi-echelon delivery routes for perishable goods with time constraints,” Mathematics, vol. 12, no. 23, p. 3845, Dec. 2024, doi: 10.3390/math12233845.
[22] J. Li, “Optimization of multi-objective fresh food e-commerce delivery route with fuzzy time window,” in International Conference on Computer Graphics, Artificial Intelligence, and Data Processing (ICCAID 2022), R. Liang and J. Wang, Eds., Guangzhou, China: SPIE, May 2023, p. 134. doi: 10.1117/12.2674681.
[23] K. Thopate, T. Bang, Y. Bankar, M. Bansal, and A. Bagade, “Efficient transport optimization,” in 2023 International Conference on Advances in Electronics, Communication, Computing and Intelligent Information Systems (ICAECIS), Bangalore, India: IEEE, Apr. 2023, pp. 554–557. doi: 10.1109/ICAECIS58353.
2023.10170624.
[24] D. Al-Tayar and Z. Alisa, “Enhancing sustainability in logistics through stochastic network routing mechanism optimization using ant colony algorithm,” Heritage and Sustainable Development, vol. 5, no. 2, pp. 229–238, Sep. 2023, doi: 10.37868/hsd.v5i2.239.
[25] W. Wang and S. Gao, “Waiting strategy for the dynamic meal delivery routing problem with time-sensitive customers using a hybrid adaptive genetic algorithm and adaptive large neighborhood search algorithm,” Systems, vol. 12, no. 5, p. 170, May 2024, doi: 10.3390/systems12050170.
[26] K. R. Thipparthy et al., “Optimizing delivery routes for sustainable food delivery for multiple food items per order,” Discover Sustainability, vol. 5, no. 1, p. 122, Jun. 2024, doi: 10.1007/s43621-024-00326-y.
[27] A. Muralidharan, N. Harsha, T. V. Bhat, A. Elizabeth, and K. Srinivas, “Optimal delivery positioning algorithm using clustering,” in 2024 International Conference on Circuit, Systems and Communication (ICCSC), Fes, Morocco: IEEE, Jun. 2024, pp. 1–4. doi: 10.1109/ICCSC62074.2024.10617140.
[28] S. H. Kim and B. D. Chung, “Integrated food delivery problem considering both single-order and multiple order deliveries,” Computers & Industrial Engineering, vol. 196, p. 110458, Oct. 2024, doi: 10.1016/j.cie.
2024.110458.
[29] A. Martínez-Sykora, F. McLeod, T. Cherrett, and A. Friday, “Exploring fairness in food delivery routing and scheduling problems,” Expert Systems with Applications, vol. 240, p. 122488, Apr. 2024, doi: 10.1016/
j.eswa.2023.122488.
[30] F. Tomova, S. Filipov, and A. Avdzhieva, “Covering a maximum number of points by a fixed number of equal disks via simulated annealing,” Journal of Chemical Technology and Metallurgy, vol. 59, no. 2, pp. 457–464, Jan. 2024, doi: 10.59957/jctm.v59.i2.2024.26.
[31] L. Zhou, A. Ye, and S. Hu, “A four-stage heuristic algorithm for solving on-demand meal delivery routing problem,” 2022, arXiv. doi: 10.48550/ARXIV.2212.03505.
[32] W. Wang and S. Gao, “An Alns-enhanced adaptive genetic algorithm for dynamic meal delivery routing problem with time-sensitive priority and waiting strategy,” 2023, SSRN. doi: 10.2139/ssrn.4551614.
[33] Y. Xie and Z. Wu, “A genetic algorithm for meal delivery problem considering rider’s wage balance,” in 2024 36th Chinese Control and Decision Conference (CCDC), Xi’an, China: IEEE, May 2024, pp. 4873–4879. doi: 10.1109/CCDC62350.2024.10588199.
[34] M. D. Simoni and M. Winkenbach, “Crowdsourced on-demand food delivery: An order batching and assignment algorithm,” Transportation Research Part C: Emerging Technologies, vol. 149, p. 104055, Apr. 2023, doi: 10.1016/j.trc.2023.104055.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 Prita Meilanitasari, Maulin, Ilda, Faisal, Sekar
This work is licensed under a Creative Commons Attribution 4.0 International License.
Articles published in the Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri will be Open-Access articles distributed under the terms and conditions of the Creative Commons Attribution License (CC BY).
This work is licensed under a Creative Commons Attribution License (CC BY).
