Özet:

Today, restaurants derive a significant portion of their income from online food orders. Most of the orders are delivered to customers via motor couriers. While delivering the orders to the customer in the fastest way without exceeding the defined time period directly affects customer satisfaction, delivering the order to the customer in the most economical way is also important for the profitability of the company. Assigning orders to couriers in different regions and creating courier routes is a common optimization problem for restaurants. In this study, a courier vehicle routing problem is considered. A mathematical model of the problem is constructed by considering the real-time orders coming to the restaurant and the couriers in the region. In the real life problem, delivery time and transportation constraints are included in the model. The problem addressed is a single distribution center with capacity and time constraints and an open routing problem where couriers are outsourced and orders are picked up from the same restaurant. With the solution of the integer programming model, an optimum solution with the lowest courier transportation costs was obtained. Sensitivity analyses were performed to examine the effects of the number of couriers in different scenarios on order delivery time and distribution cost.

Anahtar Kelimeler: