Maximizing Trip Coverage in the Location of a Single Rapid Transit Alignment

Gilbert Laporte (), Juan Mesa (), Francisco Ortega () and Ignacio Sevillano ()

Annals of Operations Research, 2005, vol. 136, issue 1, 49-63

Abstract: This article describes several heuristics for the construction of a rapid transit alignment. The objective is the maximization of the total origin-destination demand covered by the alignment. Computational results show that the best results are provided by a simple greedy extension heuristic. This conclusion is confirmed on the Sevilla data for scenarios when the upper bound for inter-station distance is greater than 1250 m. Otherwise, when those upper bounds are smaller (750 m and 1000 m), an insertion heuristic followed by a post-optimization phase yields the best results. Computational times are always insignificant. Copyright Springer Science + Business Media, Inc. 2005

Keywords: transit systems; trip coverage; effectiveness; heuristics (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (22)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-005-2038-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:49-63:10.1007/s10479-005-2038-0

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

DOI: 10.1007/s10479-005-2038-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 ().