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.
|Number of pages||5|
|Journal||Lecture Notes in Management Science|
|Publication status||Published - 18 Dec 2017|
|Event||9th International Conference on Applied Operational Research - Chung Yuan Christian University, Taoyuan, Taiwan, Province of China|
Duration: 18 Dec 2017 → 20 Dec 2017