Dynamic assignment vehicle routing problem with generalised capacity and unknown workload.

F Phillipson, S de Koff, C van Ommeren, Hans Quak

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Abstract

In this paper we present a modification to the Dynamic Assignment Vehicle Routing Problem. This problem arises in parcel to vehicle assignment where the destination of the parcels is not known up to the assignment of the parcel to a delivering route. The assignment has to be done immediately without the possibility of re-assignment afterwards. We extend the original problem with a generalisation of the definition of capacity, with an unknown workload, unknown number of parcels per day, and a generalisation of the objective function. This new problem is defined and various methods are proposed to come to an efficient solution method.

Original languageEnglish
Title of host publicationProceedings of the 9th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES
EditorsGH Parlier, F Liberatore, M Demange
PublisherSciTePress
Pages329-335
Number of pages7
Volume1
ISBN (Electronic)9789897583964
DOIs
Publication statusPublished - 2020
Event9th International Conference on Operations Research and Enterprise Systems - Valletta, Malta
Duration: 22 Feb 202024 Feb 2020

Conference

Conference9th International Conference on Operations Research and Enterprise Systems
CountryMalta
CityValletta
Period22/02/2024/02/20

Keywords

  • parcel distribution
  • cross docking
  • assignment

Cite this

Phillipson, F., de Koff, S., van Ommeren, C., & Quak, H. (2020). Dynamic assignment vehicle routing problem with generalised capacity and unknown workload. In GH. Parlier, F. Liberatore, & M. Demange (Eds.), Proceedings of the 9th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES (Vol. 1, pp. 329-335). SciTePress. https://doi.org/10.5220/0008933703290335