The dynamic multiperiod vehicle routing problem with probabilistic information

Maria Albareda-Sambola, Elena Fernández, Gilbert Laporte

Research output: Contribution to journalArticlepeer-review

42 Citations (Scopus)

Abstract

This paper introduces the Dynamic Multiperiod Vehicle Routing Problem with Probabilistic Information, an extension of the Dynamic Multiperiod Vehicle Routing Problem in which, at each time period, the set of customers requiring a service in later time periods is unknown, but its probability distribution is available. Requests for service must be satisfied within a given time window that comprises several time periods of the planning horizon. We propose an adaptive service policy that aims at estimating the best time period to serve each request within its associated time window in order to reduce distribution costs. The effectiveness of this policy is compared with that of two alternative basic policies through a series of computational experiments.

Original languageEnglish
Pages (from-to)31-39
Number of pages9
JournalComputers and Operations Research
Volume48
DOIs
Publication statusPublished - Aug 2014

Keywords

  • Dynamic vehicle routing
  • VNS

ASJC Scopus subject areas

  • Computer Science(all)
  • Modelling and Simulation
  • Management Science and Operations Research

Fingerprint

Dive into the research topics of 'The dynamic multiperiod vehicle routing problem with probabilistic information'. Together they form a unique fingerprint.

Cite this