CTS Events
November 14, 2012

Dr. Nebiyou Tilahun, UPP, presents a seminar entitled "An agent based model of origin destination estimation (ADOBE)" Wednesday, November 14th at 4:00 pm in Rm 1127 SEO


November 7, 2012

Mr. Thomas Murtha, CMAP, will address the CTS-IGERT community at 4:00 p.m. in Room 1127 SEO.


October 24, 2012

Please join us in welcoming Dr. Bo Zou, CME, on Wednesday, October 24th, Room 1127 SEO, 4:00 p.m.


CTS Happenings
September 25, 2012

Award Received by Joshua Auld, CTS-IGERT alumnus.


April 20, 2012

Congratulations to James Biagioni, CTS Fellow and CS PhD candidate, winner of the Dean's Scholar award.


January 2, 2012

James Biagioni, CTS Fellow, receives "Best Presentation Award" at SenSys2011


July 30, 2010

Dr. Ouri Wolfson, Dr. Phillip Yu, and Leon Stenneth, CS student and CTS Associate, recently had a paper accepted to the 6th IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2010).


April 26, 2010

CTS welcomes Dr. David Boyce, Northwestern University, who will present a seminar entitled "Predicting Road Traffic Flows for Urban Transportation Planning Practice and Implications for Commercial Software Developers"

Monday, April 26, 2010
4:00 p.m.
Room 1000 SEO

The standard method for predicting traffic flows on road networks, called traffic assignment, is based on the principle that drivers individually seek the least cost routes from their origins to destinations. This principle leads to a user equilibrium in which all used routes have equal costs and no unused route has a lower cost, for every origin-destination pair. Under somewhat mild assumptions, the problem can be formulated as a convex optimization problem with linear constraints, and solved with an iterative algorithm. The precision and speed of such solutions has increased remarkably during the past ten years, in part due to PhD thesis research conducted at UIC by Hillel Bar-Gera.

Although the total flows on links of the road network are uniquely determined in this formulation, route and multiple-class flows are not. An additional assumption, called proportionality, is required to determine these flows uniquely. Bar-Gera's research, begun for his PhD thesis and continuing thereafter, led to an algorithm and computer code to solve the route flow problem uniquely.

During 2008-2009, Bar-Gera, Yu (Marco) Nie and I conducted a field test of the new algorithm, TAPAS. Six practitioners compared results from TAPAS to results obtained with their commercial software systems, which are widely used in practice in the U.S. and elsewhere. The findings are described in a recent report to the Federal Highway Administration.

In the seminar, I will review the user-equilibrium traffic assignment problem with the proportionality assumption, its solution with Bar-Gera's algorithm, and the findings obtained to date. Research on the properties of such networks is ongoing. Finally, I will discuss the implications of such an advance for commercial software developers, including some of their reactions to date.

To learn more about Dr. Boyce's research, please see: http://www.civil.northwestern.edu/people/boyce.html