IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v22y1988i1p25-44.html
   My bibliography  Save this article

A quadratic programming model for designing and evaluating distance-based and zone fares for urban transit

Author

Listed:
  • Daskin, Mark S.
  • Schofer, Joseph L.
  • Haghani, Ali E.

Abstract

A microcomputer based system for designing and evaluating distance-based and zone fares for transit properties is described. At the heart of the system is an optimization model that finds the fixed charge, mileage charge, and transfer charge that maximize gross revenue subject to constraints on ridership and the form of the fare equation. A linear approximation to the demand curve at the base case values results in a quadratic programming problem. Three alternative modes of using the model system are demonstrated using selected data from the Chicago Transit Authority. Model extensions and proposed future work are outlined.

Suggested Citation

  • Daskin, Mark S. & Schofer, Joseph L. & Haghani, Ali E., 1988. "A quadratic programming model for designing and evaluating distance-based and zone fares for urban transit," Transportation Research Part B: Methodological, Elsevier, vol. 22(1), pages 25-44, February.
    • Handle: RePEc:eee:transb:v:22:y:1988:i:1:p:25-44
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0191-2615(88)90032-X
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Huang, Di & Liu, Zhiyuan & Liu, Pan & Chen, Jun, 2016. "Optimal transit fare and service frequency of a nonlinear origin-destination based fare structure," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 96(C), pages 1-19.
    2. Saeed Maadi & Jan-Dirk Schmöcker, 2020. "Route choice effects of changes from a zonal to a distance-based fare structure in a regional public transport network," Public Transport, Springer, vol. 12(3), pages 535-555, October.
    3. Liu, Zhiyuan & Wang, Shuaian & Meng, Qiang, 2014. "Optimal joint distance and time toll for cordon-based congestion pricing," Transportation Research Part B: Methodological, Elsevier, vol. 69(C), pages 81-97.
    4. Guo, Qianwen & Sun, Yanshuo & Schonfeld, Paul & Li, Zhongfei, 2021. "Time-dependent transit fare optimization with elastic and spatially distributed demand," Transportation Research Part A: Policy and Practice, Elsevier, vol. 148(C), pages 353-378.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:22:y:1988:i:1:p:25-44. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.