Model and Algorithm of Optimizing Bus Transit Network Based on Line Segment Combination
Guangming Xu, Feng Shi, Pu Wang
Abstract
Guangming Xu, Feng Shi, Pu Wang
Abstract
Based on the layout of urban functionality, the hierarchical structure of a transportation network and the characteristics of passenger trips, this paper analyzed the characteristics of bus lines. By introducing the concept of bus line segments, a method to efficiently design bus transit networks was proposed. Considering the benefits of passengers and operators, a bi-level programming model dedicated to the planning of public transit networks was established. An annealing algorithm was proposed to solve this bi-level programming model. In this annealing algorithm, the neighborhood search technique, which includes seven bus line adjustment methods and two frequency adjustment methods, was employed. The neighborhood search was based on the extracted bus line segments and the transit flow solved by transit assignment model based on strategy equilibrium. The use of bus line segments improves the efficiency of the optimization of the public transit network.
OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Based on the layout of urban functionality, the hierarchical structure of a transportation network and the characteristics of passenger trips, this paper analyzed the characteristics of bus lines. By introducing the concept of bus line segments, a method to efficiently design bus transit networks was proposed. Considering the benefits of passengers and operators, a bi-level programming model dedicated to the planning of public transit networks was established. An annealing algorithm was proposed to solve this bi-level programming model. In this annealing algorithm, the neighborhood search technique, which includes seven bus line adjustment methods and two frequency adjustment methods, was employed. The neighborhood search was based on the extracted bus line segments and the transit flow solved by transit assignment model based on strategy equilibrium. The use of bus line segments improves the efficiency of the optimization of the public transit network.
Key concepts: Simulated annealing, Public transport, Computer science, Transit (satellite), Line (geometry), Bus network, TRIPS architecture, Programming paradigm