A variable neighborhood search algorithm for a public bus line with a demand-responsive operation during peak hours
Dilay Aktaş,
Kenneth Sörensen and
Pieter Vansteenwegen
Transportation Planning and Technology, 2023, vol. 46, issue 5, 615-652
Abstract:
In this study, we propose a variable neighborhood search (VNS) algorithm to optimize the performance of a single bus line during peak hours where the passenger flows in one direction are typically much larger than the flows in the opposite direction. The system we propose aims to increase the frequency of the service towards the city center during morning peak hours, by allowing some of the vehicles to perform short-cut trips away from the city center. Just before the morning peak hours and based on the expected demand, the VNS algorithm decides which buses should visit all the stops ahead or take a short-cut during its return trip. Experiments show that with the demand-responsive system, total passenger travel time improves about 10% on average for a real-size benchmark instance. The performance of the system is also analyzed under different fleet size and capacity, duration of peak hours, and demand scenarios.
Date: 2023
References: Add references at CitEc
Citations:
Downloads: (external link)
http://hdl.handle.net/10.1080/03081060.2023.2213313 (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:taf:transp:v:46:y:2023:i:5:p:615-652
Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/GTPT20
DOI: 10.1080/03081060.2023.2213313
Access Statistics for this article
Transportation Planning and Technology is currently edited by Dr. David Gillingwater
More articles in Transportation Planning and Technology from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().