[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

A Modulo Network Simplex Method for Solving Periodic Timetable Optimisation Problems

  • Conference paper
Operations Research Proceedings 2007

Part of the book series: Operations Research Proceedings ((ORP,volume 2007))

Abstract

In the last 15 years periodic timetable problems had been found much interest in combinatorial optimization. The results presented in [5, 9, 2, 3, 6, 7, 1] are based on a periodic event scheduling model published by Serafini and Ukovich [10].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 103.50
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 129.99
Price includes VAT (United Kingdom)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Kolonko, M. and Nachtigall, K. and Voget, S. (1996) Exponat der Universität Hildesheim auf der CeBit 96: Optimierung von integralen Taktfahrplänen mit genetischen Algorithmen Hildesheimer Informatik-Berichte 8/96

    Google Scholar 

  2. Liebchen, C. (2006) Periodic Timetable Optimization in Public Transport Dissertation, Institut für Mathematik, TU Berlin

    Google Scholar 

  3. Lindner, T. (2000) Train Shedule Optimization in Public Rail Transport Dissertation, TU Braunschweig

    Google Scholar 

  4. Nachtigall, K. (1996) Periodic Network Optimization with different Arc Frequencies Discrete Applied Mathematics 69:1–17

    Article  Google Scholar 

  5. Nachtigall, K. (1998) Periodic Network Optimization and Fixed Interval Timetables Habilitationsschrift, Universität Hildesheim Institutsbericht (IB) 112-99/02, Deutsches Institut für Luft-und Raumfahrt, Braunschweig

    Google Scholar 

  6. Odijk, M.(1994) Construction of Periodic Timetables-Part I: A Cutting Plane Algorithm Technical Report, Department of Mathematics and Computer Science, University of Technology. Delft, The Netherlands

    Google Scholar 

  7. Peeters, L.W.P. (2003) Cyclic Railway Timetable Optimization Dissertation, Erasmus Research Institut of Management, Erasmus University, Rotterdam

    Google Scholar 

  8. Schrijver, A. (1986) Theory of Linear and Integer Programming, J. Wiley and Sons, Chichester New York Brisbane Toronto Singapore

    Google Scholar 

  9. Schrijver, A. and Steenbeek, A. (1994) Dienstregelingontwikkeling voor Railned Technical Report, Centrum voor Wiskunde en Informatica

    Google Scholar 

  10. Serafini, P. and Ukovich, W. (1989) A Mathematical Model for Periodic Scheduling Problems SIAM J. Discrete Math 4/2:550–581

    Article  Google Scholar 

  11. Weigand, W. (1983) The Man-Maschine Dialogue and Timetable Planning Rail International 3:8–25

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nachtigall, K., Opitz, J. (2008). A Modulo Network Simplex Method for Solving Periodic Timetable Optimisation Problems. In: Kalcsics, J., Nickel, S. (eds) Operations Research Proceedings 2007. Operations Research Proceedings, vol 2007. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77903-2_71

Download citation

Publish with us

Policies and ethics