Loading...

Network Design Problem Considering Unsignalized Intersection Delay Function

Siyadati, Saba | 2019

535 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 51891 (09)
  4. University: Sharif University of Technology
  5. Department: Civil Engineering
  6. Advisor(s): Zokaie Aashtiani, Hedayat
  7. Abstract:
  8. In a discrete network design problem (DNDP), an optimal set of projects is chosen from suggested projects to expand a transportation network. The optimal set is selected by minimizing the total travel time with respect to the budget constraint. This problem is formulated as a bi-level optimization. In the current study, traffic assignment is solved at the lower level as a user equilibrium problem by considering the delay of intersections which is the major portion of total intra-city travel time. This study investigates the performance of the transportation network with more realistic assumptions compared to the previous studies in the network design problem.This study uses the branch and bound method to solve network design problem for Sioux Falls and Mashhad networks. A complementary traffic assignment algorithm is employed to determine traffic flows. A single-variable and a multi-variable delay function, for unsignalized intersections, are used at the lower level optimization and the results are compared. Results show that if the delay of intersections is taken into account, conducting some new projects in the existing network may causes the greater value of total delay at intersections. Accordingly, total travel time will be increased and in spite of having sufficient budget, these projects won’t be selected
  9. Keywords:
  10. Network Design ; Traffic Assignment ; Unsignalized Intersection ; Intersection Delay Function ; Multi-Variable Delay

 Digital Object List

 Bookmark

No TOC