Abstract
The Periodic Event Scheduling Problem (PESP) is the method of choice for real-world periodic timetabling in public transport. Its MIP formulation has been studied intensely for the case of uniform modules, i.e., when all events have the same period. In practice, multiple periods are equally important. Yet, the powerful methods developed for uniform modules generally fail for the multi-module case. We analyze a certain type of Diophantine equation systems closely related to the multi-module PESP. Thereby, we identify a structure, so-called sharp trees, that allows to solve the system in \(\mathcal{O}(n^2)\) time if the modules form a linear lattice. Based on this we develop the machinery to solve multi-module PESPs on real-world scale. In our computational results the new MIP-formulations considerably improve the solvability of multi-module PESPs.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Conforti, M., Di Summa, M., Wolsey, L.: The mixing set with divisible capacities. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol. 5035, pp. 435–449. Springer, Heidelberg (2008)
Conforti, M., Zambelli, G.: The mixing set with divisible capacities: A simple approach. Operations Research Letters 37, 379–383 (2009)
Fischetti, M., Lodi, A.: Optimizing over the first Chvatal closure. Mathematical Programming 110(1), 3–20 (2006)
Galli, L., Stiller, S.: Strong Formulations for the Multi-module PESP and a Quadratic Algorithm for Graphical Diophantine Equation Systems. COGA Technical Report 009–2010 (2010)
Hassin, R.: A flow algorithm for network synchronization. Operations Research 44, 570–579 (1996)
Khot, S.: On the power of unique 2-prover 1-round games. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 767–775. ACM Press, New York (2002)
Köhler, E., Möhring, R., Nökel, K., Wünsch, G.: Optimization of Signalized Traffic Networks. In: Mathematics – Key Technology for the Future, pp. 179–180. Springer, Heidelberg (2008)
Liebchen, C.: Periodic Timetable Optimization in Public Transport. Ph.D. thesis, Technische Universität Berlin (2006)
Liebchen, C., Swarat, E.: The Second Chvatal Closure Can Yield Better Railway Timetables. In: Proceedings of 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. Online Schloss Dagstuhl (2008)
Liebchen, C., Proksch, M., Wagner, F.H.: Performance of Algorithms for Periodic Timetable Optimization. In: Computer-aided Systems in Public Transport, pp. 151–180. Springer, Heidelberg (2008)
Nachtigall, K.: Cutting planes for a polyhedron associated with a periodic network. DLR Technical Report 112-96/17
Odijk, M.: Construction of periodic timetables, Part1: a cutting plane algorithm. TU Delft Technical Report 94-61 (1994)
Odijk, M.: A constraint generation algorithm for the construction of periodic railway timetables. Transportation Research B 30(6), 455–464 (1996)
Peeters, L.: Cyclic Railway Timetable Optimization. Ph.D. thesis, Erasmus University of Rotterdam (2003)
Schrijver, A.: Theory of Linear and Integer Programming. Wiley & Sons, Chichester (1986)
Serafini, P., Ukovich, W.: A mathematical model for periodic scheduling problems. SIAM Journal on Discrete Mathematics 2(4), 550–581 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Galli, L., Stiller, S. (2010). Strong Formulations for the Multi-module PESP and a Quadratic Algorithm for Graphical Diophantine Equation Systems. In: de Berg, M., Meyer, U. (eds) Algorithms – ESA 2010. ESA 2010. Lecture Notes in Computer Science, vol 6346. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15775-2_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-15775-2_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15774-5
Online ISBN: 978-3-642-15775-2
eBook Packages: Computer ScienceComputer Science (R0)