Shortest paths in randomly time varying networks

Author

Cerulli, Raffaele ; Festa, Paola ; Raiconi, Giancarlo

Author_Institution

Dipt. di Inf. ed Applicazioni, Salerno Univ., Italy

fYear

2001

fDate

2001

Firstpage

854

Lastpage

859

Abstract

A dynamic single-source single-destination shortest path problem on a directed graph is considered. The edge lengths are not constant, but they change as a function of time in a random way. The problem is modeled as a multi-stage decision process and solved by using a re-optimization method that solves the ι.th stage using the results of the solution of the (ι-1).th one. An algorithm, called the dynamical shortest path algorithm, is proposed for solving the global problem either finding a solution or detecting that the problem is infeasible and an upper bound on its running time is found. Numerical examples are reported in order to show the effectiveness of the method

Keywords

directed graphs; emergency services; operations research; optimisation; transportation; auction technique; directed graph; dynamic networks; emergency service; multistage decision process; optimisation; shortest path; transportation; upper bound; Artificial intelligence; Change detection algorithms; Disaster management; Emergency services; Heuristic algorithms; Intelligent networks; Intelligent robots; Operations research; Shortest path problem; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Transportation Systems, 2001. Proceedings. 2001 IEEE

Conference_Location

Oakland, CA

Print_ISBN

0-7803-7194-1

Type

conf

DOI

10.1109/ITSC.2001.948772

Filename

948772