A multi-objective meta-heuristic approach for the transit network design and frequency setting problem

Buket Capali and Halim Ceylan

Transportation Planning and Technology, 2020, vol. 43, issue 8, 851-867

Abstract: The Transit Network Design and Frequency Setting Problem (TNDFSP) can be defined as the creation of effective routes in a public transport network and the determination of relevant frequencies. Generally, the TNDFSP problem is in the same category as the Traveling Salesman Problem (TSP), which is known to be a non-deterministic polynomial-period (NP-hard) difficult problem. This study consists of two stages: first, the design of a public transport network with an evolutionary optimization technique – the Intelligent Water Drops (IWD) algorithm – based on the TSP and the determination of relevant frequencies; and second, the assignment of passengers to designated routes. All decisions related to public transport network design may be evaluated by considering environmental costs in relation to passengers, operators and the environment. This study presents an acceptable, constructive and original algorithm.

Date: 2020
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1080/03081060.2020.1829093 (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:43:y:2020:i:8:p:851-867

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/GTPT20

DOI: 10.1080/03081060.2020.1829093

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 ().