Job Insertion for the Pickup and Delivery Problem with Time Windows

Qu, Yi and Curtois, Tim (2017) Job Insertion for the Pickup and Delivery Problem with Time Windows. Lecture Notes in Management Science, 9. pp. 26-32. ISSN 1927-0097

Text (Full text) lnmsv9p26.pdf - Published Version Restricted to Repository staff only Download (1MB) | Request a copy

Abstract

Two heuristic algorithms are proposed for a practical but relatively under-studied vehicle routing scenario. It requires the insertion of jobs into already planned routes. It occurs when new jobs arrive throughout a day but the current plans are already being performed. The benefit of solving such a problem is providing a better service for collection and delivery jobs whilst also providing better vehicle fill rates and increased revenue for delivery companies. Solutions must be generated quickly because of the dynamic nature of the problem. Two iterative heuristic algorithms are presented and tested on a well-known benchmark set. The algorithms are able to insert new jobs quickly and efficiently and even found some new best known solutions for the benchmark instances.

Actions (login required)

View Item

Downloads