An Algorithm for Bus Network Design

We consider the problem of designing the public bus transit network of a medium size city. The goal is to produce bus routes so that the overall travelling time of the passengers is minimized. Our approach consists in breaking down the original problem into two smaller subproblems or phases. In the first phase we generate a large set of good candidate routes. We describe and implement five different route generation heuristics and compare their performance. In the second phase we take the candidate routes as input and use an integer programming model to choose the final set of routes. For the second phase we compare the commercial solver CPLEX with a Lagrangian relaxation approach. It turns out that this second method is much faster to produce solutions of similar quality.

By: Francisco Barahona, João P. M. Gonçalves, Richard Santiago, Chai Wah Wu

Published in: RC25639 in 2016


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to .