A new approach to compute minimum time path trees in FIFO time dependent networks

We consider the problem of finding one to all minimum time paths for all departure times in a FIFO time dependent network with discrete arc travel times. We suggest that the problem can be viewed as a series of reoptimization of shortest path trees in static networks. This is accomplished via the co...

Full description

Bibliographic Details

Published in:	The IEEE 5th International Conference on Intelligent Transportation Systems : proceedings : September 3-6, 2002, Singapore pp. 485 - 490
Main Authors:	Grier, N., Chabini, I.
Format:	Conference Proceeding
Language:	English
Published:	IEEE 2002
Subjects:	Bridges Collision mitigation Computer networks Costs Intelligent networks Tin USA Councils
ISBN:	9780780373891, 0780373898
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!