An iterative exact algorithm solves a mixed-integer line planning model faster than CPLEX by dynamically expanding paths and frequencies, and accounting for lost demand improves overall resource efficiency.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.OC 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
A tabu search heuristic finds spanning trees minimizing passenger-kilometers in transit networks, with a greedy extension to add links, demonstrated on Canberra bus data.
citing papers explorer
-
An Exact Algorithm for Public Transport Line Planning Considering Passenger and Operational Costs and Lost Demand
An iterative exact algorithm solves a mixed-integer line planning model faster than CPLEX by dynamically expanding paths and frequencies, and accounting for lost demand improves overall resource efficiency.
-
Urban transit network design using spanning tree: A case study of Canberra transit network
A tabu search heuristic finds spanning trees minimizing passenger-kilometers in transit networks, with a greedy extension to add links, demonstrated on Canberra bus data.