IDEAS home Printed from https://ideas.repec.org/a/sae/envira/v18y1986i4p465-483.html
   My bibliography  Save this article

Scheduling of Interstate Road and Railway Investments

Author

Listed:
  • W Rothengatter

    (Abteilung Wirtschaftswissenschaften, Universität Ulm, 79 Ulm, FRG)

Abstract

If investment activities are restricted by binding budget constraints, it may be even more important to find a good time schedule for investments rather than to determine the optimal investment program for a future time period. The problem of scheduling investments for interstate road and railway investments can be formulated as a mixed-integer programming model. But this model is so large, that it is hopeless to try to solve problems of practical relevance. For this reason two ways of simplifying the problem are discussed. The first method focuses on modelling of budget feasibilities over time, and the second method stresses the interdependencies of network improvements. As these interdependencies are predominantly affected by the interrelationships between network structure and travel flow pattern, it is important to model travel demand for competing transportation modes in a sufficiently precise way. An algorithm for combined two-mode modal choice and travel assignment is presented which generates the changes in travel demand affected by a change in the network structure in an efficient way. A test network is used to illustrate the computations and the efficiency of the methods presented.

Suggested Citation

  • W Rothengatter, 1986. "Scheduling of Interstate Road and Railway Investments," Environment and Planning A, , vol. 18(4), pages 465-483, April.
    • Handle: RePEc:sae:envira:v:18:y:1986:i:4:p:465-483
    DOI: 10.1068/a180465
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1068/a180465
    Download Restriction: no
    File URL: https://libkey.io/10.1068/a180465?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Larry J. LeBlanc & Keyvan Farhangian, 1981. "Efficient Algorithms for Solving Elastic Demand Traffic Assignment Problems and Mode Split-Assignment Problems," Transportation Science, INFORMS, vol. 15(4), pages 306-317, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xu, Meng & Chen, Anthony & Gao, Ziyou, 2008. "An improved origin-based algorithm for solving the combined distribution and assignment problem," European Journal of Operational Research, Elsevier, vol. 188(2), pages 354-369, July.
    2. Mori, Kentaro & Miwa, Tomio & Abe, Ryosuke & Morikawa, Takayuki, 2022. "Equilibrium analysis of trip demand for autonomous taxi services in Nagoya, Japan," Transportation Research Part A: Policy and Practice, Elsevier, vol. 166(C), pages 476-498.
    3. D E Boyce, 1984. "Urban Transportation Network-Equilibrium and Design Models: Recent Achievements and Future Prospects," Environment and Planning A, , vol. 16(11), pages 1445-1474, November.
    4. Lam, William H. K. & Tam, M. L., 1997. "Why standard modelling and evaluation procedures are inadequate for assessing traffic congestion measures," Transport Policy, Elsevier, vol. 4(4), pages 217-223, October.
    5. Codina, Esteve & Barcelo, Jaume, 2004. "Adjustment of O-D trip matrices from observed volumes: An algorithmic approach based on conjugate directions," European Journal of Operational Research, Elsevier, vol. 155(3), pages 535-557, June.
    6. Kitthamkesorn, Songyot & Chen, Anthony, 2017. "Alternate weibit-based model for assessing green transport systems with combined mode and route travel choices," Transportation Research Part B: Methodological, Elsevier, vol. 103(C), pages 291-310.
    7. García, Ricardo & Marín, Angel, 2005. "Network equilibrium with combined modes: models and solution algorithms," Transportation Research Part B: Methodological, Elsevier, vol. 39(3), pages 223-254, March.
    8. Chen, Anthony & Choi, Keechoo, 2017. "Solving the combined modal split and traffic assignment problem with two types of transit impedance functionAuthor-Name: Ryu, Seungkyu," European Journal of Operational Research, Elsevier, vol. 257(3), pages 870-880.
    9. Cantarella, Giulio Erberto & Cartenì, Armando & de Luca, Stefano, 2015. "Stochastic equilibrium assignment with variable demand: Theoretical and implementation issues," European Journal of Operational Research, Elsevier, vol. 241(2), pages 330-347.
    10. D E Boyce & K S Chon & Y J Lee & K T Lin & L J LeBlanc, 1983. "Implementation and Computational Issues for Combined Models of Location, Destination, Mode, and Route Choice," Environment and Planning A, , vol. 15(9), pages 1219-1230, September.
    11. Jian Wang & Muqing Du & Lili Lu & Xiaozheng He, 2018. "Maximizing Network Throughput under Stochastic User Equilibrium with Elastic Demand," Networks and Spatial Economics, Springer, vol. 18(1), pages 115-143, March.
    12. David Boyce, 2007. "Forecasting Travel on Congested Urban Transportation Networks: Review and Prospects for Network Equilibrium Models," Networks and Spatial Economics, Springer, vol. 7(2), pages 99-128, June.

    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:sae:envira:v:18:y:1986:i:4:p:465-483. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: SAGE Publications (email available below). General contact details of provider: .

    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.