Sciweavers

ATMOS
2010

The Complexity of Integrating Routing Decisions in Public Transportation Models

13 years 3 months ago
The Complexity of Integrating Routing Decisions in Public Transportation Models
To model and solve optimization problems arising in public transportation, data about the passengers is necessary and has to be included in the models in any phase of the planning process. Many approaches assume a two-step procedure: in a first step, the data about the passengers is distributed over the public transportation network using traffic-assignment procedures. In a second step, the actual planning of lines, timetables, etc. takes place. This approach ignores that for most passengers there are many possible ways to reach their destinations in the public transportation network, thus the actual connections the passengers will take depend strongly on the decisions made during the planning phase. In this paper we investigate the influence of integrating the traffic assignment procedure in the optimization process on the complexity of line planning and aperiodic timetabling. In both problems, our objective is to maximize the passengers’ benefit, namely to minimize the overall ...
Marie Schmidt, Anita Schöbel
Added 12 Jan 2011
Updated 12 Jan 2011
Type Journal
Year 2010
Where ATMOS
Authors Marie Schmidt, Anita Schöbel
Comments (0)