IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v253y2017i2d10.1007_s10479-016-2259-4.html
   My bibliography  Save this article

A path-based capacitated network flow model for empty railcar distribution

Author

Listed:
  • Ruhollah Heydari

    (Northeastern University)

  • Emanuel Melachrinoudis

    (Northeastern University)

Abstract

In this paper we develop a novel formulation for the empty railcar distribution problem that considers realistic technical and business requirements while assigning empty cars to customer demands. The proposed model takes block and train capacities into account, while satisfying the supply and demand constraints, and allows car substitutability among pools of the same car type as well as customer preferences towards different pools. Following the practice in US railroads, the proposed model does not combine car routing and car distribution decisions. Those two decisions are separated from each other and they are usually made by different departments in US railroads. The model is implemented in CPLEX Concert Technology using Java and is illustrated in a numerical example. Results show that the proposed model can improve several performance measures over the noncapacitated model which is currently used by industry.

Suggested Citation

  • Ruhollah Heydari & Emanuel Melachrinoudis, 2017. "A path-based capacitated network flow model for empty railcar distribution," Annals of Operations Research, Springer, vol. 253(2), pages 773-798, June.
    • Handle: RePEc:spr:annopr:v:253:y:2017:i:2:d:10.1007_s10479-016-2259-4
    DOI: 10.1007/s10479-016-2259-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-016-2259-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-016-2259-4?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
    ---><---

    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. Pierre J. Dejax & Teodor Gabriel Crainic, 1987. "Survey Paper---A Review of Empty Flows and Fleet Management Models in Freight Transportation," Transportation Science, INFORMS, vol. 21(4), pages 227-248, November.
    2. Hanif D. Sherali & Arief B. Suharko, 1998. "A Tactical Decision Support System for Empty Railcar Management," Transportation Science, INFORMS, vol. 32(4), pages 306-329, November.
    3. Michael Francis Gorman, 1998. "An application of genetic and tabu searches to the freight railroad operating plan problem," Annals of Operations Research, Springer, vol. 78(0), pages 51-69, January.
    4. Kaj Holmberg & Martin Joborn & Jan T. Lundgren, 1998. "Improved Empty Freight Car Distribution," Transportation Science, INFORMS, vol. 32(2), pages 163-173, May.
    5. Holmberg, Kaj & Joborn, Martin & Melin, Kennet, 2008. "Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths," European Journal of Operational Research, Elsevier, vol. 188(1), pages 101-108, July.
    6. Michael F. Gorman & Dharma Acharya & David Sellers, 2010. "CSX Railway Uses OR to Cash In on Optimized Equipment Distribution," Interfaces, INFORMS, vol. 40(1), pages 5-16, February.
    7. Ravindra K. Ahuja & Krishna C. Jha & Jian Liu, 2007. "Solving Real-Life Railroad Blocking Problems," Interfaces, INFORMS, vol. 37(5), pages 404-419, October.
    8. Martin Joborn & Teodor Gabriel Crainic & Michel Gendreau & Kaj Holmberg & Jan T. Lundgren, 2004. "Economies of Scale in Empty Freight Car Distribution in Scheduled Railways," Transportation Science, INFORMS, vol. 38(2), pages 121-134, May.
    9. Amar Kumar Narisetty & Jean-Philippe P. Richard & David Ramcharan & Deby Murphy & Gayle Minks & Jim Fuller, 2008. "An Optimization Model for Empty Freight Car Assignment at Union Pacific Railroad," Interfaces, INFORMS, vol. 38(2), pages 89-102, April.
    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. Sangpil Ko & Pasi Lautala & Kuilin Zhang, 2020. "Data-Driven Study on the Sustainable Log Movements: Impact of Rail Car Fleet Size on Freight Storage and Car Idling," Sustainability, MDPI, vol. 12(11), pages 1-15, June.
    2. Zu, Yue & Heydari, Ruhollah & Chahar, Kiran & Pranoto, Yudi & Cheng, Clark, 2022. "A railcar re-blocking strategy via Mixed Integer Quadratic Programming," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 162(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. 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. Michael F. Gorman & Dharma Acharya & David Sellers, 2010. "CSX Railway Uses OR to Cash In on Optimized Equipment Distribution," Interfaces, INFORMS, vol. 40(1), pages 5-16, February.
    3. Kirschstein, Thomas, 2018. "Rail transportation planning in the chemical industry," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 112(C), pages 142-160.
    4. Zu, Yue & Heydari, Ruhollah & Chahar, Kiran & Pranoto, Yudi & Cheng, Clark, 2022. "A railcar re-blocking strategy via Mixed Integer Quadratic Programming," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 162(C).
    5. Michael F. Gorman & John-Paul Clarke & Amir Hossein Gharehgozli & Michael Hewitt & René de Koster & Debjit Roy, 2014. "State of the Practice: A Review of the Application of OR/MS in Freight Transportation," Interfaces, INFORMS, vol. 44(6), pages 535-554, December.
    6. Scheffler, Martin & Neufeld, Janis S. & Hölscher, Michael, 2020. "An MIP-based heuristic solution approach for the locomotive assignment problem focussing on (dis-)connecting processes," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 64-80.
    7. Belgacem Bouzaiene-Ayari & Clark Cheng & Sourav Das & Ricardo Fiorillo & Warren B. Powell, 2016. "From Single Commodity to Multiattribute Models for Locomotive Optimization: A Comparison of Optimal Integer Programming and Approximate Dynamic Programming," Transportation Science, INFORMS, vol. 50(2), pages 366-389, May.
    8. Schwerdfeger, Stefan & Otto, Alena & Boysen, Nils, 2021. "Rail platooning: Scheduling trains along a rail corridor with rapid-shunting facilities," European Journal of Operational Research, Elsevier, vol. 294(2), pages 760-778.
    9. Lawley, Mark & Parmeshwaran, Vijay & Richard, Jean-Philippe & Turkcan, Ayten & Dalal, Malay & Ramcharan, David, 2008. "A time-space scheduling model for optimizing recurring bulk railcar deliveries," Transportation Research Part B: Methodological, Elsevier, vol. 42(5), pages 438-454, June.
    10. 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.
    11. Ruf, Moritz & Cordeau, Jean-François, 2021. "Adaptive large neighborhood search for integrated planning in railroad classification yards," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 26-51.
    12. 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.
    13. Milos Milenkovic & Nebojsa Bojovic, 2014. "Fuzzy modeling approach to the rail freight car inventory problem," Transportation Planning and Technology, Taylor & Francis Journals, vol. 37(2), pages 119-137, March.
    14. Markus Bohlin & Sara Gestrelius & Florian Dahms & Matúš Mihalák & Holger Flier, 2016. "Optimization Methods for Multistage Freight Train Formation," Transportation Science, INFORMS, vol. 50(3), pages 823-840, August.
    15. Sun, Yanshuo & Kirtonia, Sajeeb & Chen, Zhi-Long, 2021. "A survey of finished vehicle distribution and related problems from an optimization perspective," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 149(C).
    16. 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.
    17. Xiao, Jie & Pachl, Joern & Lin, Boliang & Wang, Jiaxi, 2018. "Solving the block-to-train assignment problem using the heuristic approach based on the genetic algorithm and tabu search," Transportation Research Part B: Methodological, Elsevier, vol. 108(C), pages 148-171.
    18. Boliang Lin & Jingsong Duan & Jiaxi Wang & Min Sun & Wengao Peng & Chang Liu & Jie Xiao & Siqi Liu & Jianping Wu, 2018. "A study of the car-to-train assignment problem for rail express cargos in the scheduled and unscheduled train services network," PLOS ONE, Public Library of Science, vol. 13(10), pages 1-18, October.
    19. Amar Kumar Narisetty & Jean-Philippe P. Richard & David Ramcharan & Deby Murphy & Gayle Minks & Jim Fuller, 2008. "An Optimization Model for Empty Freight Car Assignment at Union Pacific Railroad," Interfaces, INFORMS, vol. 38(2), pages 89-102, April.
    20. 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.

    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:spr:annopr:v:253:y:2017:i:2:d:10.1007_s10479-016-2259-4. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.