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.
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 8, 2011
Dr. David Boyce will present a seminar entitled "Unique User-equilibrium Road Traffic Flows for Two User Classes" on Friday, April 8, 2011 at 2:30 p.m. in Room 1000 SEO.
The standard method for predicting traffic flows on urban road networks, called static traffic assignment, is based on the principle that drivers seek their own least cost routes from their origins to their destinations. This principle corresponds to a network 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 network equilibrium 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.
Although the total flows on links of the urban road network are uniquely determined in this formulation, route flows and multiple-class link flows are not. An additional assumption, called the condition of proportionality, is required to determine these flows uniquely. This assumption is the basis for solving these problems in a new algorithm, Traffic Assignment by Paired Alternative Segments (TAPAS).
In this paper, the findings of computational experiments pertaining to three network representations and three trip matrices are presented. The network representations pertain to restrictions on the use of certain links of the network by trucks in a multiple-class assignment. The trip matrices represent a range of sensitivities of travelers to generalized costs. The findings are presented in a way that transportation planning professionals may find helpful in understanding the importance of network representations, multiple-class assignments and the condition of proportionality to their travel forecasting practice.
To learn more about Dr. Boyce’s research, please see: http://www.civil.northwestern.edu/people/boyce.html