Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/1798| Title: | DYNAMIC SHORTEST PATHS MINIMIZING TRAVEL TIMES AND COSTS |
| Keywords: | Dynamic shortest path arc travel FIFO networks |
| Issue Date: | 1-Jun-2013 |
| 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 |
| URI: | http://koha.mediu.edu.my:8181/jspui/handle/1721 |
| Other Identifiers: | http://hdl.handle.net/1721.1/1798 |
| Appears in Collections: | MIT Items |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.