IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v162y2022ics1366554522001041.html
   My bibliography  Save this article

A railcar re-blocking strategy via Mixed Integer Quadratic Programming

Author

Listed:
  • Zu, Yue
  • Heydari, Ruhollah
  • Chahar, Kiran
  • Pranoto, Yudi
  • Cheng, Clark

Abstract

This article presents a novel solution namely Pre-blocking through Re-waybilling to minimize railcar cuts in freight railways. The Pre-blocking through Re-waybilling Problem (PRP) can be described as follows: A freight train carrying m railcars, loaded or empty, arrives at a local classification yard where, based on the destination on their electronic waybills, railcars will be physically switched to n outbound trains. Number of railcar cuts depends on the order of railcars on train. The objective is to minimize the number of railcar cuts by means of changing the electronic waybills of empty railcars, i.e. re-assignment of empty railcars to customers, while respecting supply, demand, and feasibility constraints. In order to solve this problem, a supply–demand network is constructed first, where supply nodes and demand nodes represent railcars and destinations, respectively. The problem is then formulated as a modified transportation problem. Unlike the conventional transportation problem, a linear arc cost function is proposed to describe the adjacent cars’ impact on railcar cut. The objective is converted to a quadratic function, leading to a Mixed-Integer Quadratic Programming (MIQP) problem. We improve proposed MIQP to a Convex Mixed-Integer Quadratic Programming (C-MIQP) problem by adding a quadratic term to the objective function. Illustrative and realistic examples are presented to validate the feasibility and efficiency of proposed pre-blocking optimizer.

Suggested Citation

  • 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).
  • Handle: RePEc:eee:transe:v:162:y:2022:i:c:s1366554522001041
    DOI: 10.1016/j.tre.2022.102713
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.tre.2022.102713?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. Merrill M. Flood, 1956. "The Traveling-Salesman Problem," Operations Research, INFORMS, vol. 4(1), pages 61-75, February.
    2. 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.
    3. Terry L. Friesz & David Bernstein & Tony E. Smith & Roger L. Tobin & B. W. Wie, 1993. "A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem," Operations Research, INFORMS, vol. 41(1), pages 179-191, February.
    4. 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.
    5. Michael F. Gorman, 2015. "Empty Railcar Distribution," International Series in Operations Research & Management Science, in: Bruce W. Patty (ed.), Handbook of Operations Research Applications at Railroads, edition 127, chapter 0, pages 177-189, Springer.
    6. Ravindra K. Ahuja & Krishna C. Jha & Jian Liu, 2007. "Solving Real-Life Railroad Blocking Problems," Interfaces, INFORMS, vol. 37(5), pages 404-419, October.
    7. Warren B. Powell & Tassio A. Carvalho, 1998. "Real-Time Optimization of Containers and Flatcars for Intermodal Operations," Transportation Science, INFORMS, vol. 32(2), pages 110-126, May.
    8. Shi, Tie & Zhou, Xuesong, 2015. "A mixed integer programming model for optimizing multi-level operations process in railroad yards," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 19-39.
    9. Polyak, B.T., 2007. "Newton's method and its use in optimization," European Journal of Operational Research, Elsevier, vol. 181(3), pages 1086-1096, September.
    10. 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.
    11. 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.
    12. 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)

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. Ioannou, Petros & Giuliano, Genevieve & Dessouky, Maged & Chen, Pengfei & Dexter, Sue, 2020. "Freight Load Balancing and Efficiencies in Alternative Fuel Freight Modes," Institute of Transportation Studies, Working Paper Series qt3ns4b894, Institute of Transportation Studies, UC Davis.
    7. Michael F. Gorman, 2016. "From Magnum Opus to Mea Culpa: A Cautionary Tale of Lessons Learned from a Failed Decision Support System," Interfaces, INFORMS, vol. 46(2), pages 183-195, April.
    8. 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.
    9. 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.
    10. 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.
    11. Wang, Dian & Zhao, Jun & Peng, Qiyuan, 2022. "Optimizing the loaded train combination problem at a heavy-haul marshalling station," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 162(C).
    12. Alena Otto & Erwin Pesch, 2017. "Operation of shunting yards: train-to-yard assignment problem," Journal of Business Economics, Springer, vol. 87(4), pages 465-486, May.
    13. 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.
    14. Qixiu Cheng & Zhiyuan Liu & Feifei Liu & Ruo Jia, 2017. "Urban dynamic congestion pricing: an overview and emerging research needs," International Journal of Urban Sciences, Taylor & Francis Journals, vol. 21(0), pages 3-18, August.
    15. Soulaymane Kachani & Georgia Perakis, 2009. "A Dynamic Travel Time Model for Spillback," Networks and Spatial Economics, Springer, vol. 9(4), pages 595-618, December.
    16. Ran, Bin & Hall, Randolph & Boyce, David E., 1995. "A Link-Based Variational Inequality Model for Dynamic Departure Time/Route Choice," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt84t190b3, Institute of Transportation Studies, UC Berkeley.
    17. Neves-Moreira, Fábio & Almada-Lobo, Bernardo & Guimarães, Luís & Amorim, Pedro, 2022. "The multi-product inventory-routing problem with pickups and deliveries: Mitigating fluctuating demand via rolling horizon heuristics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    18. Han, Ke & Friesz, Terry L. & Yao, Tao, 2013. "A partial differential equation formulation of Vickrey’s bottleneck model, part II: Numerical analysis and computation," Transportation Research Part B: Methodological, Elsevier, vol. 49(C), pages 75-93.
    19. Andrew G. Clark & Susan Cholette & Ozgur Ozluk, 2011. "UCSF Increases Consumer Value Through Optimal Vendor-Show Scheduling," Interfaces, INFORMS, vol. 41(4), pages 327-337, August.
    20. Zhu, Feng & Ukkusuri, Satish V., 2017. "Efficient and fair system states in dynamic transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 272-289.

    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:transe:v:162:y:2022:i:c:s1366554522001041. 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/wps/find/journaldescription.cws_home/600244/description#description .

    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.