Delivery Routing Constrained by Customer Availability
Every day, delivery drivers face the challenge of finding the best route to take for their deliveries, to minimize costs and maximize efficiency. To complicate things, customers are now often able to specify time windows during which they are available to receive deliveries, and companies must now plan around these time windows to ensure customer satisfaction. This project explored how the inclusion of time windows influences the scheduling of deliveries, delving into an extension of the classic computing problem called the Travelling Salesperson Problem, accordingly referred to as the Travelling Salesperson Problem with Time Windows.
Keywords
Dissertation, Travelling Salesperson Problem, Constraints Programming, Vehicle Routing, Graph Search, Computer Science
Staff
[Ruth Hoffmann]{rh347}