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.
and Stützle, Thomas , year =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Introduces SSAP and reports that an Iterated Local Search heuristic outperforms a commercial solver on complex classroom instances with many conflicts.
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.