A multi-objective meta-heuristic approach for the transit network design and frequency setting problem
| Autor: | Halim Ceylan, Buket Capali |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
Optimization
Operations research Computer science Transit network design Geography Planning and Development 0211 other engineering and technologies network design Transportation 02 engineering and technology heuristics NP-hard Evolutionary algorithms Frequency setting case study Traveling salesman problem Urban transit numerical application 0502 economics and business Meta heuristic Transportation routes urban transport public transport 050210 logistics & transportation evaluation algorithm 05 social sciences numerical method 021107 urban & regional planning routing network design Original algorithms intelligent water drops algorithm Intelligent Water Drops (IWD) passenger assignment Meta-heuristic approach Evolutionary Optimization Techniques Transit network Environmental costs Heuristic methods Public transport network Public transport networks |
| Popis: | 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. © 2020 Informa UK Limited, trading as Taylor & Francis Group. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|