Courier Assignment and Routing Problem Algorithm in Online Food Delivery System with Multi-Customer Delivery Patterns
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 ass...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Petra Christian University
2025-03-01
|
| Series: | Jurnal Teknik Industri |
| Subjects: | |
| Online Access: | https://jurnalindustri.petra.ac.id/index.php/ind/article/view/29893 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850044154643480576 |
|---|---|
| author | Prita Meilanitasari Maulin Masyito Putri Ilda Auly Sita Agustin Muhammad Faisal Ibrahim Dwi Sekar Arumjani |
| author_facet | Prita Meilanitasari Maulin Masyito Putri Ilda Auly Sita Agustin Muhammad Faisal Ibrahim Dwi Sekar Arumjani |
| author_sort | Prita Meilanitasari |
| collection | DOAJ |
| description |
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.
|
| format | Article |
| id | doaj-art-33ee83f4258b4f1bb70693542e095bd9 |
| institution | DOAJ |
| issn | 1411-2485 2087-7439 |
| language | English |
| publishDate | 2025-03-01 |
| publisher | Petra Christian University |
| record_format | Article |
| series | Jurnal Teknik Industri |
| spelling | doaj-art-33ee83f4258b4f1bb70693542e095bd92025-08-20T02:55:03ZengPetra Christian UniversityJurnal Teknik Industri1411-24852087-74392025-03-0127110.9744/jti.27.1.93-104Courier Assignment and Routing Problem Algorithm in Online Food Delivery System with Multi-Customer Delivery PatternsPrita Meilanitasari0Maulin Masyito Putri1Ilda Auly Sita Agustin2Muhammad Faisal Ibrahim3Dwi Sekar Arumjani4Universitas Internasional Semen IndonesiaUniversitas Internasional Semen IndonesiaUniversitas Internasional Semen IndonesiaUniversitas Internasional Semen IndonesiaUniversitas Internasional Semen Indonesia 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. https://jurnalindustri.petra.ac.id/index.php/ind/article/view/29893OFDMDRPFMD-ARPMaximum Covering Model |
| spellingShingle | Prita Meilanitasari Maulin Masyito Putri Ilda Auly Sita Agustin Muhammad Faisal Ibrahim Dwi Sekar Arumjani Courier Assignment and Routing Problem Algorithm in Online Food Delivery System with Multi-Customer Delivery Patterns Jurnal Teknik Industri OFD MDRP FMD-ARP Maximum Covering Model |
| title | Courier Assignment and Routing Problem Algorithm in Online Food Delivery System with Multi-Customer Delivery Patterns |
| title_full | Courier Assignment and Routing Problem Algorithm in Online Food Delivery System with Multi-Customer Delivery Patterns |
| title_fullStr | Courier Assignment and Routing Problem Algorithm in Online Food Delivery System with Multi-Customer Delivery Patterns |
| title_full_unstemmed | Courier Assignment and Routing Problem Algorithm in Online Food Delivery System with Multi-Customer Delivery Patterns |
| title_short | Courier Assignment and Routing Problem Algorithm in Online Food Delivery System with Multi-Customer Delivery Patterns |
| title_sort | courier assignment and routing problem algorithm in online food delivery system with multi customer delivery patterns |
| topic | OFD MDRP FMD-ARP Maximum Covering Model |
| url | https://jurnalindustri.petra.ac.id/index.php/ind/article/view/29893 |
| work_keys_str_mv | AT pritameilanitasari courierassignmentandroutingproblemalgorithminonlinefooddeliverysystemwithmulticustomerdeliverypatterns AT maulinmasyitoputri courierassignmentandroutingproblemalgorithminonlinefooddeliverysystemwithmulticustomerdeliverypatterns AT ildaaulysitaagustin courierassignmentandroutingproblemalgorithminonlinefooddeliverysystemwithmulticustomerdeliverypatterns AT muhammadfaisalibrahim courierassignmentandroutingproblemalgorithminonlinefooddeliverysystemwithmulticustomerdeliverypatterns AT dwisekararumjani courierassignmentandroutingproblemalgorithminonlinefooddeliverysystemwithmulticustomerdeliverypatterns |