Next Article in Journal
Safety and Security-Specific Application of Multiple Drone Sensors at Movement Areas of an Aerodrome
Next Article in Special Issue
Drone-Based Instant Delivery Hub-and-Spoke Network Optimization
Previous Article in Journal
High-Efficiency Data Fusion Aerodynamic Performance Modeling Method for High-Altitude Propellers
Previous Article in Special Issue
Hybrid Encryption for Securing and Tracking Goods Delivery by Multipurpose Unmanned Aerial Vehicles in Rural Areas Using Cipher Block Chaining and Physical Layer Security
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Development of an Optimal Operation Algorithm for Food Delivery Using Drones Considering Time Interval between Deliveries

1
Department of Hotel and Tourism Management, College of Hospitality and Tourism, Sejong University, 209 Neungdong-ro, Gwangjin-gu, Seoul 05006, Republic of Korea
2
School of Industrial and Management Engineering, Korea University, 145 Anam-ro, Seongbuk-gu, Seoul 02841, Republic of Korea
3
Department of Industrial and Management Engineering, Daejin University, 1007 Hoguk-ro, Pocheon-si 11159, Gyeonggi-do, Republic of Korea
*
Author to whom correspondence should be addressed.
Submission received: 8 April 2024 / Revised: 28 May 2024 / Accepted: 28 May 2024 / Published: 30 May 2024
(This article belongs to the Special Issue Advances of Drones in Logistics)

Abstract

:
These days, many attempts are being made worldwide to use drones for food delivery. Especially in the case of food, fast delivery is required, while maintaining its temperature and taste to the maximum. Therefore, using drones is suitable for food delivery because they can move through the air without being affected by traffic congestion. In this study, the purpose is to develop an optimal algorithm that can complete the delivery of customer food orders in the shortest time using drones. We have applied mathematical-model-based optimization techniques to develop an algorithm that reflects the given problem situation. Since the delivery capacity of drones is limited, and especially small, multiple drones may be used to deliver the food ordered by a particular customer. What is important here is that the drones assigned to one customer must arrive consecutively within a short period of time. This fact is reflected in this mathematical model. In the numerical example, it can be confirmed that the proposed algorithm operates optimally by comparing a case where the arrival time of multiple drones assigned to one customer is limited to a certain time and a case when it is not.

1. Introduction

