A set covering approach to bus stop location

John M. Gleason

Omega, 1975, vol. 3, issue 5, 605-608

Abstract: 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.

Date: 1975
References: Add references at CitEc
Citations: View citations in EconPapers (19)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0305-0483(75)90033-X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:3:y:1975:i:5:p:605-608

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu (repec@elsevier.com).