Home > Research > Publications & Outputs > Time-adaptive and history-adaptive multicriteri...

Research

Links

Text available via DOI:

Keywords

View graph of relations

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

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks. / Pretolani, Daniele; Nielsen, Lars Relund; Andersen, Kim Allan et al.
In: Operations Research Letters, Vol. 37, No. 3, 01.05.2009, p. 201-205.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Pretolani, D, Nielsen, LR, Andersen, KA & Ehrgott, M 2009, 'Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks', Operations Research Letters, vol. 37, no. 3, pp. 201-205. https://doi.org/10.1016/j.orl.2009.02.001

APA

Pretolani, D., Nielsen, L. R., Andersen, K. A., & Ehrgott, M. (2009). Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks. Operations Research Letters, 37(3), 201-205. https://doi.org/10.1016/j.orl.2009.02.001

Vancouver

Pretolani D, Nielsen LR, Andersen KA, Ehrgott M. Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks. Operations Research Letters. 2009 May 1;37(3):201-205. doi: 10.1016/j.orl.2009.02.001

Author

Pretolani, Daniele ; Nielsen, Lars Relund ; Andersen, Kim Allan et al. / Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks. In: Operations Research Letters. 2009 ; Vol. 37, No. 3. pp. 201-205.

Bibtex

@article{9eb8b7797fa74e7fa994dff8e66dca4b,
title = "Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks",
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",
author = "Daniele Pretolani and Nielsen, {Lars Relund} and Andersen, {Kim Allan} and Matthias Ehrgott",
year = "2009",
month = may,
day = "1",
doi = "10.1016/j.orl.2009.02.001",
language = "English",
volume = "37",
pages = "201--205",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier",
number = "3",

}

RIS

TY - JOUR

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

AU - Pretolani, Daniele

AU - Nielsen, Lars Relund

AU - Andersen, Kim Allan

AU - Ehrgott, Matthias

PY - 2009/5/1

Y1 - 2009/5/1

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

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

KW - Multi-objective programming

KW - Shortest paths

KW - Stochastic time-dependent networks

KW - Time-adaptive strategies

KW - History-adaptive strategies

U2 - 10.1016/j.orl.2009.02.001

DO - 10.1016/j.orl.2009.02.001

M3 - Journal article

VL - 37

SP - 201

EP - 205

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 3

ER -