As COVID-19 becomes endemic, traditional industries, such as production, manufacturing, distribution, and tourism, are recovering, but labor shortages are deepening as digital transformation spreads and various types of jobs increase. In addition, the market for food delivery through app/web has rapidly expanded, due to the unavailability of face-to-face services during the COVID-19 pandemic, and many people who lost their jobs in other industries became engaged in food delivery. However, since the end of the COVID-19 pandemic, many people who were engaged in food delivery have moved to other industries, leading to a shortage of people willing to deliver food. Ultimately, food delivery has faced the problem of labor shortages, like traditional industries [1,2,3].
As a solution to this labor shortage, various efforts are being made to use robots instead of humans. Manufacturing plants are expanding the application of industrial robots that have been used in the past, and processes previously performed by humans, such as inspection, are being performed using artificial intelligence (AI) [4]. In the case of cleaning, like the use of household robot vacuum cleaners, industrial cleaning robots equipped with artificial intelligence are also used to clean airports and ports [5]. Similarly, in the logistics industry, self-driving logistics robots have spread and are now commonly used, and various efforts are being made to solve labor shortages through robots [6].
Recently, DoorDash, an American food delivery platform in San Francisco, United States, is said to be starting drone delivery in the United States, together with Wing, a drone company based in Palo Alto, United Statesoperated by Google’s parent company, Alphabet, based in Mountain View, United States. In March 2024, DoorDash announced a partnership with Wing to deliver food from the American fast food chain Wendy’s by drone. DoorDash has already piloted drone delivery in Australia with Wing. DoorDash subscribers can choose drone delivery as an option when ordering food from certain Wendy’s stores in Virginia, with delivery typically being completed within 30 min. At this time, in order to receive food delivery, there must be a small open space within 2 m of the customer’s house, and there must be no obstacles such as trees. Additionally, due to limitations in the weight that drones can deliver at once, up to three drones are said to be matched to one order.
To deliver food using drones, an operating system should be established based on an optimization algorithm so that an appropriate number of drones can efficiently carry out food delivery orders. In this study, we aim to develop an optimal algorithm for food delivery using drones that can process customers’ food delivery orders in the minimum completion time possible.
A variety of industries are using drones to perform logistics and delivery tasks [7], which are greatly helpful in improving existing infrastructure and increasing efficiency [8]. Delivery using drones differs from conventional truck delivery, in that drones have a limited payload weight and battery capacity and can travel at a constant speed (high speed) regardless of traffic congestion. Therefore, a distinguished operational approach is required to manage drone-based delivery systems [9]. Sajid et al. [10] dealt with the routing and scheduling (the sequence of route operations) problem using mixed-integer linear programming. The payload and battery capacity of the UAV were considered, and a hybrid genetic and simulated annealing (HGSA) approach was presented to solve the problem. Yu et al. [11] introduced the scheduling problem of multiple drones, assuming a situation where customer demand occurs stochastically. It was difficult to determine the number of individual drone deliveries when demand was not deterministic, because the capacity of drones is limited. The performance of the proposed algorithm was verified through simulation. Nishira et al. [12] addressed the FSTSP (Flight-Speed-Aware Traveling Salesman Problem), which included the assumption that the flight speed of a delivery drone changes depending on the load. This problem is generally difficult to solve with a conventional solver application, because the function of drone flight speed is complex. Accordingly, they approximated the function of drone flight speed and converted the problem into integer programming that could be solved with a general-purpose solver. Delivery with drones is an effective way to increase efficiency and reduce costs. However, drones have a limited delivery range due to the fact that their battery capacity and payload is not large. Due to these limitations, studies on integrating conventional trucks and drones in delivery are underway [13]. The cooperation between trucks and drones can shorten delivery times and reduce fuel consumption [14]. Delivery using drones has the advantage of being environmentally friendly compared to delivery using conventional trucks. From this sustainability perspective, research has also been conducted to derive delivery routes that can minimize carbon emissions when deliveries are performed using both trucks and drones [15]. Ko et al. [16] conducted a study on restricting drone flight paths to mitigate the risk of accidental falling. The integrated operations of UGVs (unmanned ground vehicles) and UAVs (unmanned aerial vehicles) differentiate the delivery methods based on the types of goods being delivered and the topographical characteristics. Lu et al. [17] proposed a drone–rider joint delivery mode through multi-distribution center collaboration in the takeout delivery process. They showed that the efficiency can be improved by using the affinity propagation clustering algorithm and the improved tabu search algorithm.
Since customer demand for food delivery varies greatly depending on time and region, shortages or surpluses of delivery drivers can occur. Therefore, optimizing the delivery schedule of drivers for food delivery has been considered important. The studies introduced below have dealt with cases where food is delivered using ground transportation, such as cars or motorcycles. Xue et al. [18] introduced a two-stage model to address this issue. In the first stage, the delivery routes and the required number of delivery drivers of each sub-region during each time period were determined. Following that, the delivery drivers were allocated to specific sub-regions during specific time periods in the second stage. It was found that the delivery process can be completed more rapidly with a reduced number of delivery drivers. In regard to the food delivery issue, the main goal is fast and prompt delivery in order to maintain the freshness of the food. Therefore, most food delivery problems deal with minimizing the delivery time as an objective. In addition, studies were conducted with various goals, such as the fair distribution of delivery tasks, minimizing operating cost, delivery distance, or carbon emissions. Martínez-Sykora et al. [19] proposed a multi-objective problem with the additional goal of equitably distributing the delivery tasks to each delivery person. They developed an integer linear programming model and derived several pareto optimal solutions. Liao et al. [20] dealt with the green meal delivery routing problem (GMDRP), integrating the food delivery and vehicle routing problems. They proposed a multi-objective scheduling model, minimizing the operating costs and carbon emissions. In the first stage, the required number of delivery drivers was determined, and, in the second stage, the initial solution was improved to derive the optimal number of delivery drivers and delivery routes. As follows, the general food delivery services involve a delivery driver visiting one restaurant and delivering food to one or more customers. Steever et al. [21] addressed the issue where a single customer can order from multiple restaurants at once. They defined this new problem as the virtual food court delivery problem (VFCDP). Food ordered from multiple restaurants by a single customer might be delivered all at once by one delivery driver (non-split delivery) or might be delivered separately by multiple delivery drivers (split delivery). A mixed integer linear programming approach was formulated to solve this problem. Moreover, an auction-based heuristic method was developed to reflect dynamic situations. As a result of various numerical experiments, it was found that a non-split delivery method completes the delivery before the last food arrives in the case of split delivery.
Delivery processes by a person using ground transportation may encounter delays due to traffic congestion, unexpected accidents, and other logistical challenges. Following this, the utilization of drones for delivery presents a potential solution to these issues [22]. Therefore, the utilization of drones for delivery is being increasingly applied across various industries. Particularly in the food delivery industry, the emphasis on maintaining freshness and ensuring fast delivery has led to their significant utilization. Consequently, various studies are being conducted to efficiently manage and operate this aspect. Huang et al. [22] derived a UAV food delivery schedule with a minimized delay time. The delivery tasks were clustered according to the delivery destination, and the clustered delivery tasks were split into several groups according to the UAV capacity constraints in order to determine the delivery order. Liu [23] dealt with the dynamic, infinite-horizon vehicle routing problem with two types of food (hot meals and cold drinks), as well as different sizes of orders and drones. It was assumed that different types of food cannot be carried by the same drone, while multiple orders with the same type of food can be carried on the same drone. The objective was to minimize the lateness, which is calculated as the time between placing the order and its delivery subtracted by the time it took to cook. Pinto et al. [24] discussed a network model consisting of customers, restaurants, and drone charging stations. The number and location of drone charging stations was determined, given a limited maximum time that customer can wait. The goal was to maximize the number of customers served; moreover, the more charging stations installed, the more customers can be served. However, the cost for installing charging stations is high, so it was set as a constraint. Bi et al. [25] introduced the SLSM (shared logistics service mode) to the food delivery service to lower the logistics cost and fulfill customer demands. A third-party logistics company picks up the food from several restaurants and delivers it to the customers. They compared the proposed SLSM with the existing TLSM (traditional logistics service mode) through case analysis and showed that the SLSM can reduce the logistics cost and better meet customer needs than the TLSM. Lu et al. [26] established a multi-objective, chance-constrained programming model to minimize the transportation time and cost by comprehensively considering uncertainties due to seasonality and human factors. The efficiency, effectiveness, and reliability were demonstrated using a hybrid beetle swarm optimization algorithm.
It is possible to think of the delivery scheduling problem with drones as being similar to the lateness problem and the job dispatch problem in a factory. Malve and Uzsoy [27] studied the problem of minimizing the maximum lateness on a parallel identical batch processing machine with dynamic job arrivals. Extensive computational experiments showed that the proposed GA provides a good tradeoff between solution time and performance. Chen [28] aimed to simultaneously optimize the average cycle time and maximum lateness in a wafer fabrication factory. The proposed methodology of the new rule was shown to be superior in reducing the average cycle time and maximum lateness simultaneously. Jun and Lee [29] addressed the dynamic single-machine scheduling problem to minimize the total weighted tardiness. They proposed a decision-tree-based approach for the generation of rules automatically with feature-construction- and tree-based learning. This proposed approach has been shown to outperform the existing dispatching rules. Minimizing lateness in the job dispatching problem is similar to minimizing the delivery completion time in a drone delivery system. However, in this study, we consider the maximum allowable time interval between the deliveries of a single order. To illustrate this, an order from a single customer can be thought of as a single process, and multiple processes make up the entire order. This study tries to show that, if a single process requires multiple tasks, ensuring that each of the required tasks is completed within a certain time does not have a significant impact on the overall schedule. This is an important difference between the job dispatch problem and this study.
Most of the studies on drone delivery systems have dealt with the vehicle routing problem, where one drone or multiple drones depart from a depot, visit one or several customers only once, and then return to the depot. However, since drones have limited payloads, it may not be possible to deliver all of the desired items in a single delivery. Therefore, this study addresses a drone delivery system that allows multiple drones to visit the same customer when delivery by a single drone is not possible due to the payload limitation. Especially for food delivery, it is important that multiple deliveries arrive at the same time as much as possible, therefore, this characteristic is considered to develop an optimal operation schedule for food delivery using drones.

