Generation and design heuristics for zonal express services
Homero Larrain,
Juan Carlos Muñoz and
Ricardo Giesen
Transportation Research Part E: Logistics and Transportation Review, 2015, vol. 79, issue C, 201-212
Abstract:
A methodology is presented for designing zonal services for a bus corridor, in which buses visit all stops in a route’s initial and final segments, skipping all stops in between. Two heuristics are described, one for congested (binding capacity) and other for uncongested cases. An experiment on a bidirectional corridor shows that the heuristics can find savings in social costs of 6.6% and 10.3% when compared to an express-service-only solution. We also show that, in some cases, the zonal service design problem can be solved analytically, outperforming the heuristics. This suggests the two approaches could be employed in tandem.
Keywords: Public transport; Network design; Route design; Express services; Zonal services; Bus Rapid Transit (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S1366554515000976
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:transe:v:79:y:2015:i:c:p:201-212
Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic
http://www.elsevier. ... 600244/bibliographic
DOI: 10.1016/j.tre.2015.04.008
Access Statistics for this article
Transportation Research Part E: Logistics and Transportation Review is currently edited by W. Talley
More articles in Transportation Research Part E: Logistics and Transportation Review from Elsevier
Bibliographic data for series maintained by Catherine Liu ().