Allocation and Sequencing of Missions on Autonomous Vehicles

Pickup and delivery problems are frequently encountered problems in transport companies. This paper presents a variant of the homogeneous vehicle, single-to-single Pickup and Delivery Problem with Time Windows, where several vehicles must fulfill transport requests from pickup nodes to delivery nodes, called missions, with associated service level agreements (SLA). A mathematical programming model is proposed to tackle this variant, focused on optimizing the allocation and sequencing of missions to be executed by autonomous vehicles. Numerical experiments are performed comparing instances with missions with long and short SLAs. The results show that the model takes longer to find the optimal solution when the missions have short SLAs and increased difficulty in meeting them if the number of vehicles is limited.