Back to results

Massachusetts Institute of Technology

Models and algorithms for the optimization of traffic flows and emissions using dynamic routing and pricing

Abstract

dc:description.abstract

The research documented in this thesis is centered on the development and evaluation of models and algorithms for the optimization of traffic flows and emissions via routing and pricing in dynamic traffic networks. A set of problems that arise in this context are studied. These include: (1) the development of a probabilistic approach to model acceleration, (2) the study of the dynamic capacitated minimum cost flow problem, (3) an experimental analysis of improvements in shortest path algorithms, and (4) the study of dynamic congestion and emission pricing. We propose a probabilistic approach for modeling accelerations and decelerations in traffic networks as random variables that are a function of speed and road type. We use the approach to integrate a non-microscopic dynamic traffic model and an instantaneous emission model. We develop routing algorithms that can be used in the context of traffic flow optimization. First, we study the capacitated minimum cost flow problem in dynamic traffic networks, and develop two solution algorithms for the problem. The developed algorithms are shown experimentally to be more efficient than an existing algorithm in the literature. Second, we perform experimental testing to assess the computational performance of a new approach to solve the shortest path problem in static and dynamic FIFO networks, that tries to overcome some of the limitations in traditional comparison-based label-setting algorithms. Finally, we develop a second-best link-based dynamic congestion pricing model and formulate it as a bi-level program. We develop solution algorithms based on sensitivity analysis, and model both route and departure time choices as users' reaction to the prices. We extend the model and algorithms to study emission pricing. Finally, we formulate the model with additional travel time or emissions constraints, and evaluate the effectiveness of the pricing methods on small hypothetical network examples.

Degree

thesis:*
Department dc:contributor.department
Massachusetts Institute of Technology. Dept. of Civil and Environmental Engineering.
Grantor dc:publisher
Massachusetts Institute of Technology
Year dc:date.issued
2003

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Abou Zeid, Maya, 1979-
Advisor dc:contributor.advisor
  • Ismail Chabini.

Subjects

dc:subject × 1

Rights

dc:rights
Statement dc:rights
  • M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
Language dc:language.iso
eng

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/1721.1/29567
OAI identifier oai:identifier
oai:dspace.mit.edu:1721.1/29567

Chain of custody

source
Harvested from
MIT
Base URL
dspace.mit.edu/oai/request
Last updated
2026-07-22
Source record
OAI-PMH GetRecord
citation

Abou Zeid, Maya, 1979-. Models and algorithms for the optimization of traffic flows and emissions using dynamic routing and pricing. Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/29567