IDEAS home Printed from https://ideas.repec.org/p/hhs/ctswps/2012_025.html
   My bibliography  Save this paper

Congestion and scarcity in scheduled transport modes

Author

Abstract

This is a draft text for a chapter in Handbook on Research Methods in Transport Economics and Policy to be published by Edward Elgar Publishing. It provides an overview of issues related to scarcity in scheduled transport modes with emphasis on railways. The paper separates the scarcity or time-tabling problem into two analytical parts. The first concerns the challenges related with finding an approximate solution to the mathematically challenging NP complete problem. The second generic problem is related to base the solution to this challenge on the operators’ value of each departure slot.

Suggested Citation

  • Nilsson, Jan-Eric, 2012. "Congestion and scarcity in scheduled transport modes," Working papers in Transport Economics 2012:25, CTS - Centre for Transport Studies Stockholm (KTH and VTI).
  • Handle: RePEc:hhs:ctswps:2012_025
    as

    Download full text from publisher

    File URL: http://www.transportportal.se/SWoPEc/CTS-2012-25.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Brewer, Paul J. & Plott, Charles R., 1996. "A binary conflict ascending price (BICAP) mechanism for the decentralized allocation of the right to use railroad tracks," International Journal of Industrial Organization, Elsevier, vol. 14(6), pages 857-886, October.
    2. R. Preston McAfee & John McMillan, 1996. "Analyzing the Airwaves Auction," Journal of Economic Perspectives, American Economic Association, vol. 10(1), pages 159-175, Winter.
    3. U. Brännlund & P. O. Lindberg & A. Nõu & J.-E. Nilsson, 1998. "Railway Timetabling Using Lagrangian Relaxation," Transportation Science, INFORMS, vol. 32(4), pages 358-369, November.
    4. Chris Nash, 2005. "Rail Infrastructure Charges in Europe," Journal of Transport Economics and Policy, University of Bath, vol. 39(3), pages 259-278, September.
    5. R. Borndörfer & M. Grötschel & S. Lukac & K. Mitusch & T. Schlechte & S. Schultz & A. Tanner, 2006. "An Auction Approach to Railway Slot Allocation," Competition and Regulation in Network Industries, Intersentia, vol. 7(2), pages 163-197, June.
    6. Johnson Daniel & Nash Chris, 2008. "Charging for Scarce Rail Capacity in Britain: A Case Study," Review of Network Economics, De Gruyter, vol. 7(1), pages 1-24, March.
    7. Michael H. Rothkopf & Aleksandar Pekev{c} & Ronald M. Harstad, 1998. "Computationally Manageable Combinational Auctions," Management Science, INFORMS, vol. 44(8), pages 1131-1147, August.
    8. Severin Borenstein, 1988. "On the Efficiency of Competitive Markets for Operating Licenses," The Quarterly Journal of Economics, Oxford University Press, vol. 103(2), pages 357-385.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Beria, Paolo & Grimaldi, Raffaele, 2013. "Appraising the benefits of bottleneck removal in rail transport: a simplified CBA approach," MPRA Paper 46889, University Library of Munich, Germany.

    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. Nilsson, Jan-Eric, 2002. "Towards a welfare enhancing process to manage railway infrastructure access," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(5), pages 419-436, June.
    2. Perennes, Patricia, 2014. "Use of combinatorial auctions in the railway industry: Can the “invisible hand” draw the railway timetable?," Transportation Research Part A: Policy and Practice, Elsevier, vol. 67(C), pages 175-187.
    3. Lawrence M. Ausubel & Peter Cramton & R. Preston McAfee & John McMillan, 1997. "Synergies in Wireless Telephony: Evidence from the Broadband PCS Auctions," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 6(3), pages 497-527, September.
    4. Ait Ali, Abderrahman & Warg, Jennifer & Eliasson, Jonas, 2020. "Pricing commercial train path requests based on societal costs," Transportation Research Part A: Policy and Practice, Elsevier, vol. 132(C), pages 452-464.
    5. Sayee Srinivasan, 2002. "Trading Portfolios Electronically – An Experimental Approach," Netnomics, Springer, vol. 4(1), pages 39-71, March.
    6. Pallab Sanyal, 2016. "Characteristics and Economic Consequences of Jump Bids in Combinatorial Auctions," Information Systems Research, INFORMS, vol. 27(2), pages 347-364, June.
    7. Wellman, Michael P. & Walsh, William E. & Wurman, Peter R. & MacKie-Mason, Jeffrey K., 2001. "Auction Protocols for Decentralized Scheduling," Games and Economic Behavior, Elsevier, vol. 35(1-2), pages 271-303, April.
    8. Stojadinović, Nikola & Bošković, Branislav & Trifunović, Dejan & Janković, Slađana, 2019. "Train path congestion management: Using hybrid auctions for decentralized railway capacity allocation," Transportation Research Part A: Policy and Practice, Elsevier, vol. 129(C), pages 123-139.
    9. Wurman, Peter R. & Wellman, Michael P. & Walsh, William E., 2001. "A Parametrization of the Auction Design Space," Games and Economic Behavior, Elsevier, vol. 35(1-2), pages 304-338, April.
    10. Bourbeau, Benoit & Gabriel Crainic, Teodor & Gendreau, Michel & Robert, Jacques, 2005. "Design for optimized multi-lateral multi-commodity markets," European Journal of Operational Research, Elsevier, vol. 163(2), pages 503-529, June.
    11. Peter Cramton, 2002. "Spectrum Auctions," Papers of Peter Cramton 01hte, University of Maryland, Department of Economics - Peter Cramton, revised 16 Jul 2001.
    12. Park, Sunju & Rothkopf, Michael H., 2005. "Auctions with bidder-determined allowable combinations," European Journal of Operational Research, Elsevier, vol. 161(2), pages 399-415, March.
    13. William E. Walsh & Michael P. Wellman, 1999. "Efficiency and Equilibrium in Task Allocation Economics with Hierarchical Dependencies," Working Papers 99-07-049, Santa Fe Institute.
    14. Munro, David R. & Rassenti, Stephen J., 2019. "Combinatorial clock auctions: Price direction and performance," Games and Economic Behavior, Elsevier, vol. 117(C), pages 195-217.
    15. Peter Cramton, 1997. "The FCC Spectrum Auctions: An Early Assessment," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 6(3), pages 431-495, September.
    16. E. Ursavas & Stuart X. Zhu, 2018. "Integrated Passenger and Freight Train Planning on Shared-Use Corridors," Service Science, INFORMS, vol. 52(6), pages 1376-1390, December.
    17. Ming Fan & Jan Stallaert & Andrew B. Whinston, 2003. "Decentralized Mechanism Design for Supply Chain Organizations Using an Auction Market," Information Systems Research, INFORMS, vol. 14(1), pages 1-22, March.
    18. Gediminas Adomavicius & Alok Gupta & Mochen Yang, 2022. "Bidder Support in Multi-item Multi-unit Continuous Combinatorial Auctions: A Unifying Theoretical Framework," Information Systems Research, INFORMS, vol. 33(4), pages 1174-1195, December.
    19. Joni L. Jones & Gary J. Koehler, 2005. "A Heuristic for Winner Determination in Rule-Based Combinatorial Auctions," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 475-489, November.
    20. Tuomas Sandholm & Subhash Suri & Andrew Gilpin & David Levine, 2005. "CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions," Management Science, INFORMS, vol. 51(3), pages 374-390, March.

    More about this item

    Keywords

    Time-tabling; Track scarcity; Runway scarcity; Willingness to pay;
    All these keywords.

    JEL classification:

    • D61 - Microeconomics - - Welfare Economics - - - Allocative Efficiency; Cost-Benefit Analysis
    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design
    • R42 - Urban, Rural, Regional, Real Estate, and Transportation Economics - - Transportation Economics - - - Government and Private Investment Analysis; Road Maintenance; Transportation Planning

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:hhs:ctswps:2012_025. 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: CTS (email available below). General contact details of provider: http://www.cts.kth.se/ .

    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.