2. Materials and Methods

2.1. Problem Description

The objective of this study is to devise an optimal algorithm for drone-based food delivery, aimed at minimizing the total completion time for delivering customers’ orders. There is a restaurant that utilizes drones for delivery services, and there are numerous customers surrounding the restaurant. The restaurant consolidates the received delivery orders and performs deliveries at regular time intervals. When a single customer orders a large amount of food that cannot be delivered by a single drone, the order is split and delivered by multiple drones. Previous research on optimal delivery scheduling using motorcycles or electric vehicles has considered the situation of picking up food from multiple restaurants or delivering food to multiple destinations. However, in the case of drones, the amount of food that can be delivered at a time is limited, so it is difficult to pick up and deliver food from multiple restaurants together. Therefore, this study focuses on a single restaurant.
Figure 1 illustrates the problem context of this study. The numbers within the gray rectangle are the customer numbers, and the numbers within the circles indicate the delivery sequence for each drone. The blue drone loads food from the restaurant and visits Customer 7 first. After completing the delivery to Customer 7 and returning to the restaurant, it loads food again and visits Customer 4, followed by Customer 3. Customers 1, 2, 5, 6, and 7 order a small amount of food, so one drone makes only one delivery. On the other hand, Customers 3 and 4 order a large amount of food that cannot be delivered by a single drone. Therefore, 2 drones make a delivery for Customer 3, and 3 drones for Customer 4. For example, for Customer 4, the blue and green drones each make a second delivery, while the red drone makes a third delivery, resulting in a total of three separate deliveries for Customer 4. Of course, the same drone can also make 2 deliveries in sequence.
Given the nature of food items, ensuring that multiple deliveries are consolidated and delivered simultaneously within a similar time period is important above all else. Therefore, in cases of split food delivery, there is an additional consideration to limit the maximum allowable time intervals between each delivery, enabling the customers to receive their food all at once, as much as possible. By doing so, the customers can enjoy the convenience of receiving their food orders, thereby enhancing their overall satisfaction with the service provided. This not only helps in optimizing the operational efficiency, but also contributes significantly to customer experience and loyalty.

2.2. Mathematical Model

  • Set and Index
I Set of customers
J Set of delivery orders
K Set of drones
v Last element of set J
  • Parameters
d i Demand (order volume) of customer i
s Capacity of a drone
t o i Travel time from restaurant to customer i
t d Time for unloading food
t b Time for loading food
t m Maximum allowable time interval between deliveries for customer i
M Positive large number
  • Variables
