IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v51y2017i4p1102-1121.html
   My bibliography  Save this article

A Decomposition Method for Multiperiod Railway Network Expansion—With a Case Study for Germany

Author

Listed:
  • Andreas Bärmann

    (Department Mathematik, Friedrich–Alexander–Universität Erlangen–Nürnberg, 91058 Erlangen, Germany)

  • Alexander Martin

    (Department Mathematik, Friedrich–Alexander–Universität Erlangen–Nürnberg, 91058 Erlangen, Germany)

  • Hanno Schülldorf

    (DB Analytics, Deutsche Bahn AG, 60329 Frankfurt am Main, Germany)

Abstract

In this work, we report about the results of a joint research project between Friedrich–Alexander–Universität Erlangen–Nürnberg and Deutsche Bahn AG on the optimal expansion of the German railway network until 2030. The need to increase the throughput of the network is given by company-internal demand forecasts that indicate an increase in rail freight traffic of about 50% over the next two decades. Our focus is to compute an optimal investment strategy into line capacities given an available annual budget, i.e., we are to choose the most profitable lines to upgrade with respect to the demand scenario under consideration and to provide a schedule according to which the chosen measures are implemented. This leads to a multiperiod network design problem—a class of problems that has received increasing interest over the past decade. We develop a mixed-integer programming formulation to model the situation and solve it via a novel decomposition approach that we call multiple-knapsack decomposition. The method can both be used as a quick heuristic and allows for the extension to an exact algorithm for the problem. We demonstrate its potential by solving a real-world problem instance provided by Deutsche Bahn AG and use the results as the basis for a broad case study for the expansion of the German railway network until 2030.

