The Prisoner Transportation Problem is an NP-hard combinatorial problem and a complex variant of the Dial-a-Ride Problem. Given a set of requests for pick-up and delivery and a homogeneous fleet, it consists of assigning requests to vehicles to serve all requests, respecting the problem constraints such as route duration, capacity, ride time, time windows, multi-compartment assignment of...
Pickup and Delivery Problems (PDP) and their variants are commonly found in logistics and transportation systems. This work addresses a logistic transport problem where homogeneous vehicles must fulfill transportation requests between pickup and delivery nodes, subject to service level agreements (SLAs). We compare the performance of two Mixed-Integer Linear Programming (MILP) models: one...
The Traveling Purchaser Problem with Incompatibility Constraints (TPP-IC) generalizes the classical Traveling Purchaser Problem (TPP) by introducing constraints that prevent certain items from being transported together. This problem arises in various real-world applications, such as hazardous materials transportation, where incompatible products must be handled separately to ensure safety and...
