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

  • Authors:

  • Daniele Pretolani;Lars Relund Nielsen;Kim Allan Andersen;Matthias Ehrgott

  • Affiliations:

  • Department of Sciences and Methods of Engineering, University of Modena and Reggio Emilia, Via Amendola 2, I-42100 Reggio Emilia, Italy;Department of Genetics and Biotechnology, University of Aarhus, P.O. Box 50, DK-8830 Tjele, Denmark;Department of Business Studies, Aarhus School of Business, University of Aarhus, Fuglesangs Allé 4, DK-8210 Aarhus V, Denmark;Department of Engineering Science, The University of Auckland, Private Bag 92019, Auckland 1142, New Zealand

  • Venue:
  • Operations Research Letters
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.