English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

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