A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
A Heuristic Method for Bus Rapid Transit Planning Based on the Maximum Trip Service
Bus rapid transit (BRT) is characterized by higher speed, higher comfort level, and larger capacity than conventional bus service. Although many cities worldwide have adopted BRT in recent years, there is an absence of scientific and quantitative approach for BRT network planning. The problem of BRT planning in an existing transportation network is very complex with constraints of road geometrics, regulations, right of way, travel demand, vehicle operations, and so on. This paper focuses on developing an optimization model for BRT network planning, where an integer programing model is established to identify station locations and route layout with the objective of maximizing the number of trips served by the network, subjected to constraints including distance between stations, cost of construction, road geometrics, etc. The detour factor of the BRT route, which is an important indicator but widely ignored in previous studies, is also taken as a constraint. A heuristic method is applied to generate optimal solutions to the integer programming model, followed by a case study using the transportation network and travel demand data in Luoyang, China. The numerical results show that the method is valid and can therefore be applied to improve BRT network planning and the sustainable transportation system development.
A Heuristic Method for Bus Rapid Transit Planning Based on the Maximum Trip Service
Bus rapid transit (BRT) is characterized by higher speed, higher comfort level, and larger capacity than conventional bus service. Although many cities worldwide have adopted BRT in recent years, there is an absence of scientific and quantitative approach for BRT network planning. The problem of BRT planning in an existing transportation network is very complex with constraints of road geometrics, regulations, right of way, travel demand, vehicle operations, and so on. This paper focuses on developing an optimization model for BRT network planning, where an integer programing model is established to identify station locations and route layout with the objective of maximizing the number of trips served by the network, subjected to constraints including distance between stations, cost of construction, road geometrics, etc. The detour factor of the BRT route, which is an important indicator but widely ignored in previous studies, is also taken as a constraint. A heuristic method is applied to generate optimal solutions to the integer programming model, followed by a case study using the transportation network and travel demand data in Luoyang, China. The numerical results show that the method is valid and can therefore be applied to improve BRT network planning and the sustainable transportation system development.
A Heuristic Method for Bus Rapid Transit Planning Based on the Maximum Trip Service
Zhong Wang (author) / Fengmin Lan (author) / Zijing Lin (author) / Lian Lian (author)
2021
Article (Journal)
Electronic Resource
Unknown
Metadata by DOAJ is licensed under CC BY-SA 1.0
Development of Web-Based Transit Trip-Planning System Based on Service-Oriented Architecture
| British Library Online Contents | 2011
Schedule-Based Path-Finding Algorithms for Transit Trip-Planning Systems
| British Library Online Contents | 2002
Trip Time Analyzers: Key to Transit Service Quality
| British Library Online Contents | 2001
Building A Regional Transit Information And Trip Planning System
| British Library Conference Proceedings | 2001