Suggested Citation

  • Andreas Bärmann & Alexander Martin & Hanno Schülldorf, 2017. "A Decomposition Method for Multiperiod Railway Network Expansion—With a Case Study for Germany," Transportation Science, INFORMS, vol. 51(4), pages 1102-1121, November.
    • Handle: RePEc:inm:ortrsc:v:51:y:2017:i:4:p:1102-1121
    DOI: 10.1287/trsc.2017.0747
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/trsc.2017.0747
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2017.0747?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. Hugo M. Repolho & António P. Antunes & Richard L. Church, 2013. "Optimal Location of Railway Stations: The Lisbon-Porto High-Speed Rail Line," Transportation Science, INFORMS, vol. 47(3), pages 330-343, August.
    2. Petersen, E. R. & Taylor, A. J., 2001. "An investment planning model for a new North-Central railway in Brazil," Transportation Research Part A: Policy and Practice, Elsevier, vol. 35(9), pages 847-862, November.
    3. Gendreau, Michel & Potvin, Jean-Yves & Smires, Ali & Soriano, Patrick, 2006. "Multi-period capacity expansion for a local access telecommunications network," European Journal of Operational Research, Elsevier, vol. 172(3), pages 1051-1066, August.
    4. Garcia, Bruno-Laurent & Mahey, Philippe & LeBlanc, Larry J., 1998. "Iterative improvement methods for a multiperiod network design problem," European Journal of Operational Research, Elsevier, vol. 110(1), pages 150-165, October.
    5. Marí­n, íngel & Jaramillo, Patricia, 2008. "Urban rapid transit network capacity expansion," European Journal of Operational Research, Elsevier, vol. 191(1), pages 45-60, November.
    6. Blanco, Víctor & Puerto, Justo & Ramos, Ana B., 2011. "Expanding the Spanish high-speed railway network," Omega, Elsevier, vol. 39(2), pages 138-150, April.
    7. Baxter, Matthew & Elgindy, Tarek & Ernst, Andreas T. & Kalinowski, Thomas & Savelsbergh, Martin W.P., 2014. "Incremental network design with shortest paths," European Journal of Operational Research, Elsevier, vol. 238(3), pages 675-684.
    8. Byung Kim & Wonkyu Kim & Byung Song, 2008. "Sequencing and scheduling highway network expansion using a discrete network design model," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 42(3), pages 621-642, September.
    9. Michael Kuby & Zhongyi Xu & Xiaodong Xie, 2001. "Railway network design with multiple project stages and time sequencing," Journal of Geographical Systems, Springer, vol. 3(1), pages 25-47, May.
    10. Kalinowski, Thomas & Matsypura, Dmytro & Savelsbergh, Martin W.P., 2015. "Incremental network design with maximum flows," European Journal of Operational Research, Elsevier, vol. 242(1), pages 51-62.
    11. Daniel Bienstock & Olga Raskina & Iraj Saniee & Qiong Wang, 2006. "Combined Network Design and Multiperiod Pricing: Modeling, Solution Techniques, and Computation," Operations Research, INFORMS, vol. 54(2), pages 261-276, April.
    12. Alejandro Toriello & George Nemhauser & Martin Savelsbergh, 2010. "Decomposing inventory routing problems with approximate value functions," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(8), pages 718-727, December.
    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. Fragkos, Ioannis & Cordeau, Jean-François & Jans, Raf, 2021. "Decomposition methods for large-scale network expansion problems," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 60-80.
    2. Canca, David & Andrade-Pineda, José Luis & De-Los-Santos, Alicia & González-R, Pedro Luis, 2021. "A quantitative approach for the long-term assessment of Railway Rapid Transit network construction or expansion projects," European Journal of Operational Research, Elsevier, vol. 294(2), pages 604-621.
    3. Haque, Khademul & Mishra, Sabyasachee & Golias, Mihalis M., 2021. "Multi-period transportation network investment decision making and policy implications using econometric framework," Research in Transportation Economics, Elsevier, vol. 89(C).

    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. Fragkos, Ioannis & Cordeau, Jean-François & Jans, Raf, 2021. "Decomposition methods for large-scale network expansion problems," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 60-80.
    2. Canca, David & Andrade-Pineda, José Luis & De-Los-Santos, Alicia & González-R, Pedro Luis, 2021. "A quantitative approach for the long-term assessment of Railway Rapid Transit network construction or expansion projects," European Journal of Operational Research, Elsevier, vol. 294(2), pages 604-621.
    3. Ni, Ni & Howell, Brendan J. & Sharkey, Thomas C., 2018. "Modeling the impact of unmet demand in supply chain resiliency planning," Omega, Elsevier, vol. 81(C), pages 1-16.
    4. Aybike Ulusan & Ozlem Ergun, 2018. "Restoration of services in disrupted infrastructure systems: A network science approach," PLOS ONE, Public Library of Science, vol. 13(2), pages 1-28, February.
    5. Hongtan Sun & Thomas C. Sharkey, 2017. "Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems," Journal of Global Optimization, Springer, vol. 68(3), pages 623-640, July.
    6. Kalinowski, Thomas & Matsypura, Dmytro & Savelsbergh, Martin W.P., 2015. "Incremental network design with maximum flows," European Journal of Operational Research, Elsevier, vol. 242(1), pages 51-62.
    7. Averbakh, Igor & Pereira, Jordi, 2015. "Network construction problems with due dates," European Journal of Operational Research, Elsevier, vol. 244(3), pages 715-729.
    8. Haque, Khademul & Mishra, Sabyasachee & Golias, Mihalis M., 2021. "Multi-period transportation network investment decision making and policy implications using econometric framework," Research in Transportation Economics, Elsevier, vol. 89(C).
    9. Natashia Boland & Thomas Kalinowski & Simranjit Kaur, 2016. "Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 885-905, October.
    10. Sharkey, Thomas C. & Cavdaroglu, Burak & Nguyen, Huy & Holman, Jonathan & Mitchell, John E. & Wallace, William A., 2015. "Interdependent network restoration: On the value of information-sharing," European Journal of Operational Research, Elsevier, vol. 244(1), pages 309-321.
    11. Garay-Sianca, Aniela & Nurre Pinkley, Sarah G., 2021. "Interdependent integrated network design and scheduling problems with movement of machines," European Journal of Operational Research, Elsevier, vol. 289(1), pages 297-327.
    12. Luis Cadarso & Ángel Marín, 2017. "Improved rapid transit network design model: considering transfer effects," Annals of Operations Research, Springer, vol. 258(2), pages 547-567, November.
    13. Chagas, Rosklin Juliano & Valle, Cristiano Arbex & da Cunha, Alexandre Salles, 2018. "Exact solution approaches for the Multi-period Degree Constrained Minimum Spanning Tree Problem," European Journal of Operational Research, Elsevier, vol. 271(1), pages 57-71.
    14. Garrett, Richard A. & Sharkey, Thomas C. & Grabowski, Martha & Wallace, William A., 2017. "Dynamic resource allocation to support oil spill response planning for energy exploration in the Arctic," European Journal of Operational Research, Elsevier, vol. 257(1), pages 272-286.
    15. Igor Averbakh & Jordi Pereira, 2018. "Lateness Minimization in Pairwise Connectivity Restoration Problems," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 522-538, August.
    16. Huang, Ying & Xu, Wangtu (Ato), 2021. "Spatial and temporal heterogeneity of the impact of high-speed railway on urban economy: Empirical study of Chinese cities," Journal of Transport Geography, Elsevier, vol. 91(C).
    17. Wang, Zhuolin & You, Keyou & Song, Shiji & Zhang, Yuli, 2020. "Wasserstein distributionally robust shortest path problem," European Journal of Operational Research, Elsevier, vol. 284(1), pages 31-43.
    18. Wang, Chengjin & Ducruet, César, 2014. "Transport corridors and regional balance in China: the case of coal trade and logistics," Journal of Transport Geography, Elsevier, vol. 40(C), pages 3-16.
    19. James F. Campbell & Morton E. O'Kelly, 2012. "Twenty-Five Years of Hub Location Research," Transportation Science, INFORMS, vol. 46(2), pages 153-169, May.
    20. Chow, Joseph Y.J. & Regan, Amelia C., 2011. "Network-based real option models," Transportation Research Part B: Methodological, Elsevier, vol. 45(4), pages 682-695, May.

    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:inm:ortrsc:v:51:y:2017:i:4:p:1102-1121. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.