Solving Traffic Assignment Problem with Side Constraints

Please enable javascript in your browser.

Moshtagh, Vahid | 2009

563 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 39527 (09)
University: Sharif University of Technology
Department: Civil Engineering
Advisor(s): Zokaei Aashtiani, Hedayat
Abstract:
In recent years, traffic assignment problem with side constraints has been considered because of the importance of transportation supply management. Side constraints which are appeared due to imposing the traffic control policies are usually represented in form of link, node or district capacity constraints. Although link capacity constraint has been extensively studied, only a few papers on the other types of constraints such as capacity constraint on inflow to a district of city exist in the literature. In this research a method based on dynamic penalty function (DPF) is presented to solve traffic assignment problem with side constraints. Solution algorithm has been coded in a programming invironment. The implementation of the algorithm and computational experiments on different sized networks has been presented and algorithm performance assessed. The results show that DPF algorithm has a high capability of finding feasible solution with good efficiency. The effect of district capacity constraint on link flows is also demonstrated on several networks
Keywords:
Traffic Assignment ; Penalty Function ; Lateral Contraction ; District Capacity Constraint

No TOC