A set covering approach to bus stop location

This paper considers the problem of locating bus stops in the context of a set covering problem. Zero-one integer programming models are suggested for use in the location of bus stops on new routes and for use in the location of express bus stops on current routes. The models may be used to locate the minimum number of (express) bus stops required to ensure that no passenger need walk more than a specified distance to reach an (express) bus stop. A modified version of the model is presented which enables the router to locate a specified number of (express) bus stops in such a manner that the total distance walked by all boarders is minimized.