Multi-Trip Pickup and Delivery Problem in One to Many and Many to One(1-M/M-1) Transportation Network

The research addresses the Multi-Trip (MT)-Pickup and Delivery Problem (PDP) within a transportation network characterized by one-to-many/many-to-one (l-M/M-l) connections. It concentrates on the efficient management of transportation tasks involving cargo planes and depots that function as both sources and destinations. The critical challenge consists of optimizing routing decisions, determining node sequences for cargo planes on each trip, and minimizing both the number of trips and fleet size to ensure prompt fulfillment of all requests. In contrast to conventional approaches, this study permits the division of loads among cargo planes and takes into account practical considerations such as multiple depots, trips, and operational constraints. The proposed solution involves a mixed-integer linear programming model (MILP), exemplified through a real-world case study to provide practical insights.