t i , j k Arrival time of drone k at customer i on j t h visit
t s j k j t h departure time of drone k at restaurant
t m a x The time at which all drones complete their final customer service and return to the restaurant
y i , j k Binary   decision   variable ;   it   is   equal   to   1   if   a   drone   k K serves
customer i I on j t h visit
Equation (1) is an objective function that minimizes the time at which all drones complete their final customer service and return to the restaurant.
min t m a x
Equation (2) represents a constraint where t m a x ensures the maximum value among the time that each drone returns to the restaurant after completing its delivery to a customer. In other words, it denotes the arrival time of the last drone returning to the restaurant. t i , j k is the time that each drone arrives at the customer, t d is the time it takes to unload the food, and t o i is the travel time from the customer to the restaurant. Therefore, the left-hand side of Equation (2) can take on many values, but it represents the time that each drone takes to arrive at the customer, unload the food, and return to the restaurant. The delivery completion time ( t m a x ) should be equal to or greater than the sum of these values and will eventually equal the largest value of the time that each drone returned to the restaurant. Equation (3) limits the number of deliveries made by the drones to each customer. In cases where the demand exceeds the payload capacity of a single drone, an order is divided and delivered by multiple drones. Equation (4) means that the drone can deliver food to only one customer at a time. Equation (5) states that, for a drone to receive a delivery assignment in the next sequence, it should perform a delivery in the current sequence.
t i , j k + t d + t o i t m a x               i ,   k
d i s j J k K y i , j k                     i
i I y i , j k 1               j ,   k
i I y i , j k i I y i , j + 1 k               j J { v } ,   k
Equation (6) means that the initial departure time from the restaurant for all drones occurs after loading food. Equations (7)–(9) represent constraints regarding the departure time from the restaurant in a sequence of drone deliveries. The relationship between the current drone delivery departure time from the restaurant and the next departure time, as perceived from the restaurant’s perspective, and the relationship between the time of arrival at the current customer and the time of arrival at the next customer, as perceived from the drones’ perspective, are comprehensively addressed. The calculation for t i , j k is expressed by Equations (8) and (9). Equation (8) indicates that the time that the drone arrives at the customer is after the sum of the time that the drone departs from the restaurant and the time it travels from the restaurant to the customer. Equation (9) indicates that the time that the drone departs from the restaurant to the customer is after the sum of the time that the drone arrives at the customer with the previous order, the time that it unloads the food, the time that it returns from the customer to the restaurant, and the time that it loads the new food.
t s 1 k = t b               k
t s j + 1 k t s j k + y i , j k · 2 · t o i + t d + t b             i ,   j J { v } ,   k
t s j k + t o i t i , j k + M · 1 y i , j k             i ,   j ,   k
t i , j k + t d + t o i + t b t s j + 1 k + M · 1 y i , j k               i ,   j J v ,   k i ,   i ,   j J { v } ,   k
Equation (10) is applied when considering the maximum allowable time interval between deliveries in cases where a single order needs to be split for delivery due to the payload capacity limit of the drone. Equation (11) is a non-negativity constraint.
t i , j k t i , j k d i s · t m + M · 2 y i , j k y i , j k               i ,   j , j ,   k ,   k
t i , j k ,   t s j k ,   t m a x 0               i ,   j ,   k  
In this study, a mixed integer linear programming (MILP) algorithm is used. To derive the optimal solution, it utilizes IBM ILOG CPLEX Optimization Studio. This method is widely used in scheduling research in the field of logistics and smart factories, and it has been proven in many studies that the solutions derived are optimal.

3. Results

For the numerical experiments, there are total of 100 customers, with food demand for delivery occurring for 10 of them at a specific time. The locations of the restaurant and customers are shown in Figure 2. The blue circles represent customers with demand, and the numbers indicate the customer IDs. The gray circles mean customers with no demand. The food delivery demand per customer is as shown in Table 1.
It is assumed that delivery is possible to customers within 2 km east, west, north, and south of the restaurant. The speed of the drone is set to 36 km/h, referencing the top speed of Amazon’s delivery drones (80.5 km/h) [30], and the travel time is calculated based on that. Table 2 represents the system parameters for the numerical experiments.
The restaurant uses a total of five drones for food delivery and the payload of each drone is two. Therefore, one drone is assigned to Customers 1, 2, 3, and 4; two drones perform the delivery for Customers 5, 6, 7, and 8; and three drones are allocated for Customers 9 and 10. The loading of the food by a drone takes 40 s, while unloading takes 30 s.
Numerical experiments are performed for the following two cases considering the payload limit of a drone, where one order is allocated to multiple drones.
  • Case 1: Without considering the maximum allowable time interval between deliveries.
  • Case 2: Considering the maximum allowable time interval between deliveries.
The maximum allowable time interval between deliveries is set at 60 s. Therefore, according to Equation (11), the maximum time interval between the first and last delivery is 120 s for two deliveries, and 180 s for three deliveries. The proposed MILP is solved with the commercial mathematical optimization software CPLEX 22.1.

3.1. Case 1

For Case 1, the sequence of customer visits and arrival times for each drone are shown in Table 3. Since 5 drones perform a total of 18 deliveries, 3 drones complete 4 deliveries each, while the remaining 2 drones complete 3 deliveries each. The time at which all of the drones complete their final customer service and return to the restaurant is 1472.32 s, and the last drone to return is Drone 1.
For Customer 10, with a demand of five and a drone payload capacity of two, a total of three drones perform the delivery. The first food delivery occurs 261.59 s after the order is placed, followed by the second delivery 971.95 s later, and the final delivery is made at 1167.63 s later. Thus, there is an approximate 15-min waiting time between receiving the first delivery and the last delivery. Likewise, Customer 5 has a demand of three, requiring two drones for delivery. The initial food delivery takes place at 492.60 s after the order placement, with the final delivery being completed by 1325.00 s. Consequently, an approximate 13-min waiting time ensues between the deliveries. When an order, especially for food, is divided into multiple deliveries, the customers prefer these deliveries to occur at similar times, if possible.

3.2. Case 2

For Case 2, the sequence of customer visits and arrival times for each drone are detailed in Table 4. All of the drones conclude their final customer service and return to the restaurant at 1503.44 s after the first drone departs from the restaurant.
In this case, the time interval between the first and last deliveries should not exceed 180 s for Customers 9 and 10, who receive their deliveries in three separate shipments. Similarly, for Customers 5, 6, 7, and 8, who receive their delivery in two separate shipments, it is ensured that the maximum time interval should not exceed 120 s. Customers 6 and 8 receive all of their food deliveries simultaneously, with the two drones visiting them first. Accordingly, there is no waiting time incurred, despite the food deliveries being divided. For Customer 10, all of their deliveries are assigned to the final customer of Drones 3, 4, and 5, with only approximately 48 s of waiting time occurring between the two deliveries. Compared to the approximate 15-min waiting time in Case 1, there have been remarkably significant improvements. The time that the drone returned to the restaurant after serving the last customer is about 31 s later than that seen in Case 1.

