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

Androutsopoulos, Konstantinos N. and Zografos, Konstantinos G. (2008) Solving the kk-shortest path problem with time windows in a time varying network. Operations Research Letters, 36 (6). pp. 692-695. ISSN 0167-6377

Full text not available from this repository.

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.

Item Type:
Journal Article
Journal or Publication Title:
Operations Research Letters
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/2200/2209
Subjects:
ID Code:
64640
Deposited By:
Deposited On:
20 May 2013 10:09
Refereed?:
Yes
Published?:
Published
Last Modified:
01 Jan 2020 08:29