Abstract

This paper proposes a new approach to solve the problem of bus network design and frequency setting (BNDFS). Transit network design must satisfy the needs of both service users and transit operators. Numerous optimisation techniques have been proposed for BNDFS in the literature. Previous approaches tend to adopt a sequential optimisation strategy that conducts network routing and service frequency setting in two separate steps. To address the limitation of sequential optimisation, our new algorithm uses Reinforcement Learning for a simultaneous optimisation of three key components of BNDFS: the number of bus routes, the route design and service frequencies. The algorithm can design the best set of bus routes without defining the total number of bus routes in advance, which can reduce the overall computational time. The proposed algorithm was tested on the benchmark Mandl Swiss network. The algorithm is further extended to the routing of express services. The validation includes additional test scenarios which modify the transit demand level on the Mandl network. The new algorithm can be useful to assist transit agencies and planners in improving existing routing and service frequency to cope with changing demand conditions.

Full Text
Paper version not known

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.