Dynamic assignment vehicle routing problem with time windows

Kim J Los, F Phillipson, Elisah A. van Kempen, Hans Quak, Uilke Stelwagen

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


Offering time windows to receivers of last-mile delivery is becoming a distinguishing factor. However, we see that in practice carriers have to create routes for their vehicles based on destination information, that is just being revealed when a parcel arrives in the depot. The parcel has to be assigned directly to a vehicle, making this a Dynamic Assignment Vehicle Routing Problem. Incorporating time windows is hard in this case. In this paper an approach is presented to solve this problem including Time Windows. A comparison is made with a real observation and with a solution method for the base problem
Original languageEnglish
Title of host publicationComputational Logistics - 11th International Conference, ICCL 2020, Proceedings
Subtitle of host publication11th International Conference, ICCL 2020,
EditorsE Lalla-Ruiz , M Mes, S Voß
PublisherSpringer, Cham
Number of pages16
ISBN (Electronic)9783030597474
ISBN (Print)9783030597467
Publication statusPublished - 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12433 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


  • Dynamic Vehicle Routing
  • Home delivery
  • Time Windows


Dive into the research topics of 'Dynamic assignment vehicle routing problem with time windows'. Together they form a unique fingerprint.

Cite this