Show simple item record

Locating Stops Along Bus or Railway Lines—A Bicriteria Problem

dc.contributor.authorSchöbel, Anita
dc.date.accessioned2010-11-16T08:55:21Z
dc.date.available2010-11-16T08:55:21Z
dc.date.issued2005
dc.identifier.citationSchöbel, Anita (2005): Locating Stops Along Bus or Railway Lines—A Bicriteria Problem - Annals of Operations Research, Vol. 136, Nr. 1, p. 211-227
dc.identifier.urihttp://resolver.sub.uni-goettingen.de/purl?gs-1/5718
dc.description.abstractIn 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.
dc.language.isoeng
dc.rightsopenAccess
dc.subjectset covering; bicriterial, location; dynamic programming; public transportation
dc.subject.ddc510
dc.titleLocating Stops Along Bus or Railway Lines—A Bicriteria Problem
dc.typejournalArticle
dc.identifier.doi10.1007/s10479-005-2046-0
dc.type.versionsubmittedVersion
dc.bibliographicCitation.volume136
dc.bibliographicCitation.issue1
dc.bibliographicCitation.firstPage211
dc.bibliographicCitation.lastPage227
dc.type.subtypejournalArticle
dc.description.statuspeerReviewed
dc.bibliographicCitation.journalAnnals of Operations Research


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record