Article ID Journal Published Year Pages File Type
1143480 Operations Research Letters 2008 4 Pages PDF
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
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Solving the kk-shortest path problem with time windows in a time varying network
Authors
, ,