A route set construction algorithm for the transit network design problem

DOI10.1016/j.cor.2008.09.014zbMath1179.90053OpenAlexW2034158924MaRDI QIDQ1010301

María E. Urquhart, Antonio Mauttone

Publication date: 3 April 2009

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

Full work available at URL: https://doi.org/10.1016/j.cor.2008.09.014

zbMATH Keywords

heuristicconstructive algorithmdemand covering constraintstransit network design problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Related Items

GRASP algorithms for the robust railway network design problem ⋮ Frequency optimization in public transportation systems: formulation and metaheuristic approach ⋮ Solving urban transit route design problem using selection hyper-heuristics ⋮ A demand based route generation algorithm for public transit network design ⋮ The transit route arc-node service maximization problem ⋮ A simultaneous bus route design and frequency setting problem for Tin Shui Wai, Hong Kong ⋮ Multi-objective optimization of urban bus network using cumulative prospect theory ⋮ Line planning in public transportation: models and methods ⋮ Tree network design avoiding congestion ⋮ A review of urban transportation network design problems

Uses Software

• Tabu search

Cites Work

• Greedy randomized adaptive search procedures
• A mixed integer formulation for multiple-route transit network design
• Finding the K Shortest Loopless Paths in a Network
• Handbook of metaheuristics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item