Solving Vehicle Routing Problems with Stochastic and Correlated Travel Times and Makespan Objectives

Iurii Bakach, Ann Melissa Campbell, Jan Fabian Ehmke, Timothy L. Urban

Publications: Contribution to journalArticlePeer Reviewed

Abstract

In this paper, we examine a vehicle routing problem with a makespan objective incorporating both stochastic and correlated travel times, which is usually not considered in routing problems. As an alternative to simulation, we develop an approach based on extreme-value theory to estimate the expected makespan (and standard deviation) and show how this approach can be embedded within an existing routing heuristic. We present results that demonstrate the impact of different correlation patterns and levels of correlation on route planning using real-world motivated instances. Depending on the particular objective, cost savings of up to 13.76% can be obtained by considering correlation.
Original languageEnglish
Article number100029
Number of pages18
JournalEURO Journal on Transportation and Logistics
Volume10
DOIs
Publication statusPublished - 2021

Austrian Fields of Science 2012

  • 502017 Logistics

Keywords

  • Routing
  • Correlation
  • Stochastic Travel Times
  • Makespan
  • Extreme-value theory
  • MR (Management of Resources)
  • DSA (Data Science and Analytics)
  • SALESMAN PROBLEM
  • NETWORKS
  • RELIABILITY
  • Stochastic travel times
  • MINIMUM
  • SHORTEST-PATH PROBLEM
  • WINDOWS
  • OPTIMIZATION
  • GENETIC ALGORITHM APPROACH

Fingerprint

Dive into the research topics of 'Solving Vehicle Routing Problems with Stochastic and Correlated Travel Times and Makespan Objectives'. Together they form a unique fingerprint.

Cite this