- search hit 1 of 1
Models for Line Planning with Transfers
Please always quote using this URN: urn:nbn:de:0297-zib-11742
- We propose a novel integer programming approach to transfer minimization for line planning problems in public transit. The idea is to incorporate penalties for transfers that are induced by “connection capacities” into the construction of the passenger paths. We show that such penalties can be dealt with by a combination of shortest and constrained shortest path algorithms such that the pricing problem for passenger paths can be solved efficiently. Connection capacity penalties (under)estimate the true transfer times. This error is, however, not a problem in practice. We show in a computational comparison with two standard models on a real-world scenario that our approach can be used to minimize passenger travel and transfer times for large-scale line planning problems with accurate results.
Author: | Ralf BorndörferORCiD, Marika Neumann |
---|---|
Document Type: | ZIB-Report |
Tag: | Ganzzahlige Programmierung; Kombinatorische Optimierung; Linienplanung; Umsteigen combinatorial optimization; integer programming; line planning; transfers |
MSC-Classification: | 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Bxx Operations research and management science / 90B20 Traffic problems |
90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C10 Integer programming | |
Contributing Corporation: | Matheon |
Date of first Publication: | 2010/06/14 |
Series (Serial Number): | ZIB-Report (10-11) |
ISSN: | 1438-0064 |
ZIB-Reportnumber: | 10-11 |