Abstract
SUMMARYThis article presents a bi‐level optimization model to assign optimal bus sizes and frequencies to public transport routes. The upper level problem of the proposed model minimizes a cost function representing the costs of the users and operators, and the lower level solves a public transport assignment model subject to a capacity constraint. The article discusses the benefits of using either Hooke–Jeeves or tabu search algorithms for solving the bi‐level model. Following the real‐case application to the city of Santander (Spain), it is concluded that both algorithms lead to very similar solutions. It has also been shown that when both algorithms start from the same homogenous solution, the convergence speed of tabu search is almost 50% quicker than that of Hooke–Jeeves, making tabu search more attractive if there is a need to solve a problem many times and for large networks. Copyright © 2012 John Wiley & Sons, Ltd.
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.