3.3. Sensitivity Analysis

A sensitivity analysis was conducted to verify how the optimal operation schedule of drones changes as the number of drones for delivery changes.
Table 5 shows the results of Case 1 with six drones, where each drone made three deliveries. At this point, the last time that all of the drones completed their delivery tasks and returned to the restaurant was 1230.95 s, approximately 4 min faster than when there were five drones. Additionally, for Customer 10, the delivery was made in three separate shipments, with Drone 1 making the initial delivery and Drone 4 making consecutive deliveries twice. The first and second deliveries occurred at 187.64 s at the same time, while the final delivery was completed at 955.23 s, resulting in waiting time exceeding 11 min.
The results of Case 2 with six drones are shown in Table 6. The time for the last drone to return after completing its delivery was 1250.92 s. Considering the maximum allowable time intervals between the deliveries in the split delivery scenario, the delivery was completed approximately 20 s later than that seen in Case 1. However, there are differences in the drone’s sequence of customer visits. In Case 1, Customer 9 was the last destination for Drone 1, the last for Drone 5, and the first for Drone 6. In Case 2, on the other hand, all three drones (Drone 2, 3, and 6) visited Customer 9 as their second destination. In this case, the waiting time between the first delivery and the last delivery for Customer 9 was less than 3 min. Thus, by optimizing the drone’s sequence of customer visits, it is possible to reduce the waiting time between the split deliveries without increasing the overall delivery completion time.
Table 7 presents the results of Case 1 when operating four drones. Drones 1 and 2 each completed five deliveries, while Drone 3 and 4 each completed four deliveries, resulting in a delivery completion time of 1838.3 s. When compared to Case 1 with five drones, it increased by about 6 min. For Customer 10, the first food was delivered by Drone 1 at 187.64 s, and the last one was delivered by Drone 4 at 1643.22 s, resulting in a waiting time between deliveries of approximately 24 min.
Table 8 shows the results for Case 2 when the number of drones was four. The completion time at which all of the drones finished their deliveries and returned to the restaurant was 1847.28 s. Among the customers receiving their deliveries separately, all except Customer 9 received their deliveries within one minute after receiving the first delivery. For Customers 4 and 6, there was a 104-s time interval between the first and last deliveries.
In this manner, when deliveries are divided due to drone payload limitations, setting the maximum allowable time interval between the first and last deliveries may increase the overall delivery completion time. However, considering the characteristics of food delivery, ensuring that the deliveries arrive together within a certain time period may enhance customer satisfaction.

4. Discussion

This study aims to derive an optimal operation schedule for food delivery using drones while minimizing the delivery completion time. Two cases are examined based on whether the maximum allowable time interval between deliveries is considered for multiple deliveries to a customer.
Table 9 represents how the delivery completion time changes depending on the number of drones operated. As the number of drones for deliveries increased by one, the delivery completion time decreased by approximately 4 to 6 min. The results show that increasing the number of drones in operation is effective in reducing the delivery completion time. However, in practice, increasing the number of drones for delivery will not only have the advantage of reducing the delivery completion time, but also disadvantages such as increased operating and management costs and increased environmental impact. It is important to balance these various factors in order to find the optimal delivery schedule using drones.
Considering the maximum allowable time interval between the deliveries, in Case 2, it was observed that the delivery completion time increases. However, when comparing Case 1, where the maximum allowable time interval between deliveries is not considered, with the scenario where there are four drones, the difference is minimal, being approximately around 9 s and up to about 31 s for five drones, representing a mere 2% variance. Given that the delivery completion time ranges from 20 to 30 min, depending on the number of drones in operation, this discrepancy appears to be quite insignificant. After analyzing these results, it becomes evident that the impact of the maximum allowable time interval between deliveries on the overall delivery completion time is relatively minor. This finding emphasizes the resilience of the delivery system to adapt to varying operational challenges. Furthermore, this indicates that the drone fleet can manage a delivery schedule even with slight adjustment in delivery completion times.
Table 10 indicates the waiting time between the deliveries of each customer. Considering the maximum allowable time interval between the deliveries (Case 2), it is evident that the waiting time between the deliveries for most customers decreases. For example, when there are four drones, the waiting time between the deliveries for all customers significantly decreases. Customer 10, who, in Case 1, waits approximately 24 min between the deliveries of the first and last food, experiences deliveries spaced only 6 s apart in Case 2. Similarly, Customer 9, who, in Case 1, waits about 22 min to receive all foods, received all food simultaneously in Case 2. This demonstrates that, in Case 2, the quality of service can be improved from the customer’s perspective. Moreover, in Case 1, there is a larger variation in the waiting time between the deliveries for each customer compared to Case 2. Such disparity among customers can be a contributing factor to customer dissatisfaction and has a significant impact on the quality of customer service.

5. Conclusions

