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

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...

Full description

Saved in:
Bibliographic Details
Published inOperations research letters Vol. 37; no. 3; pp. 201 - 205
Main Authors Pretolani, Daniele, Nielsen, Lars Relund, Andersen, Kim Allan, Ehrgott, Matthias
Format Journal Article
LanguageEnglish
Published Oxford Elsevier B.V 01.05.2009
Elsevier
Subjects
Applied sciences
Decision theory. Utility theory
Exact sciences and technology
History-adaptive strategies
Multi-objective programming
Operational research and scientific management
Operational research. Management science
Shortest paths
Stochastic time-dependent networks
Time-adaptive strategies
Stochastic time-dependent networks
Time-adaptive strategies
Multi-objective programming
History-adaptive strategies
Shortest paths
Multicriteria analysis
Multiobjective programming
Shortest path
Routing
History
Modeling
Adaptive method
Time dependence
Efficiency
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0167-6377
1872-7468
DOI:10.1016/j.orl.2009.02.001