Skip to main content

On Fair Zone Designs in Public Transportation

  • Conference paper
Computer-Aided Transit Scheduling

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 430))

Abstract

In this paper we develop some tools for designing balanced zones in public transportation networks. A zone in such a network is a set of stations which are treated as a unit as far as the fares for the passengers are concerned: The zone tariff is only dependent on the starting and ending zones of their travel. A fair zoning is one where the zone tariff is as close as possible to the distance tariff which relates the fare to the actual distance of a customer trip. In particular, the goal of a fair zone design is that neither the public transportation company nor the customer will have major disadvantages in the transition from distance tariff to zone tariff.

We will consider three objective functions which model this goal. If the zones are fixed we will show how to choose the tariffs in order to minimize the respective objective functions. This result will be combined with Greedy heuristics to design simultaneously zones and the corresponding tariffs. The paper is concluded by an application of our methods to the data of a regional public transportation company in Germany and a summary of further research in this area.

Partially supported by grants from the Deutsche Forschungsgemeinschaft and the Ministerium für Wissenschaft und Weiterbildung, Rheinland-Pfalz

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • 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.

References

  • Floyd, R.W (1962): Algorithm 97: Shortest path. in: Communications of the ACM 5, 345

    Article  Google Scholar 

  • Duran, B.S. / Odell, P.L. (1974): Cluster analysis: A survey. (Springer) Berlin, Heidelberg, New York

    Google Scholar 

  • Rohlf, FJ. (1982): Single link clustering algorithms. in: Krishnaiah, P.R. and Kanal, L.N. (eds.): Handbook of Statistics, Vol 2, (North-Holland), 267–284

    Google Scholar 

  • Sarkadi, K. / Vincze, I. (1974): Mathematical Methods of Statistical Quality Control. (Academic Press) New York, London

    Google Scholar 

  • Schumacher, A. (1993): Methoden der kombinatorischen Optimierung in der Tarifplanung im öffentlichen Personennahverkehr. Diploma Thesis, Department of Mathematics, University of Kaiserslautern

    Google Scholar 

  • Warshall, S. (1962): A Theorem on Boolean Matrices. in: Journal of the ACM 9, 11–12

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hamacher, H.W., Schöbel, A. (1995). On Fair Zone Designs in Public Transportation. In: Daduna, J.R., Branco, I., Paixão, J.M.P. (eds) Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems, vol 430. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-57762-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-57762-8_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60193-7

  • Online ISBN: 978-3-642-57762-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics