UnipiEprints
Università di Pisa
Sistema bibliotecario di ateneo

Dynamic Shortest Paths Minimizing Travel Times and Costs

Ahuja, Ravindra K. and Orlin, James B. and Pallottino, Stefano and Scutellà, Maria Grazia (2001) Dynamic Shortest Paths Minimizing Travel Times and Costs. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.

[img] Postscript (GZip) - Published Version
Available under License Creative Commons Attribution No Derivatives.

Download (109Kb)

    Abstract

    In this paper, we study dynamic shortest path problems, which is to 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 (which is to find a walk with the minimum travel time) and the minimum cost walk problem (which is to find a walk with the minimum travel cost). The minimum time walk problem is known to be polynomially solvable for a class of networks called FIFO networks. This paper makes the following contributions: (i) we show that the minimum cost walk problem is an NP-complete 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 lights.

    Item Type: Book
    Uncontrolled Keywords: Shortest Paths, Dynamic Networks, Urban Traffic
    Subjects: Area01 - Scienze matematiche e informatiche > INF/01 - Informatica
    Divisions: Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA
    Depositing User: dott.ssa Sandra Faita
    Date Deposited: 17 Dec 2014 17:15
    Last Modified: 17 Dec 2014 17:15
    URI: http://eprints.adm.unipi.it/id/eprint/2068

    Repository staff only actions

    View Item