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

A Freight Service Design Problem for a Railway Corridor

Author

Listed:
  • Alberto Caprara

    (Dipartimento di Elettronica, Informatica e Sistemistica, University of Bologna, 40136 Bologna, Italy)

  • Enrico Malaguti

    (Dipartimento di Elettronica, Informatica e Sistemistica, University of Bologna, 40136 Bologna, Italy)

  • Paolo Toth

    (Dipartimento di Elettronica, Informatica e Sistemistica, University of Bologna, 40136 Bologna, Italy)

Abstract

We study the problem of designing a set of highly profitable freight routes in a railway corridor, taking into account the level of service requested by different goods; in particular, the profit achieved by transporting a good is a nonlinear function of the associated travel time. We propose an ILP model that is solved heuristically by column generation and fixing techniques. Computational results on a real corridor crossing 11 European countries are reported, showing that we can find solutions that are provably close to optimal. Given the large size of our instances, a key issue of our approach is to avoid finding an optimal solution of the continuous relaxation of our model, stopping as soon as near-optimal primal and dual solutions are available.

Suggested Citation

  • Alberto Caprara & Enrico Malaguti & Paolo Toth, 2011. "A Freight Service Design Problem for a Railway Corridor," Transportation Science, INFORMS, vol. 45(2), pages 147-162, May.
    • Handle: RePEc:inm:ortrsc:v:45:y:2011:i:2:p:147-162
    DOI: 10.1287/trsc.1100.0348
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.1100.0348
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.1100.0348?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. Crainic, Teodor Gabriel, 2000. "Service network design in freight transportation," European Journal of Operational Research, Elsevier, vol. 122(2), pages 272-288, April.
    2. Jean-François Cordeau & Paolo Toth & Daniele Vigo, 1998. "A Survey of Optimization Models for Train Routing and Scheduling," Transportation Science, INFORMS, vol. 32(4), pages 380-404, November.
    3. Crainic, Teodor Gabriel & Laporte, Gilbert, 1997. "Planning models for freight transportation," European Journal of Operational Research, Elsevier, vol. 97(3), pages 409-438, March.
    4. Kaj Holmberg & Johan Hellstrand, 1998. "Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound," Operations Research, INFORMS, vol. 46(2), pages 247-259, April.
    5. Alberto Ceselli & Michael Gatto & Marco E. Lübbecke & Marc Nunkesser & Heiko Schilling, 2008. "Optimizing the Cargo Express Service of Swiss Federal Railways," Transportation Science, INFORMS, vol. 42(4), pages 450-465, November.
    6. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    7. J Andersen & M Christiansen, 2009. "Designing new European rail freight services," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(3), pages 348-360, March.
    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. Alberto Caprara & Fabio Furini & Enrico Malaguti, 2013. "Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 560-571, August.
    2. 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.
    3. Line Blander Reinhardt & David Pisinger & Richard Lusby, 2018. "Railway capacity and expansion analysis using time discretized paths," Flexible Services and Manufacturing Journal, Springer, vol. 30(4), pages 712-739, December.
    4. Timo Gschwind & Stefan Irnich, 2017. "Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(2), pages 541-556, March.
    5. Timo Gschwind & Stefan Irnich, 2014. "Stabilized Column Generation for the Temporal Knapsack Problem using Dual- Optimal Inequalities," Working Papers 1413, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz, revised 13 Nov 2014.

    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. 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.
    2. J Bauer & T Bektaş & T G Crainic, 2010. "Minimizing greenhouse gas emissions in intermodal freight transport: an application to rail service design," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(3), pages 530-542, March.
    3. Zhang, Yongxiang & Peng, Qiyuan & Yao, Yu & Zhang, Xin & Zhou, Xuesong, 2019. "Solving cyclic train timetabling problem through model reformulation: Extended time-space network construct and Alternating Direction Method of Multipliers methods," Transportation Research Part B: Methodological, Elsevier, vol. 128(C), pages 344-379.
    4. Crainic, Teodor Gabriel, 2000. "Service network design in freight transportation," European Journal of Operational Research, Elsevier, vol. 122(2), pages 272-288, April.
    5. Jardar Andersen & Marielle Christiansen & Teodor Gabriel Crainic & Roar Grønhaug, 2011. "Branch and Price for Service Network Design with Asset Management Constraints," Transportation Science, INFORMS, vol. 45(1), pages 33-49, February.
    6. Xin Wang & Teodor Gabriel Crainic & Stein W. Wallace, 2019. "Stochastic Network Design for Planning Scheduled Transportation Services: The Value of Deterministic Solutions," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 153-170, February.
    7. Louwerse, I. & Mijnarends, J. & Meuffels, I. & Huisman, D. & Fleuren, H.A., 2012. "Scheduling Movements in the Network of an Express Service Provider," Econometric Institute Research Papers EI 2012-08, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    8. van Riessen, B. & Negenborn, R.R. & Dekker, R. & Lodewijks, G., 2013. "Service network design for an intermodal container network with flexible due dates/times and the possibility of using subcontracted transport," Econometric Institute Research Papers EI2013-17, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    9. Endong Zhu & Teodor Gabriel Crainic & Michel Gendreau, 2014. "Scheduled Service Network Design for Freight Rail Transportation," Operations Research, INFORMS, vol. 62(2), pages 383-400, April.
    10. I. Ece Içyüz & Jean-Philippe P. Richard & Erdem Eskigun & Dharma Acharya, 2016. "A Two-Model Solution Approach for the Monthly Coal Train Reservations Planning Problem," Transportation Science, INFORMS, vol. 50(3), pages 926-946, August.
    11. Dall'Orto, Leonardo Campo & Crainic, Teodor Gabriel & Leal, Jose Eugenio & Powell, Warren B., 2006. "The single-node dynamic service scheduling and dispatching problem," European Journal of Operational Research, Elsevier, vol. 170(1), pages 1-23, April.
    12. Li, Xiangyong & Wei, Kai & Guo, Zhaoxia & Wang, Wei & Aneja, Y.P., 2021. "An exact approach for the service network design problem with heterogeneous resource constraints," Omega, Elsevier, vol. 102(C).
    13. Bilegan, Ioana C. & Crainic, Teodor Gabriel & Wang, Yunfei, 2022. "Scheduled service network design with revenue management considerations and an intermodal barge transportation illustration," European Journal of Operational Research, Elsevier, vol. 300(1), pages 164-177.
    14. Meuffels, W.J.M., 2015. "The design of road and air networks for express service providers," Other publications TiSEM d3266cb8-bc55-41be-adc7-4, Tilburg University, School of Economics and Management.
    15. Taherkhani, Gita & Bilegan, Ioana C. & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2022. "Tactical capacity planning in an integrated multi-stakeholder freight transportation system," Omega, Elsevier, vol. 110(C).
    16. Michael Berliner Pedersen & Teodor Gabriel Crainic & Oli B. G. Madsen, 2009. "Models and Tabu Search Metaheuristics for Service Network Design with Asset-Balance Requirements," Transportation Science, INFORMS, vol. 43(2), pages 158-177, May.
    17. C S Sung & S H Song, 2003. "Integrated service network design for a cross-docking supply chain network," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(12), pages 1283-1295, December.
    18. Grunert, Tore & Sebastian, Hans-Jurgen, 2000. "Planning models for long-haul operations of postal and express shipment companies," European Journal of Operational Research, Elsevier, vol. 122(2), pages 289-309, April.
    19. Taiba Zahid & Fouzia Gillani & Usman Ghafoor & Muhammad Raheel Bhutta, 2022. "Synchromodal Transportation Analysis of the One-Belt-One-Road Initiative Based on a Bi-Objective Mathematical Model," Sustainability, MDPI, vol. 14(6), pages 1-14, March.
    20. Paraskevopoulos, Dimitris C. & Gürel, Sinan & Bektaş, Tolga, 2016. "The congested multicommodity network design problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 85(C), pages 166-187.

    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:45:y:2011:i:2:p:147-162. 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.