Skip to main content

Part of the book series: Springer Optimization and Its Applications ((SOIA,volume 89))

  • 1352 Accesses

Abstract

This book treats three optimization problems arising in public railway transportation, namely

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

Access this chapter

eBook
USD 19.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 29.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 29.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network flows. Prentice Hall, Inc., 1993.

    MATH  Google Scholar 

  2. M. R. Bussieck, T. Lindner, and U. T. Zimmermann. Discrete optimization in public rail transport. Mathematical Programming, 79:415–444, 1997.

    MATH  MathSciNet  Google Scholar 

  3. A. Caprara, L. Kroon, and P. Toth. Optimization problems in passenger railway systems. In J. J. Cochran, L. A. Cox, P. Keskinocak, J. P. Kharoufeh, and J. C. Smith, editors, Wiley Encyclopedia of Operations Research and Management Science. John Wiley & Sons, Inc., 2010.

    Google Scholar 

  4. G. Desaulniers and M. D. Hickmann. Public transit. In Handbook in OR & MS, volume 14, pages 69–127. Elsevier, 2007.

    Google Scholar 

  5. R. Diestel. Graph Theory. Springer, 3rd edition, 2006.

    Google Scholar 

  6. M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34:596–615, 1987.

    Article  MathSciNet  Google Scholar 

  7. V. Guihaire and J.-T. Hao. Transit network design and scheduling: A global review. Transportation Research Part E, 42:1251–1273, 2008.

    Google Scholar 

  8. M. R. Garey and D. S. Johnson. Computers and Intractability—A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.

    MATH  Google Scholar 

  9. M. Gatto, R. Jacob, L. Peeters, B. Weber, and P. Widmayer. Theory on the tracks: A selection of railway optimization problems. Bulletin of the EATCS, 84:41–70, 2004.

    MATH  MathSciNet  Google Scholar 

  10. D. Huisman, L. G. Kroon, R. M. Lentink, and M. J. C. M. Vromans. Operations research in passenger railway transportation. Statistica Neerlandica, 59:467–497, 2005.

    Article  MATH  MathSciNet  Google Scholar 

  11. C. Liebchen and R. Möhring. The modeling power of the periodic event scheduling problem: Railway timetables and beyond. In F. Geraets, L. Kroon, A. Schoebel, D. Wagner, and C. Zaroliagis, editors, Algorithmic Methods for Railway Optimization, volume 4359 of Lecture Notes in Computer Science, pages 3–40. Springer Berlin Heidelberg, 2007.

    Google Scholar 

  12. G. L. Nemhauser and L. A. Wolsey. Integer and Combinatorial Optimization. Wiley, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media New York

About this chapter

Cite this chapter

Schmidt, M.E. (2014). Introduction. In: Integrating Routing Decisions in Public Transportation Problems. Springer Optimization and Its Applications, vol 89. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-9566-6_1

Download citation

Publish with us

Policies and ethics