Optimal food delivery

MATH 406
HengFinal
Yue project
Runzhou Zhu
Shenghang Ma
Preliminary investigation
• Focus on the lunch rush
hour (11:00 am ~2:00
pm).

• Around 20~40 orders

come in every minute.

• Suppose we have 100

staffs.

• Search for the outline

of Yushan Town.

• Locate the
communities with
considerable
population density.
Additional resources
used:
Baidu image
Preliminary investigation
Add grid lines to estimate the location of those
communities.

Similarly, locate the most popular restaurants

around each community based on their sales
data.

Additional resources
used:
Baidu map
Meituan mobile app
The fixed staff model
• Every staff is now assigned a target restaurant.
• For a set time interval, one laborer will collect all the orders
from a restaurant and then set off.
• The staff will travel between communities with the same
order as the orders received.
 Models’ response to different parameters
1st model Successful delivery rate Average waiting time (min) Average Max. waiting time (min)

Original state 23.4% 19.1 37.4

100 → 1000 staff 57.8% 16.3 39.7

10 → 15 min 26.0% 24.0 42.0

 Models’ response to different parameters
2nd model Successful delivery rate Average waiting time (min) Average Max. waiting time (min)

Original state 20.6% 21.4 47.3

100 → 300 staff 31.5% 20.4 47.5

10 → 15 min 22.4% 26.1 52.2

Models’ response to different parameters
3rd model Successful delivery rate

Original state 31.7%

100 → 200 staff 100%

10 → 15 min 39.7%
Thanks for listening!