An improved solution methodology for the urban transit routing problem

DOI10.1016/j.cor.2023.106481MaRDI QIDQ6551086

G. Hüsselmann, S. J. Andersen, Jan H. van Vuuren

Publication date: 6 June 2024

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

metaheuristicnon-dominated sorting genetic algorithm IItransit network design problemhyperheuristicdominance-based multi-objective simulated annealingurban transit routing problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Optimization by Simulated Annealing
• A demand based route generation algorithm for public transit network design
• A metaheuristic approach to the urban transit routing problem
• Solving urban transit route design problem using selection hyper-heuristics
• Graph and network theory. An applied approach using Mathematica
• Metaheuristics for Hard Optimization
• Finding the K Shortest Loopless Paths in a Network

This page was built for publication: An improved solution methodology for the urban transit routing problem