Aarhus University Seal

Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  • Daniele Pretolani, University of Modena and Reggio Emilia, Italy
  • Lars Relund Nielsen
  • Kim Allan Andersen, Denmark
  • Matthias Ehrgott, The University of Auckland, New Zealand
  • CORAL - Centre for Operations Research Applications in Logistics
  • Department of Business Studies
We compare two different models for multicriterion routing in stochastic time-dependent networks: the classic "time-adaptive'' model and the more flexible "history-adaptive'' one. We point out several properties of the sets of efficient solutions found under the two models. We also devise a method for finding supported history-adaptive solutions.
Original languageEnglish
JournalOperations Research Letters
Pages (from-to)201-205
Publication statusPublished - 2009

    Research areas

  • Multi-objective programming, Shortest paths, Stochastic time-dependent networks, Time-adaptive strategies, History-adaptive strategies

See relations at Aarhus University Citationformats

ID: 216342