The restaurant delivery problem with uncertain cooking time and travel time

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

“…With the continuous growth of the takeout market, academics are exploring possible solutions to the meal delivery problem. These studies include, but are not limited to, problems such as uncertainty in the meal delivery process [10], order assignment and route planning for couriers [11,12], and dynamic scheduling of meal orders [7]. However, these studies are based on the assumption that customers are homogeneous.…”

“…They found that considering time-sensitive heterogeneity was effective in improving customer time satisfaction. Xue et al [10] investigated the meal delivery service with uncertain cooking time and travel time. They proposed a solution method that incorporates the island harmony search algorithm and scenario-based simulation.…”

“…Constraint (9) indicates flow conservation, which states that, when a courier enters a location, he or she must move from this location to the next. Constraint (10) ensures that the restaurant and customer location for the same meal order must be visited by the same courier. Constraint (11) represents that orders assigned in previous periods cannot be transferred to other couriers.…”