Loading...

Solving the Bus Rapid Transit Network Design Problem with Ant System Algorithm (in Realistic Urban Network)

Kishani, Najme | 2008

593 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 39309 (09)
  4. University: Sharif University of Technology
  5. Department: Civil Engineering
  6. Advisor(s): Poorzahedy, Hossein
  7. Abstract:
  8. Network design problem (NDP) is an important problem in transportation planning, in which transit network design is one the most important problems. Public transportation means, however, can not meet urban mobility needs in the developing countries satisfactorily. Bus services are usually unsuitable, insufficient, and unreliable. Bus Rapid Transit (BRT) system, is an emerging public transport alternative designed to provide appropriate, low cost, and effective services, and improve mobility in both developed and developing countries. To design public transportation systems, existing constraints such as resources and budget have to be considered to serve estimated demand properly. Bus Rapid Transit network design problem, consists of a variety of factors, such as the location of the bus alignment and stations, run-ways, and intelligent transportation system elements, which are put into a fully integrated system. So, this problem is a multimodal network design problem and its solution is so complicated that may not be properly done without a systematic method. In this research, a meta-heuristic method, "ant system", is proposed to generate effective alternatives for bus rapid transit network. Then, traffic assignment routine is applied on those alternatives to estimate various performance measures, which are used to evaluate the proposed alternative networks by Concordance Analysis, a multi-objective decision procedure. The result is a set of competitive BRT networks, to be, introduced to the city
  9. Keywords:
  10. Network Design ; Ant System Algorithm ; Bus Rapid Transit (BRT)

 Digital Object List

  • محتواي پايان نامه
  •   view

 Bookmark

No TOC