A food delivery system where a restaurant utilizes drones was addressed in this study. An optimal delivery schedule for the drone was determined, including minimizing the delivery completion time. One of the major differences between drones and traditional delivery vehicles like conventional trucks or motorcycles is their payload capacity. Generally, drones can carry a maximum weight of around 5 lbs, making it challenging to deliver large amounts of food orders with just one drone. Therefore, in such cases, two or more drones are utilized to perform split deliveries. While split deliveries may not pose significant issues for general goods, the nature of food items, as addressed in this study, emphasizes the importance of minimizing the waiting time between split deliveries to ensure that the customer receives their food together as much as possible. If a customer should wait for a certain amount of time between each split delivery, it could significantly impact customer satisfaction. This effect would be even more noticeable for hot food items. Reducing the wait time not only contributes to improved customer satisfaction, but also enhances the overall quality of the service provided by the food delivery system.
To address this problem, a mathematical model was developed, and the results were analyzed through numerical examples. The operation of five drones was assumed as the baseline, and a sensitivity analysis was performed for cases with four and six drones. When considering the maximum allowable time interval between split deliveries, there was a slight increase in the delivery completion time. Furthermore, when considering the maximum allowable time interval between split deliveries, there was a significant decrease in the waiting time between the first and last food deliveries for customers. Through this, it has been confirmed that it is possible to derive delivery schedules that can improve customer satisfaction without significantly increasing the delivery completion time. By optimizing the allocation and sequence of drones and considering the maximum allowable time interval between deliveries, a more efficient and customer-friendly delivery system can be established. This not only enhances the overall quality of the service, but also contributes to customer loyalty and retention. Therefore, implementing such refined delivery schedules holds great potential for fostering positive customer experience and sustaining a competitive advantage in the market.
The contribution of this study can be explained as follows: When considering the vehicle routing problem, commonly addressed in traditional delivery problems, it is difficult to adequately reflect the characteristics of drones, which are typically limited to carrying relatively lightweight items. This study aims to address this gap by considering the payload capacity restriction inherent to drones. Specifically, it considers where orders exceeding the drone’s capacity are split into multiple deliveries, thus providing a more realistic reflection of drone delivery operations. Moreover, the maximum allowable time interval between deliveries has been considered, reflecting the characteristics of food items in the delivery process. This allowed us to minimize the delivery completion time, while ensuring that the customers receive their food deliveries in a similar time period as much as possible. As a result, deriving the optimal food delivery schedule not only minimizes the delivery completion time, thereby efficiently operating the restaurant, but also enhances customer satisfaction.
The limitations of this study are, firstly, that it only focused on delivering food using drones. As further research, an integrated food delivery system that combines traditional manned vehicles like cars and motorcycles with unmanned vehicles like drones and UGVs will be discussed. Electric unmanned vehicles, such as UGVs, offer similar efficiency and environmental benefits to drones. Delivery conducted using cars or motorcycles is affected by road conditions and can have adverse effects on traffic systems, however, it offers the advantage of efficient delivery due to no capacity constraints. Additionally, UGVs can be deployed in areas that are inaccessible to cars or motorcycles for delivery. We have planned to conduct research on determining the optimal delivery schedule and the required number of each delivery vehicle when integrating various means of transportation for delivery. The second limitation is that the problem situation addressed did not reflect the real-world situation. This study focused on the fact that even if the maximum allowable time interval between deliveries is considered to improve the quality of customer service, it does not significantly affect the delivery completion time. As this is one of the first studies to use multiple drones in a single order, it is basic and does not reflect a variety of real-world situations. If real-world locations are used as a case study, different urban environments can affect the results. The same is true for battery issues and uncertain situations. In future works, we plan to conduct research in real-world locations, considering battery issues, such as battery life and management, and uncertain situations, such as delivery delays or unexpected obstacles.

Author Contributions

Conceptualization, Y.O. and Y.D.K.; methodology, Y.K.K. and Y.D.K.; software, H.H.; validation, Y.O. and Y.D.K.; formal analysis, Y.K.K. and H.H.; investigation, Y.K.K. and H.H.; resources, Y.D.K.; data curation, Y.K.K.; writing—original draft preparation, Y.K.K. and H.H.; writing—review and editing, Y.O. and Y.D.K.; visualization, Y.K.K. and H.H.; supervision, Y.D.K.; project administration, Y.D.K.; funding acquisition, H.H. and Y.D.K. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the Institute of Information and communications Technology Planning and Evaluation (IITP) under the metaverse support program to nurture the best talents (IITP-2024-RS-2023-00254529) grant funded by the Korean government (MSIT). This work was also supported by the Ministry of Education of the Republic of Korea and the National Research Foundation of Korea (NRF-2023S1A5A2A01081289). This research was further supported by the BK21 FOUR, funded by the Ministry of Education of Korea and National Research Foundation of Korea.

Data Availability Statement

