|
|||||
|
|
Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks |
|
| Authors: | Daniele Pretolani Lars Relund Nielsen |
| Affiliation: | a Department of Sciences and Methods of Engineering, University of Modena and Reggio Emilia, Via Amendola 2, I-42100 Reggio Emilia, Italy b Department of Genetics and Biotechnology, University of Aarhus, P.O. Box 50, DK-8830 Tjele, Denmark c Department of Business Studies, Aarhus School of Business, University of Aarhus, Fuglesangs Allé 4, DK-8210 Aarhus V, Denmark d Department of Engineering Science, The University of Auckland, Private Bag 92019, Auckland 1142, New Zealand |
| 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. |
| Keywords: | Multi-objective programming Shortest paths Stochastic time-dependent networks Time-adaptive strategies History-adaptive strategies |
| 本文献已被 ScienceDirect 等数据库收录！ | |