Job Insertion for the Pickup and Delivery Problem with Time Windows

Yi Qu, Timothy Curtois

Research output: Contribution to journalArticlepeer-review


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.
Original languageEnglish
Pages (from-to)26-32
Number of pages5
JournalLecture Notes in Management Science
Publication statusPublished - 18 Dec 2017
Event9th International Conference on Applied Operational Research - Chung Yuan Christian University, Taoyuan, Taiwan, Province of China
Duration: 18 Dec 201720 Dec 2017


Dive into the research topics of 'Job Insertion for the Pickup and Delivery Problem with Time Windows'. Together they form a unique fingerprint.

Cite this