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
Close
More...
<mark>Journal publication date</mark>11/2008
<mark>Journal</mark>Operations Research Letters
Issue number6
Volume36
Number of pages4
Pages (from-to)692-695
Publication StatusPublished
<mark>Original language</mark>English

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.