Bus routes planning is the key to the design of public transport system, it determines the status of public transports at a large degree. For the existing bus network traffic problems, such as bus traffic is not balanced in both pace and time, flat-peak conversion is slow, non-linear coefficient is high. Therefore a circular bus network planning method is put out. The overall interests of passenger and bus operators are used as the objective function; the public transportation network technical indicators are used as the constraint conditions. When designing the network, the transfer coefficient and the line length are used for the control conditions. The main through passenger is satisfied at first, and the initial network is laid out by the circular line. Then the bus network is revised according to the constraints conditions with the status of the road network. From the different purposes, different option should be compared by the value of objective function, and the optimal one is gained at last.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Circular Bus Network Planning Method in Chessboard-Shaped Road Network


    Contributors:

    Published in:

    Publication date :

    2012-10-26


    Size :

    5 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English





    Joint Calibration of Dual LiDARs and Camera Using a Circular Chessboard

    Yin, Dong / Shan, Fengwu / Xiong, Lu et al. | SAE Technical Papers | 2020


    Joint Calibration of Dual LiDARs and Camera Using a Circular Chessboard

    Deng, Zhenwen / Xiong, Lu / Yin, Dong et al. | British Library Conference Proceedings | 2020


    Joint Calibration of Dual LiDARs and Camera Using a Circular Chessboard

    Deng, Zhenwen / Xiong, Lu / Yin, Dong et al. | British Library Conference Proceedings | 2020


    Bus right road network planning method for urban road network

    ZHOU TAO / CHENG TAN / LI HAN et al. | European Patent Office | 2020

    Free access