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: 49304 (09)
- University: Sharif University of Technology
- Department: Civil Engineering
- Advisor(s): Zokaei Ashtiani, Hedayat
- Abstract:
- Nowadays, the necessity of management tools for controlling the ever increasing congestions in transportation networks has been increased. Pricing is one of these tools for mitigating congestions in transportation networks. In this regard, different pricing models have been developed for transportation networks. By considering the advancement in technologies and possibility of recording the vehicles’ traveled distance in the tolling areas, the amount of toll each user pays could be a nonlinear function of the distance traveled inside tolling areas. As a result, the generalized travel cost of each path may not be link-wise additive; therefore, the resulting shortest path problem cannot be solved by conventional shortest path algorithms. In this thesis four algorithms for solving shortest path problem with nonlinear toll function are presented. By implementing these algorithms in the complementary traffic assignment, the traffic assignment problem is solved for two small networks. To find the optimal pricing parameters, coordinated search algorithm is employed. In addition, the improvement on this algorithm is presented. The results of both algorithms for a small network as well as a real one shows that the improved coordinated search algorithm has better performance in converging time and result precision than the conventional coordinated search algorithm
- Keywords:
- Pricing ; Traffic Assignment ; Shortest Path ; Harmony Search Algorithm ; Nonlinear Toll Function
Digital Object List-
محتواي کتاب - view
Bookmark