Solving large-scale instances of the urban transit routing problem with a parallel artificial bee colony-hill climbing optimization algorithm
Authors:
- Alexandros ZervasAZAlexandros Zervas
- Christina IliopoulouCIChristina Iliopoulou
- Ioannis TassopoulosITIoannis Tassopoulos
- Grigorios BeligiannisGrigorios Beligiannis
- 15 October 2024
- journal article
- research article
- Published by Elsevier in Applied Soft Computing
- Vol. 167
Abstract
No abstract availableKeywords
This publication has 54 references indexed in Scilit:
- An artificial fish swarm optimization algorithm for the urban transit routing problemApplied Soft Computing, 2024
- A survey on the transit network design and frequency setting problemPublic Transport, 2021
- Metaheuristics for the transit route network design problem: a review and comparative analysisPublic Transport, 2019
- A multiobjective bilevel approach based on global-best harmony search for defining optimal routes and frequencies for bus rapid transit systemsApplied Soft Computing, 2018
- Solving the Urban Transit Routing Problem using a particle swarm optimization based algorithmApplied Soft Computing, 2014
- Line planning in public transportation: models and methodsOR Spectrum, 2011
- A metaheuristic approach to the urban transit routing problemJournal of Heuristics, 2008
- A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithmJournal of Global Optimization, 2007
- Lifelong Planning A∗Artificial Intelligence, 2004
- Evaluation and optimization of urban public transportation networksEuropean Journal of Operational Research, 1980