Type of Document Master's Thesis Author Subramanian, Shivaram Author's Email Address firstname.lastname@example.org URN etd-9797-123411 Title Routing Algorithms for Dynamic, Intelligent Transportation Networks Degree Master of Science Department Civil Engineering Advisory Committee
Advisor Name Title Sherali, Hanif D. Committee Chair Sherali, Hanif D. Committee Chair Trani, Antoino A. Committee Co-Chair Drew, David R. Committee Member Drew, Donald R. Committee Member Trani, Antoino A. Committee Member Keywords
- intelligent transportation systems
- shortest paths
- operations research
Date of Defense 1997-09-23 Availability unrestricted AbstractTraffic congestion has been cited as the most conspicuous problem in traffic management. It has far-reaching economic,social and political effects. Intelligent Transportation Systems (ITS) research and development programs have been assigned the task of developing sophisticated techniques and counter-measures to reduce traffic congestion to manageable levels, and also achieve these objectives using area-wide traffic management methods. During times of traffic congestion, the traffic network in a transient, time-dynamic state, and resembles a dynamic network. In addition, in the context of ITS, the network can accurately detect such transient behavior using traffic sensors, and several other information gathering devices. In conjunction with Operations Research techniques, the time-varying traffic flows can be routed through the network in an optimal manner, based on the feedback from these information sources. Dynamic Traffic Assignment (DTA) methods have been proposed to perform this task. An important step in DTA is the calculation of user-optimal, system-optimal, and multiple optimal routes for assigning traffic. One would also require the calculation of user-optimal paths for vehicle scheduling and dispatching problems.
The main objective of this research study is to analyze the effectiveness of time-dependent shortest path (TDSP) algorithms and k-shortest path (k-SP) algorithms as a practical routing tool in such intelligent transportation networks. Similar algorithms have been used to solve routing problems in computer networks. The similarities and differences between computer and ITS road networks are studied. An exhaustive review of TDSP and k-SP algorithms was conducted to classify and determine the best algorithms and implementation procedures available in the literature. A new (heuristic) algorithm (TD-kSP) that calculates multiple optimal paths for dynamic networks is proposed and developed. A complete object-oriented computer program in C++ was written using specialized network representations, node-renumbering schemes and efficient path processing data structures (classes) to implement this algorithm. A software environment where such optimization algorithms can be applied in practice was then developed using object-oriented design methodology. Extensive statistical and regression analysis tests for various random network sizes, densities and other parameters were conducted to determine the computational efficiency of the algorithm. Finally, the algorithm was incorporated within the GIS-based Wide-Area Incident Management Software System (WAIMSS) developed at the Center for Transportation Research, Virginia Tech. The results of these tests are used to obtain the empirical time-complexity of the algorithm. Results indicate that the performance of this algorithm is comparable to the best TDSP algorithms available in the literature, and strongly encourages its possible application in real-time applications.
Complete testing of the algorithm requires the use of real-time link flow data. While the use of randomly generated data and delay functions in this study may not significantly affect its computational performance, other measures of effectiveness as a routing tool remains untested. This can be verified only if the algorithm itself becomes a part of the user-behavior feedback loop. A closed loop traffic simulation/ system-dynamics study would be required to perform this task. On the other hand, an open-loop simulation would suffice for vehicle scheduling/dispatching problems.
Filename Size Approximate Download Time (Hours:Minutes:Seconds)
28.8 Modem 56K Modem ISDN (64 Kb) ISDN (128 Kb) Higher-speed Access abst.pdf 9.30 Kb 00:00:02 00:00:01 00:00:01 < 00:00:01 < 00:00:01 ch1.pdf 414.00 Kb 00:01:54 00:00:59 00:00:51 00:00:25 00:00:02 ch2.pdf 508.59 Kb 00:02:21 00:01:12 00:01:03 00:00:31 00:00:02 ch3.pdf 370.40 Kb 00:01:42 00:00:52 00:00:46 00:00:23 00:00:01 ch4.pdf 317.42 Kb 00:01:28 00:00:45 00:00:39 00:00:19 00:00:01 ch5.pdf 474.85 Kb 00:02:11 00:01:07 00:00:59 00:00:29 00:00:02 ch6.pdf 162.29 Kb 00:00:45 00:00:23 00:00:20 00:00:10 < 00:00:01 title.pdf 115.34 Kb 00:00:32 00:00:16 00:00:14 00:00:07 < 00:00:01 toc.pdf 133.88 Kb 00:00:37 00:00:19 00:00:16 00:00:08 < 00:00:01
If you have questions or technical problems, please Contact DLA.