Optimal Delivery Positioning Algorithm Using Clustering

The optimization of delivery routes in cities is a critical challenge. Handling fluctuating demand and delivery person availability can be crucial for a food delivery app. This research proposes a novel approach to dynamically create restaurant clusters and delivery clusters based on their location, and reposition idle delivery personnel to the medoid points of restaurant clusters, keeping in mind both proximity of clusters to the delivery personnel and their demand. Our algorithm also aims to optimize the batching of orders to overcome limited vehicular availability with the help of delivery clusters. This research contributes to the field of urban logistics by offering a strategy to optimize delivery operations and potentially reduce operational costs, delivery time and improve customer satisfaction.