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.
Transportation Research Part C: Emerging Technologies137, 103573 (Apr 2022).https://doi
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Delineates P vs NP-hard boundaries for LiDARP and MinTurn by instance parameters and supplies parameterized algorithms.
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.