Routing in Line Planning for Public Transportation
Please always quote using this URN:urn:nbn:de:0296-matheon-2960
- The line planning problem is one of the fundamental problems in strategic planning of public and rail transport. It consists in finding lines and corresponding frequencies in a network such that a giv en demand can be satisfied. There are two objectives. passengers want to minimize travel times, the transport company wishes to minimize operating costs. We investigate three variants of a multi-commo dity flow model for line planning that differ with respect to passenger routings. The first model allows arbitrary routings, the second only unsplittable routings, and the third only shortest path rou tings with respect to the network. We compare these models theoretically and computationally on data for the city of Potsdam.
Download full text files
Additional Services
| Author: | Marc E. Pfetsch, Ralf Borndörfer |
|---|---|
| URN: | urn:nbn:de:0296-matheon-2960 |
| Referee: | Martin Grötschel |
| Document Type: | Preprint, Research Center Matheon |
| Language: | English |
| Date of first Publication: | 2007/03/31 |
| Release Date: | 2007/03/28 |
| Tag: | |
| MSC-Classification: | 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Bxx Operations research and management science / 90B06 Transportation, logistics |
| 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C27 Combinatorial optimization | |
| Preprint Number: | 379 |
