Abstract

Developing public transportation is an effective way to alleviate traffic congestion and reduce fossil fuel consumption. However, the result of ineffective public transport planning can be that some bus lines have long overlapping intervals, and share many common stops between them, which causes a significant waste of resources. The current bus scheduling method does not consider the imbalance of passenger flow between different stops or combine the overlapping interval with transit mixed scheduling, including all-stop and stop-skipping services. Therefore, based on the analysis of the characteristics of overlapping interval, this paper proposes a combined bus scheduling method, which includes both all-stop and stop-skipping bus services. The method is a deterministic method applied in the scheduling stage of transit planning. The method optimizes scheduling strategies by minimizing total passenger travel time, including the waiting time and the in-vehicle travel time, and the line frequency of each bus service is taken as the decision variable. Then a genetic algorithm is designed to find the optimal solution. The model is verified by two bus lines in Changchun city. The experimental results showed that the proposed model could reduce total passenger travel time by 7.71% compared with the existing scheduling method. The combined bus scheduling method can supplement the research on bus scheduling of overlapping routes and provide suggestions for operators.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.