Paylaşımlı teslimat hizmetlerinde optimal paylaşım noktasının belirlenmesi

The recent surge in on-demand and quick delivery services has prompted the exploration of strategies to enhance operational efficiency and customer satisfaction. This study in- troduces the concept of Optimal Sharing Point (OSP) for exchanging parcels between two drivers in a delivery problem. By incorporating sharing points, couriers can optimize parcel exchanges, leading to reduced delivery completion time (DCT) and improved flex- ibility, resulting in faster deliveries and enhanced customer satisfaction. To address this, a mixed-integer linear programming (MILP) formulation is designed and implemented to find OSP in a hypothetical scenario on a small scale. Additionally, Genetic Algo- rithm (GA) and Google OR-Tools routing solver were employed to solve the problem on a larger scale. Finally, a hypothetical case study from Istanbul, Turkey, was used to validate the effectiveness of the proposed methodology. The proposed approach effec- tively minimized the DCT by considering real-world scenarios, network topology, and sharing points. The model eliminated the need for physical transfer nodes, allowing ef- ficient parcel sharing without temporary storage. The approach addressed key objectives such as timely services, simultaneous sharing, actual network topology, and traffic con- siderations. The model's flexibility accommodated various objectives, emphasizing total delivery time or minimizing DCT. Keywords: Q-commerce, Pickup and Delivery Problem with Transfers, Vehicle Routing Problem, Optimal Sharing Point, Delivery Completion Time, Google OR-Tools