| dc.creator |
Ahuja, Ravindra |
|
| dc.creator |
Orlin, James |
|
| dc.creator |
Pallottino, Stefano |
|
| dc.creator |
Scutella, Maria |
|
| dc.date |
2003-01-27T17:01:28Z |
|
| dc.date |
2003-01-27T17:01:28Z |
|
| dc.date |
2003-01-27T17:01:28Z |
|
| dc.date.accessioned |
2013-05-31T20:05:22Z |
|
| dc.date.available |
2013-05-31T20:05:22Z |
|
| dc.date.issued |
2013-06-01 |
|
| dc.identifier |
http://hdl.handle.net/1721.1/1798 |
|
| dc.identifier.uri |
http://koha.mediu.edu.my:8181/jspui/handle/1721 |
|
| dc.description |
In this paper, we study dynamic shortest path problems that determine a shortest path from a specified
source node to every other node in the network where arc travel times change dynamically. We consider
two problems: the minimum time walk problem and the minimum cost walk problem. The minimum time
walk problem is to find a walk with the minimum travel time. The minimum cost walk problem is to find a
walk with the minimum weighted sum of the travel time and the excess travel time (over the minimum
possible travel time). The minimum time walk problem is known to be polynomially solvable for a class
of networks called FIFO networks. In this paper: (i) we show that the minimum cost walk problem is an
NP-hard problem; (ii) we develop a pseudopolynomial-time algorithm to solve the minimum cost walk
problem (for integer travel times); and (iii) we develop a polynomial-time algorithm for the minimum
time walk problem arising in road networks with traffic light |
|
| dc.format |
231483 bytes |
|
| dc.format |
application/pdf |
|
| dc.language |
en_US |
|
| dc.relation |
MIT Sloan School of Management Working Paper;4390-02 |
|
| dc.subject |
Dynamic shortest path |
|
| dc.subject |
arc travel |
|
| dc.subject |
FIFO networks |
|
| dc.title |
DYNAMIC SHORTEST PATHS MINIMIZING TRAVEL TIMES AND COSTS |
|