Vehicle routing with arrival time diversification

Maaike Hoogeboom*, Wout Dullaert

*Corresponding author for this work

Research output: Contribution to JournalArticleAcademicpeer-review

160 Downloads (Pure)


Unpredictable routes may be generated by varying the arrival time at each customer over successive visits. Inspired by a real-life case in cash distribution, this study presents an efficient solution approach for the vehicle routing problem with arrival time diversification by formulating it as a vehicle routing problem with multiple time windows in a rolling horizon framework. Because waiting times are not allowed, a novel algorithm is developed to efficiently determine whether routes or local search operations are time window feasible. To allow infeasible solutions during the heuristic search, four different penalty methods are proposed. The proposed algorithm and penalty methods are evaluated in a simple iterated granular tabu search that obtains new best-known solutions for all benchmark instances from the literature, decreasing average distance by 29% and reducing computation time by 93%. A case study is conducted to illustrate the practical relevance of the proposed model and to examine the trade-off between arrival time diversification and transportation cost.

Original languageEnglish
Pages (from-to)93-107
Number of pages15
JournalEuropean Journal of Operational Research
Issue number1
Early online date13 Nov 2018
Publication statusPublished - 16 May 2019


  • Heuristics
  • Multiple time windows
  • Routing
  • Security constraints


Dive into the research topics of 'Vehicle routing with arrival time diversification'. Together they form a unique fingerprint.

Cite this