Home > Research > Publications & Outputs > Solving the kk-shortest path problem with time ...

Research

Associated organisational unit

Links

Text available via DOI:

Keywords

View graph of relations

Solving the kk-shortest path problem with time windows in a time varying network

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

Published

Standard

Solving the kk-shortest path problem with time windows in a time varying network. / Androutsopoulos, Konstantinos N.; Zografos, Konstantinos G.
In: Operations Research Letters, Vol. 36, No. 6, 11.2008, p. 692-695.

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

Harvard

Androutsopoulos, KN & Zografos, KG 2008, 'Solving the kk-shortest path problem with time windows in a time varying network', Operations Research Letters, vol. 36, no. 6, pp. 692-695. https://doi.org/10.1016/j.orl.2008.07.003

APA

Androutsopoulos, K. N., & Zografos, K. G. (2008). Solving the kk-shortest path problem with time windows in a time varying network. Operations Research Letters, 36(6), 692-695. https://doi.org/10.1016/j.orl.2008.07.003

Vancouver

Androutsopoulos KN, Zografos KG. Solving the kk-shortest path problem with time windows in a time varying network. Operations Research Letters. 2008 Nov;36(6):692-695. doi: 10.1016/j.orl.2008.07.003

Author

Androutsopoulos, Konstantinos N. ; Zografos, Konstantinos G. / Solving the kk-shortest path problem with time windows in a time varying network. In: Operations Research Letters. 2008 ; Vol. 36, No. 6. pp. 692-695.

Bibtex

@article{6542c2a7c5da4c0cba61394669765c09,
title = "Solving the kk-shortest path problem with time windows in a time varying network",
abstract = "The kk-shortest path problem in a network with time dependent cost attributes arises in many transportation decisions including hazardous materials routing and urban trip planning. The present paper proposes a label setting algorithm for solving this problem given that departure and arrival are constrained within specified time windows.",
keywords = "kk-shortest path, Routing and scheduling , Dynamic programming",
author = "Androutsopoulos, {Konstantinos N.} and Zografos, {Konstantinos G.}",
year = "2008",
month = nov,
doi = "10.1016/j.orl.2008.07.003",
language = "English",
volume = "36",
pages = "692--695",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier",
number = "6",

}

RIS

TY - JOUR

T1 - Solving the kk-shortest path problem with time windows in a time varying network

AU - Androutsopoulos, Konstantinos N.

AU - Zografos, Konstantinos G.

PY - 2008/11

Y1 - 2008/11

N2 - The kk-shortest path problem in a network with time dependent cost attributes arises in many transportation decisions including hazardous materials routing and urban trip planning. The present paper proposes a label setting algorithm for solving this problem given that departure and arrival are constrained within specified time windows.

AB - The kk-shortest path problem in a network with time dependent cost attributes arises in many transportation decisions including hazardous materials routing and urban trip planning. The present paper proposes a label setting algorithm for solving this problem given that departure and arrival are constrained within specified time windows.

KW - kk-shortest path

KW - Routing and scheduling

KW - Dynamic programming

U2 - 10.1016/j.orl.2008.07.003

DO - 10.1016/j.orl.2008.07.003

M3 - Journal article

VL - 36

SP - 692

EP - 695

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 6

ER -