An exact approach for the transit route network design problem

DOI10.1016/J.EJOR.2026.04.020MaRDI QIDQ7260908zbMATH OpenFDO

Authors Wentao Gao, Ji-Hui Ma, Yanbo He, Chunjiao Dong

Publication date 9 June 2026

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2026.04.020

zbMATH Keywords

branch-and-cut (B\&C)integer linear programming (ILP)transit route network design problem (TRNDP)

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A bi-objective decision model and method for the integrated optimization of bus line planning and Lane reservation
• A decentralised genetic algorithm with sub-objectives for the transit network design problem
• A metaheuristic approach to the urban transit routing problem
• A review of urban transportation network design problems
• A survey on robustness in railway planning
• An improved solution methodology for the urban transit routing problem
• Evaluation and optimization of urban public transportation networks
• Integer Programming Formulation of Traveling Salesman Problems
• Integrating routing decisions in public transportation problems
• Solving urban transit route design problem using selection hyper-heuristics

This page was built for publication: An exact approach for the transit route network design problem

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