Locating Stops Along Bus or Railway Lines—A Bicriteria Problem

Anita Schöbel ()

Annals of Operations Research, 2005, vol. 136, issue 1, 227 pages

Abstract: In this paper we consider the location of stops along the edges of an already existing public transportation network. This can be the introduction of bus stops along given routes, or of railway stations along the tracks in a railway network. The goal is to achieve a maximal covering of given demand points with a minimal number of stops. This bicriteria problem is in general NP-hard. We present a finite dominating set yielding an IP-formulation as a bicriteria set covering problem. Using this formulation we discuss cases in which the bicriteria stop location problem can be solved in polynomial time. Extensions for tackling real-world instances are mentioned. Copyright Springer Science + Business Media, Inc. 2005

Keywords: set covering; bicriterial; location; dynamic programming; public transportation (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-005-2046-0 (text/html)
Access to full text is restricted to subscribers.

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:spr:annopr:v:136:y:2005:i:1:p:211-227:10.1007/s10479-005-2046-0

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-005-2046-0

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().