Loading...
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
- Type of Document: M.Sc. Thesis
- Language: Farsi
- Document No: 46288 (09)
- University: Sharif University of Technology
- Department: Civil Engineering
- Advisor(s): Zakaei Ashtiani, Hedayat
- Abstract:
- Traffic assignment is a crucial part of transportation system management. Refining traffic assignment results by applying different side constraints have been the focus of many studies. Path side constraint was first introduced and studied for electric vehicles and the
corresponding traffic assignment problem was solved by a method based on the wellknown Frank-Wolf algorithm. In this study a new solution method based on complementarity algorithm has been proposed which is capable of solving traffic assignment problem with path side constraint in real sized networks. Length side constraint is considered in Sioux Falls network to compare two algorithms from the computational time point of view. Results show that the complementarity traffic assignment algorithm converges in a shorter time. Three side constraints – length, free
flow delay, and free flow travel time- have been considered in Mashhad network to assess the capability of applying the proposed algorithm in solving real case problems.
Based on the results, length and free flow time, beside travel time, affect more than free flow delay the route choice behavior in Mashhad network. It is also shown that considering side constraint in traffic assignment problem would result in a better estimation of traffic flows in network links - Keywords:
- Traffic Assignment ; Side Constraint ; Complementary Algorithm
Digital Object List
-
محتواي کتاب
- view
Bookmark