You are here:
» Time-adaptive and history-adaptive multicriterion routing...
About Aarhus University
Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks
Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Journal article › Research › peer-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 language | English |
|---|---|
| Journal | Operations Research Letters |
| Volume | 37 |
| Issue | 3 |
| Pages (from-to) | 201-205 |
| ISSN | 0167-6377 |
| DOIs | |
| Publication status | Published - 2009 |
- Multi-objective programming, Shortest paths, Stochastic time-dependent networks, Time-adaptive strategies, History-adaptive strategies
Research areas
See relations at Aarhus University Citationformats
ID: 216342