Dynamic Signal Coordination Models for a Network With Oversaturated Intersections
Girianna, Montty
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/83188
Description
Title
Dynamic Signal Coordination Models for a Network With Oversaturated Intersections
Author(s)
Girianna, Montty
Issue Date
2002
Doctoral Committee Chair(s)
Benekohal, Rahim F.
Department of Study
Civil and Environmental Engineering
Discipline
Civil and Environmental Engineering
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Engineering, Civil
Language
eng
Abstract
This research presents the development of a dynamic signal coordination model (DSCM) for a network (one-way and two-way streets) with oversaturated intersections. The model is formulated as a discrete optimization problem with the objective to maximize the number of vehicles released by the network. The disutility function is introduced to account for queue accumulation along coordinated arterials. None of the existing signal coordination algorithms can effectively deal with a network of oversaturated intersections. The proposed model contributes to this gap. A variety of queue management strategies (QMS), such as gridlock avoidance, local and system congestion releases, and a congestion release with maximum priority on certain movements, are developed and applied into a network with oversaturated intersections. Different network topologies are considered, i.e., open and closed loop coordinated arterials. The problem is solved by Genetic Algorithms (GA). Two types of GA (SGA and BOA) were used, which differ in terms of their procedures to generate a new set of candidate solutions. SGA uses standard genetic operators, such as selection and crossover, to generate a new set of solutions, while BOA generates new candidate solutions using an estimate of the joint distribution of current promising solutions. To reduce computation time for solving DSCM, GA is executed in parallel machines. A master-slave GA technique is used in which one allows a single processor (master) to take care all genetic operation and assigns a number of processors (slaves) to evaluate GA's fitness functions. The microscopic simulation model, CORSIM, is used to validate the proposed signal coordination model. The results confirm that signal control and strategies developed within the framework of DSCM can be implemented, and the traffic volume and relationship of variables developed for DSCM are realistic to describe operational performance of a real signal system. DSCM is implemented for a different set of hypothetical network topologies. The implementation is mainly theoretical, but experimental evidence is included to illustrate the accuracy and appropriateness of DSCM. The results of this investigation enable traffic engineers to design signal coordination with a variety of coordinated arterial configurations and different queue management strategies for networks with oversaturated intersections.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
