Current Projects:

Mobility Access and Congestion Pricing Study @ San Francisco County Transportation Authority (SFCTA)

Modeling efforts have been conducted to help with planning desicions regarding congestion pricing in San Francisco. Congestion pricing would toll drivers who are using the roadway network in San Francisco based on their daily usage. Area pricing, cordon pricing, and gateway pricing have all been explored using the San Francisco activity based model. Please view the following presentation for an overview of modeling efforts that have been conducted for the study.

Past Projects:

The Biham Middleton Levine Traffic Model:

We are working on the BML model to answer questions involving phase transition, convergence speed, and periodic conditions. This project is with Raissa D'Souza, more information about the topic can be found on her web page. The final paper on this topic can be found at UC Davis Institute of Transportation Studies Publications.

Recent Talk Presented by Raissa D'Souza at IPAM
BML Simulations:

Periodic Square Lattice
Fibonacci Lattice
Periodic Fibonacci Lattice
Lattice 7 going from DI to GJ (Large File, takes a couple minutes to load)
Lattice 7 in a disordered intermediate state

UC Davis Sustainable Transportation Action Research Project (Project Description)

This is a modeshare assesment for the UC Davis campus funded by Transportation and Parking Services (TAPS). We are calculating average vehicle ridership (AVR) as well as doing an analysis of the modesplit and the mentaility of mode choice on the UC Davis campus. The methods used here will be generalized in order to be implemented on other campuses. The project will be written up as Chris Congleton's dissertation for his Ph.D in Transportation Technology and Policy.

Minimum Weight Triangulations:

Through linear programming and algorithm implementation we are working on a general solution to a minimum weight triangulation of a random point set. This project is in collaboration with David Haws under the supervision of Jesús A. De Loera.

Klincsek's Algorithm triangulates simple polygons. The code for this algorithm is available here. Klincsek's algorithm is one step in the process of triangulating a random point set.