An improved solution methodology for the urban transit routing problem

DOI10.1016/J.COR.2023.106481MaRDI QIDQ6551086zbMATH OpenFDO

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

Publication date 6 June 2024

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

Full work available at URL https://doi.org/10.1016/J.COR.2023.106481

zbMATH Keywords

dominance-based multi-objective simulated annealinghyperheuristicmetaheuristicnon-dominated sorting genetic algorithm IItransit network design problemurban transit routing problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A demand based route generation algorithm for public transit network design
• A metaheuristic approach to the urban transit routing problem
• A note on two problems in connexion with graphs
• Finding the K Shortest Loopless Paths in a Network
• Graph and network theory. An applied approach using Mathematica
• scientific article; zbMATH DE number 3664728 (Why is no real title available?)
• Metaheuristics for Hard Optimization
• Optimization by simulated annealing
• Solving urban transit route design problem using selection hyper-heuristics

Cited in

(2)

• A decentralised genetic algorithm with sub-objectives for the transit network design problem
• An exact approach for the transit route network design problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6551086)