IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v214y2011i3p588-594.html
   My bibliography  Save this article

Freight transportation in railway networks with automated terminals: A mathematical model and MIP heuristic approaches

Author

Listed:
  • Anghinolfi, D.
  • Paolucci, M.
  • Sacone, S.
  • Siri, S.

Abstract

In this paper we propose a planning procedure for serving freight transportation requests in a railway network with fast transfer equipment at terminals. We consider a transportation system where different customers make their requests (orders) for moving boxes, i.e., either containers or swap bodies, between different origins and destinations, with specific requirements on delivery times. The decisions to be taken concern the route (and the corresponding sequence of trains) that each box follows in the network and the assignment of boxes to train wagons, taking into account that boxes can change more than one train and that train timetables are fixed. The planning procedure includes a pre-analysis step to determine all the possible sequences of trains for serving each order, followed by the solution of a 0-1 linear programming problem to find the optimal assignment of each box to a train sequence and to a specific wagon for each train in the sequence. This latter is a generalized assignment problem which is NP-hard. Hence, in order to find good solutions in acceptable computation times, two MIP heuristic approaches are proposed and tested through an experimental analysis considering realistic problem instances.

Suggested Citation

  • Anghinolfi, D. & Paolucci, M. & Sacone, S. & Siri, S., 2011. "Freight transportation in railway networks with automated terminals: A mathematical model and MIP heuristic approaches," European Journal of Operational Research, Elsevier, vol. 214(3), pages 588-594, November.
    • Handle: RePEc:eee:ejores:v:214:y:2011:i:3:p:588-594
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221711004383
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Lejeune, M.A., 2006. "A variable neighborhood decomposition search method for supply chain management planning problems," European Journal of Operational Research, Elsevier, vol. 175(2), pages 959-976, December.
    2. Marshall L. Fisher & R. Jaikumar & Luk N. Van Wassenhove, 1986. "A Multiplier Adjustment Method for the Generalized Assignment Problem," Management Science, INFORMS, vol. 32(9), pages 1095-1103, September.
    3. Bontekoning, Y. M. & Macharis, C. & Trip, J. J., 2004. "Is a new applied transportation research field emerging?--A review of intermodal rail-truck freight transport literature," Transportation Research Part A: Policy and Practice, Elsevier, vol. 38(1), pages 1-34, January.
    4. Candace A. Yano & Alexandra M. Newman, 2001. "Scheduling Trains and Containers with Due Dates and Dynamic Arrivals," Transportation Science, INFORMS, vol. 35(2), pages 181-191, May.
    5. Newman, Alexandra M. & Kuchta, Mark, 2007. "Using aggregation to optimize long-term production planning at an underground mine," European Journal of Operational Research, Elsevier, vol. 176(2), pages 1205-1218, January.
    6. 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.
    7. Nathalie Bostel & Pierre Dejax, 1998. "Models and Algorithms for Container Allocation Problems on Trains in a Rapid Transshipment Shunting Yard," Transportation Science, INFORMS, vol. 32(4), pages 370-379, November.
    8. Harry N. Newton & Cynthia Barnhart & Pamela H. Vance, 1998. "Constructing Railroad Blocking Plans to Minimize Handling Costs," Transportation Science, INFORMS, vol. 32(4), pages 330-345, November.
    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. Wang, Hua & Wang, Xinchang & Zhang, Xiaoning, 2017. "Dynamic resource allocation for intermodal freight transportation with network effects: Approximations and algorithms," Transportation Research Part B: Methodological, Elsevier, vol. 99(C), pages 83-112.
    2. Behiri, Walid & Belmokhtar-Berraf, Sana & Chu, Chengbin, 2018. "Urban freight transport using passenger rail network: Scientific issues and quantitative analysis," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 115(C), pages 227-245.
    3. Patricio Gallardo & Rua Murray & Susan Krumdieck, 2021. "A Sequential Optimization-Simulation Approach for Planning the Transition to the Low Carbon Freight System with Case Study in the North Island of New Zealand," Energies, MDPI, vol. 14(11), pages 1-24, June.
    4. Crainic, Teodor Gabriel & Perboli, Guido & Rosano, Mariangela, 2018. "Simulation of intermodal freight transportation systems: a taxonomy," European Journal of Operational Research, Elsevier, vol. 270(2), pages 401-418.
    5. Daniela Ambrosino & Claudia Caballini, 2019. "New solution approaches for the train load planning problem," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(3), pages 299-325, September.
    6. Bing Li & Ce Yun & Hua Xuan, 2024. "Integrated optimization of wagon flow routing and train formation plan," Operational Research, Springer, vol. 24(3), pages 1-36, September.
    7. SteadieSeifi, M. & Dellaert, N.P. & Nuijten, W. & Van Woensel, T. & Raoufi, R., 2014. "Multimodal freight transportation planning: A literature review," European Journal of Operational Research, Elsevier, vol. 233(1), pages 1-15.

    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. Khaled, Abdullah A. & Jin, Mingzhou & Clarke, David B. & Hoque, Mohammad A., 2015. "Train design and routing optimization for evaluating criticality of freight railroad infrastructures," Transportation Research Part B: Methodological, Elsevier, vol. 71(C), pages 71-84.
    2. Boysen, Nils & Fliedner, Malte, 2010. "Determining crane areas in intermodal transshipment yards: The yard partition problem," European Journal of Operational Research, Elsevier, vol. 204(2), pages 336-342, July.
    3. Boysen, Nils & Fliedner, Malte & Jaehn, Florian & Pesch, Erwin, 2012. "Shunting yard operations: Theoretical aspects and applications," European Journal of Operational Research, Elsevier, vol. 220(1), pages 1-14.
    4. Meng, Qiang & Hei, Xiuling & Wang, Shuaian & Mao, Haijun, 2015. "Carrying capacity procurement of rail and shipping services for automobile delivery with uncertain demand," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 82(C), pages 38-54.
    5. Vaidyanathan, Balachandran & Ahuja, Ravindra K. & Liu, Jian & Shughart, Larry A., 2008. "Real-life locomotive planning: New formulations and computational results," Transportation Research Part B: Methodological, Elsevier, vol. 42(2), pages 147-168, 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. 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.
    8. 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.
    9. Nils Boysen & Malte Fliedner & Florian Jaehn & Erwin Pesch, 2013. "A Survey on Container Processing in Railway Yards," Transportation Science, INFORMS, vol. 47(3), pages 312-329, August.
    10. Arnt-Gunnar Lium & Teodor Gabriel Crainic & Stein W. Wallace, 2009. "A Study of Demand Stochasticity in Service Network Design," Transportation Science, INFORMS, vol. 43(2), pages 144-157, May.
    11. Manish Verma & Vedat Verter & Michel Gendreau, 2011. "A Tactical Planning Model for Railroad Transportation of Dangerous Goods," Transportation Science, INFORMS, vol. 45(2), pages 163-174, May.
    12. Ambrosino, Daniela & Siri, Silvia, 2015. "Comparison of solution approaches for the train load planning problem in seaport terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 79(C), pages 65-82.
    13. 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.
    14. Crainic, Teodor Gabriel, 2000. "Service network design in freight transportation," European Journal of Operational Research, Elsevier, vol. 122(2), pages 272-288, April.
    15. 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.
    16. Gharehgozli, A.H. & Roy, D. & de Koster, M.B.M., 2014. "Sea Container Terminals," ERIM Report Series Research in Management ERS-2014-009-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    17. Verma, Manish & Verter, Vedat, 2010. "A lead-time based approach for planning rail-truck intermodal transportation of dangerous goods," European Journal of Operational Research, Elsevier, vol. 202(3), pages 696-706, May.
    18. J Liu & R K Ahuja & G Şahin, 2008. "Optimal network configuration and capacity expansion of railroads," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(7), pages 911-920, July.
    19. Ebru K. Bish & Thin‐Yin Leong & Chung‐Lun Li & Jonathan W. C. Ng & David Simchi‐Levi, 2001. "Analysis of a new vehicle scheduling and location problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(5), pages 363-385, August.
    20. 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.

    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:eee:ejores:v:214:y:2011:i:3:p:588-594. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.