Journal of the ACM (JACM)
Discrete optimization in public rail transport
Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Operations Research
A Branch-and-Cut Approach for Solving Railway Line-Planning Problems
Transportation Science
Selfish Routing in Capacitated Networks
Mathematics of Operations Research
Multicriteria Optimization
A route set construction algorithm for the transit network design problem
Computers and Operations Research
On an exact method for the constrained shortest path problem
Computers and Operations Research
Models for fare planning in public transport
Discrete Applied Mathematics
Service-Oriented Line Planning and Timetabling for Passenger Trains
Transportation Science
AllAboard: visual exploration of cellphone mobility data to optimise public transport
Proceedings of the 19th international conference on Intelligent User Interfaces
| Hi-index | 0.00 |
The line-planning problem is one of the fundamental problems in strategic planning of public and rail transport. It involves finding lines and corresponding frequencies in a transport network such that a given travel demand can be satisfied. There are (at least) two objectives: the transport company wishes to minimize operating costs, and the passengers want to minimize traveling times. We propose a new multicommodity flow model for line planning. Its main features, in comparison to existing models, are that the passenger paths can be freely routed and lines are generated dynamically. We discuss properties of this model, investigate its complexity, and present a column-generation algorithm for its solution. Computational results with data for the city of Potsdam, Germany, are reported.