Abstract
This paper studied the classic feeder-bus network design problem (FBNDP), which can be described as follows: for the passenger travel demand between rail stations and bus stops on a given urban transit network, it designs the optimal feeder bus routes and frequencies so as to minimize the passengers’ travel expense and the operator’s cost. We extended the demand pattern of M-to-1 in most existing researches to M-to-M. We comprehensively considered the passenger travel cost, which includes the waiting and riding cost on the bus, riding cost on rail, and transfer cost between these two transportation modes, and presented a new genetic algorithm that determines the optimal feeder-bus operating frequencies under strict constraint conditions. The numerical examples under different demand patterns have been experienced and analysed, which showed the robustness and efficiency of the presented algorithm. We also found that the distribution pattern of the travel demand has a significant influence on the feeder-bus network construction.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