Dataset available on request from the authors.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Pyo, J.; Park, E.J.; Ock, M.; Lee, W.; Lee, H.J.; Choi, S. How has COVID-19 affected the work environment of delivery workers?: An interpretative phenomenological analysis. PLoS ONE 2023, 18, e0290403. [Google Scholar] [CrossRef] [PubMed]
  2. Larue, B. Labor issues and COVID-19. Can. J. Agric. Econ. 2020, 68, 231–237. [Google Scholar] [CrossRef]
  3. Huang, H. Riders on the storm: Amplified platform precarity and the impact of COVID-19 on online food-delivery drivers in China. J. Contemp. China 2022, 31, 351–365. [Google Scholar] [CrossRef]
  4. Arinez, J.F.; Chang, Q.; Gao, R.X.; Xu, C.; Zhang, J. Artificial intelligence in advanced manufacturing: Current status and future outlook. J. Manuf. Sci. Eng. 2020, 142, 110804. [Google Scholar] [CrossRef]
  5. Liao, T.I.; Chen, S.S.; Lien, C.C.; Lin, H.C.; Lu, M.F.; Chen, W.P. Development of a high-endurance cleaning robot with scanning-based path planning and path correction. Microsyst. Technol. 2021, 27, 1061–1074. [Google Scholar] [CrossRef]
  6. Bogue, R. Warehouse robot market boosted by Covid pandemic and technological innovations. Ind. Rob. Int. J. Robot. Res. Appl. 2022, 49, 181–186. [Google Scholar] [CrossRef]
  7. Campbell, J.F.; Sweeney, D.; Zhang, J. Strategic design for delivery with trucks and drones. Supply Chain. Anal. Rep. SCMA 2017, 47–55. [Google Scholar]
  8. Chiang, W.C.; Li, Y.; Shang, J.; Urban, T.L. Impact of drone delivery on sustainability and cost: Realizing the UAV potential through vehicle routing optimization. Appl. Energy 2019, 242, 1164–1175. [Google Scholar] [CrossRef]
  9. Chen, H.; Hu, Z.; Solak, S. Improved delivery policies for future drone-based delivery systems. Eur. J. Oper. Res. 2021, 294, 1181–1201. [Google Scholar] [CrossRef]
  10. Sajid, M.; Mittal, H.; Pare, S.; Prasad, M. Routing and scheduling optimization for UAV assisted delivery system: A hybrid approach. Appl. Soft. Comput. 2022, 126, 109225. [Google Scholar] [CrossRef]
  11. Yu, N.; Dong, B.; Qu, Y.; Zhang, M.; Wang, Y.; Dai, H.; Yao, C. Drones Routing with Stochastic Demand. Drones 2023, 7, 362. [Google Scholar] [CrossRef]
  12. Nishira, M.; Ito, S.; Nishikawa, H.; Kong, X.; Tomiyama, H. An Integer Programming Based Approach to Delivery Drone Routing under Load-Dependent Flight Speed. Drones 2023, 7, 320. [Google Scholar] [CrossRef]
  13. Bi, Z.; Guo, X.; Wang, J.; Qin, S.; Liu, G. Deep reinforcement learning for truck-drone delivery problem. Drones 2023, 7, 445. [Google Scholar] [CrossRef]
  14. Rinaldi, M.; Primatesta, S.; Bugaj, M.; Rostáš, J.; Guglieri, G. Development of Heuristic Approaches for Last-Mile Delivery TSP with a Truck and Multiple Drones. Drones 2023, 7, 407. [Google Scholar] [CrossRef]
  15. Es Yurek, E. Impact of Drone Battery Recharging Policy on Overall Carbon Emissions: The Traveling Salesman Problem with Drone. Drones 2024, 8, 108. [Google Scholar] [CrossRef]
  16. Ko, Y.K.; Park, J.H.; Ko, Y.D. A Development of Optimal Algorithm for Integrated Operation of UGVs and UAVs for Goods Delivery at Tourist Destinations. Appl. Sci. 2022, 12, 10396. [Google Scholar] [CrossRef]
  17. Lu, F.; Jiang, R.; Bi, H.; Gao, Z. Order Distribution and Routing Optimization for Takeout Delivery under Drone–Rider Joint Delivery Mode. J. Theor. Appl. Electron. Commer. Res. 2024, 19, 774–796. [Google Scholar] [CrossRef]
  18. Xue, G.; Wang, Z.; Wang, G. Optimization of rider scheduling for a food delivery service in O2O business. J. Adv. Transp. 2021, 2021, 5515909. [Google Scholar] [CrossRef]
  19. Martínez-Sykora, A.; McLeod, F.; Cherrett, T.; Friday, A. Exploring fairness in food delivery routing and scheduling problems. Expert Syst. Appl. 2024, 240, 122488. [Google Scholar] [CrossRef]
  20. Liao, W.; Zhang, L.; Wei, Z. Multi-objective green meal delivery routing problem based on a two-stage solution strategy. J. Clean Prod. 2020, 258, 120627. [Google Scholar] [CrossRef]
  21. Steever, Z.; Karwan, M.; Murray, C. Dynamic courier routing for a food delivery service. Comput. Oper. Res. 2019, 107, 173–188. [Google Scholar] [CrossRef]
  22. Huang, H.; Hu, C.; Zhu, J.; Wu, M.; Malekian, R. Stochastic task scheduling in UAV-based intelligent on-demand meal delivery system. IEEE Trans. Intell. Transp. Syst. 2021, 23, 13040–13054. [Google Scholar] [CrossRef]
  23. Liu, Y. An optimization-driven dynamic vehicle routing algorithm for on-demand meal delivery using drones. Comput. Oper. Res. 2019, 111, 1–20. [Google Scholar] [CrossRef]
  24. Pinto, R.; Zambetti, M.; Lagorio, A.; Pirola, F. A network design model for a meal delivery service using drones. Int. J. Logist. Res. Appl. 2020, 23, 354–374. [Google Scholar] [CrossRef]
  25. Bi, H.; Zhu, X.; Lu, F.; Huang, M. The meal delivery routing problem in e-commerce platforms under the shared logistics mode. J. Theor. Appl. Electron. Commer. Res. 2023, 18, 1799–1819. [Google Scholar] [CrossRef]
  26. Lu, F.; Chen, W.; Feng, W.; Bi, H. 4PL routing problem using hybrid beetle swarm optimization. Soft Comput. 2023, 27, 17011–17024. [Google Scholar] [CrossRef]
  27. Malve, S.; Uzsoy, R. A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families. Comput. Oper. Res. 2007, 34, 3016–3028. [Google Scholar] [CrossRef]
  28. Chen, T. An effective dispatching rule for bi-objective job scheduling in a wafer fabrication factory—Considering the average cycle time and the maximum lateness. Int. J. Adv. Manuf. Technol. 2013, 67, 1281–1295. [Google Scholar] [CrossRef]
  29. Jun, S.; Lee, S. Learning dispatching rules for single machine scheduling with dynamic arrivals based on decision trees and feature construction. Int. J. Prod. Res. 2021, 59, 2838–2856. [Google Scholar] [CrossRef]
  30. Jung, S.; Kim, H. Analysis of amazon prime air uav delivery service. J. Knowl. Inf. Technol. Syst. 2017, 12, 253–266. [Google Scholar]
