A heuristic transit network design algorithm for medium size towns

Abstract

The paper present a three-step sequential procedure combining simple heuristic techniques and a Genetic algorithm to generate a transit lines network that approaches the minimum overall system cost. To start with, a heuristic algorithm is used to generate a set of feasible routes. Then, a Genetic algorithm selects the optimal subset of routes with associated frequencies. Finally, route modifications are tested to improve the network configuration (extension, shortening, expansion to other nodes).