Mathematical modelling of the the one-to-one Pickup and Delivery Problem with time Windows with a single vehicle

This paper focuses on a specific type of transportation problem known as the one-to-one Pickup and Delivery Problem with time Windows with a single vehicle (PDPTW), where the goal is to determine the next loading point for a delivery vehicle after completing a customer delivery. The objective is to minimize total transportation costs while adhering to time constraints. The article presents a mathematical formulation of the problem to facilitate its resolution and gives an overview of current methodologies and solutions through a thorough literature review. Real data from Optimalogistic, a Tunisian transport company, is used to test this strategy. The proposed approach is shown to be effective in minimizing transportation costs while adhering to time windows when the mathematical model is solved using the CPLEX solver.