Figure 1. Example of food delivery using drones.
Figure 1. Example of food delivery using drones.
Drones 08 00230 g001
Figure 2. The location of the restaurant and customers.
Figure 2. The location of the restaurant and customers.
Drones 08 00230 g002
Table 1. Food demand for delivery.
Table 1. Food demand for delivery.
Customer12345678910
Demand1122334455
Table 2. System parameters.
Table 2. System parameters.
I J K s t d t b t m M
1045240 s30 s60 s10,000
Table 3. Results for Case 1 when the number of drones is five.
Table 3. Results for Case 1 when the number of drones is five.
DroneCustomerArrival Time (s)
110585187.64522.60923.801325.00
2110107229.22656.071041.341346.58
3368 238.34711.891200.96
4949 261.59698.421167.63
56297225.20580.38971.951351.14
Delivery completion time1472.32
Table 4. Results for Case 2 when the number of drones is five.
Table 4. Results for Case 2 when the number of drones is five.
DroneCustomerArrival Time (s)
16975225.20721.991101.181356.12
26325225.20698.751067.071334.38
341710197.62634.46981.281286.53
48910 253.87779.331238.55
58910 253.87779.331238.55
Delivery completion time1503.44
Table 5. Results for Case 1 when the number of drones is six.
Table 5. Results for Case 1 when the number of drones is six.
DroneCustomerArrival Time (s)
11059187.64522.60931.51
2826253.87637.73992.91
3738107.61463.56965.77
410106187.64572.91995.75
5719107.61454.43955.23
6954261.59670.501015.45
Delivery completion time1230.95
Table 6. Results for Case 2 when the number of drones is six.
Table 6. Results for Case 2 when the number of drones is six.
DroneCustomerArrival Time (s)
1387238.34740.561112.04
25910137.33546.241005.46
3697225.20721.991101.18
4182229.22722.301106.16
56410225.20658.031053.29
65910137.33546.241005.46
Delivery completion time1250.92
Table 7. Results for Case 1 when the number of drones is four.
Table 7. Results for Case 1 when the number of drones is four.
DroneCustomerArrival Time (s)
11010529187.64572.91907.871175.181566.75
267487225.20568.01883.241344.731716.21
39395 261.59771.511281.441690.36
486110 253.87742.951207.361634.22
Delivery completion time1838.33
Table 8. Results for Case 2 when the number of drones is four.
Table 8. Results for Case 2 when the number of drones is four.
DroneCustomerArrival Time (s)
198752261.59787.051158.521413.461680.77
2367510238.34711.891054.691309.631644.59
396110 261.59758.371222.791649.65
498410 261.59787.051248.541643.80
Delivery completion time1847.28
Table 9. Difference in delivery completion time ( t m a x ) based on the number of drones.
Table 9. Difference in delivery completion time ( t m a x ) based on the number of drones.
Number of DronesCase 1 (s)Case 2 (s)Difference (s)Difference (%)
41838.331847.288.950.49%
51472.321503.4431.122.16%
61230.951250.9219.971.66%
Table 10. The waiting time between deliveries.
Table 10. The waiting time between deliveries.
Customer4 Drones (s)5 Drones (s)6 Drones (s)
Case 1Case 2Case 1Case 2Case 1Case 2
5782.48103.83802.4021.74147.900.00
6517.7446.49486.680.002.840.00
71148.20103.834.56119.900.0010.85
81090.860.00277.160.00711.9018.25
91305.160.00906.0557.34693.64175.75
101446.585.85853.7047.97385.2747.82
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Ko, Y.K.; Han, H.; Oh, Y.; Ko, Y.D. The Development of an Optimal Operation Algorithm for Food Delivery Using Drones Considering Time Interval between Deliveries. Drones 2024, 8, 230. https://0-doi-org.brum.beds.ac.uk/10.3390/drones8060230

AMA Style

Ko YK, Han H, Oh Y, Ko YD. The Development of an Optimal Operation Algorithm for Food Delivery Using Drones Considering Time Interval between Deliveries. Drones. 2024; 8(6):230. https://0-doi-org.brum.beds.ac.uk/10.3390/drones8060230

Chicago/Turabian Style

Ko, Young Kwan, Hyeseon Han, Yonghui Oh, and Young Dae Ko. 2024. "The Development of an Optimal Operation Algorithm for Food Delivery Using Drones Considering Time Interval between Deliveries" Drones 8, no. 6: 230. https://0-doi-org.brum.beds.ac.uk/10.3390/drones8060230

Article Metrics

Back to TopTop