IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v62y2011i12p2107-2119.html
   My bibliography  Save this article

Service network design for freight railway transportation: the Italian case†

Author

Listed:
  • G Lulli

    (Università di Milano ‘Bicocca’, Milano, Italy)

  • U Pietropaoli

    (Università di Roma ‘Tor Vergata’, Roma, Italy)

  • N Ricciardi

    (Sapienza Università di Roma, Roma, Italy)

Abstract

In this paper, we present a case study on freight railway transportation in Italy, which is a by-product of research collaboration with a major Italian railway company. We highlight the main features of the Italian reality and propose a customized mathematical model to design the service network, that is, the set of origin-destination connections. More specifically, the model suggests the services to provide, the number of trains travelling on each connection, the number of cars and their type. We consider both full and empty freight car movements and take handling costs into account. All decisions are taken in order to minimize the total costs. The quality of service is guaranteed by satisfying all the transportation demand and by implicitly minimizing the waiting time of cars at intermediate railway stations. Our approach yields to a multi-commodity network design problem with a concave cost function. To solve this problem, we implement a specialized tabu search procedure. Computational results on realistic instances show a significant improvement over current practice.

Suggested Citation

  • G Lulli & U Pietropaoli & N Ricciardi, 2011. "Service network design for freight railway transportation: the Italian case†," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(12), pages 2107-2119, December.
  • Handle: RePEc:pal:jorsoc:v:62:y:2011:i:12:p:2107-2119
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v62/n12/pdf/jors2010190a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: http://www.palgrave-journals.com/jors/journal/v62/n12/full/jors2010190a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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. Xudong Diao & Ai Gao & Xin Jin & Hui Chen, 2022. "A Layer-Based Relaxation Approach for Service Network Design," Sustainability, MDPI, vol. 14(20), pages 1-13, October.
    2. Jin, Jian Gang & Zhao, Jun & Lee, Der-Horng, 2013. "A column generation based approach for the Train Network Design Optimization problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 50(C), pages 1-17.
    3. Chen, C. & Dollevoet, T.A.B. & Zhao, J., 2017. "One-block train formation in large-scale railway networks: An exact model and a tree-based decomposition algorithm," Econometric Institute Research Papers EI-2017-32, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    4. Meng, Lingyun & Zhou, Xuesong, 2019. "An integrated train service plan optimization model with variable demand: A team-based scheduling approach with dual cost information in a layered network," Transportation Research Part B: Methodological, Elsevier, vol. 125(C), pages 1-28.
    5. Zhimei Wang & Avishai Ceder, 2017. "Efficient design of freight train operation with double-hump yards," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(12), pages 1600-1619, December.
    6. Ahmad Baubaid & Natashia Boland & Martin Savelsbergh, 2021. "The Value of Limited Flexibility in Service Network Designs," Transportation Science, INFORMS, vol. 55(1), pages 52-74, 1-2.
    7. Chen, Chongshuang & Dollevoet, Twan & Zhao, Jun, 2018. "One-block train formation in large-scale railway networks: An exact model and a tree-based decomposition algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 1-30.
    8. Li, Dongjun & Islam, Dewan Md Zahurul & Robinson, Mark & Song, Dong-Ping & Dong, Jing-Xin & Reimann, Marc, 2024. "Network revenue management game in the railway industry: Stackelberg equilibrium, global optimality, and mechanism design," European Journal of Operational Research, Elsevier, vol. 312(1), pages 240-254.

    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:pal:jorsoc:v:62:y:2011:i:12:p:2107-2119. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.