IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v46y2016i5p391-408.html
   My bibliography  Save this article

Integrated Planning for Multiple Types of Locomotive Work Facilities Under Location, Routing, and Inventory Considerations

Author

Listed:
  • Siyang Xie

    (Department of Civil and Environmental Engineering, University of Illinois at Urbana–Champaign, Urbana, Illinois 61801)

  • Xi Chen

    (Department of Civil and Environmental Engineering, University of Illinois at Urbana–Champaign, Urbana, Illinois 61801)

  • Zhaodong Wang

    (Department of Civil and Environmental Engineering, University of Illinois at Urbana–Champaign, Urbana, Illinois 61801)

  • Yanfeng Ouyang

    (Department of Civil and Environmental Engineering, University of Illinois at Urbana–Champaign, Urbana, Illinois 61801)

  • Kamalesh Somani

    (CSX Transportation Inc., Jacksonville, Florida 32202)

  • Jing Huang

    (CSX Transportation Inc., Jacksonville, Florida 32202)

Abstract

In North America, thousands of locomotives operating in the railroad network require various types of mechanical work every day. This work may be unscheduled, periodic, or on demand and could be conducted at either a fixed facility or a movable facility. Each facility is characterized by the type of work it can provide. The long-term infrastructure planning of these facilities is vital to the efficiency of the railroad. In this paper, we develop a large-scale mixed-integer mathematical model for infrastructure planning. The model integrates and optimizes decisions about (1) Locations, capabilities, and capacities of fixed facilities, (2) Home locations and routing plans of movable facilities, and (3) Assignments of locomotive work demands to facilities. We propose a decomposition-based heuristic solution framework consisting of several underlying algorithms to solve this large-scale optimization model. Computational results on numerous scenario studies using field data from the railroad industry show that the proposed model and algorithms are capable of providing solutions that are significantly superior to the current practice. The successful application of our methodology to real-world railroad planning has clearly demonstrated the substantial cost-saving benefits of our models on infrastructure planning solutions.

Suggested Citation

  • Siyang Xie & Xi Chen & Zhaodong Wang & Yanfeng Ouyang & Kamalesh Somani & Jing Huang, 2016. "Integrated Planning for Multiple Types of Locomotive Work Facilities Under Location, Routing, and Inventory Considerations," Interfaces, INFORMS, vol. 46(5), pages 391-408, October.
    • Handle: RePEc:inm:orinte:v:46:y:2016:i:5:p:391-408
    DOI: 10.1287/inte.2016.0857
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.2016.0857
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.2016.0857?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. Harvey M. Wagner & Thomson M. Whitin, 1958. "Dynamic Version of the Economic Lot Size Model," Management Science, INFORMS, vol. 5(1), pages 89-96, October.
    2. ,, 2002. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 18(1), pages 193-194, February.
    3. Ann Melissa Campbell & Martin W. P. Savelsbergh, 2004. "A Decomposition Approach for the Inventory-Routing Problem," Transportation Science, INFORMS, vol. 38(4), pages 488-502, November.
    4. Laporte, Gilbert & Nobert, Yves, 1981. "An exact algorithm for minimizing routing and operating costs in depot location," European Journal of Operational Research, Elsevier, vol. 6(2), pages 224-226, February.
    5. Mazzola, Joseph B. & Neebe, Alan W., 1999. "Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type," European Journal of Operational Research, Elsevier, vol. 115(2), pages 285-299, June.
    6. Andrew J. Clark & Herbert Scarf, 2004. "Optimal Policies for a Multi-Echelon Inventory Problem," Management Science, INFORMS, vol. 50(12_supple), pages 1782-1790, December.
    7. P P Zouein & W R Abillama & E Tohme, 2002. "A multiple period capacitated inventory model for airline fuel management: a case study," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(4), pages 379-386, April.
    8. ,, 2002. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 18(5), pages 1273-1289, October.
    9. Tony J. Van Roy, 1986. "A Cross Decomposition Algorithm for Capacitated Facility Location," Operations Research, INFORMS, vol. 34(1), pages 145-163, February.
    10. Ahmadi-Javid, Amir & Seddighi, Amir Hossein, 2013. "A location-routing problem with disruption risk," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 53(C), pages 63-82.
    11. Nourbakhsh, Seyed Mohammad & Ouyang, Yanfeng, 2010. "Optimal fueling strategies for locomotive fleets in railroad networks," Transportation Research Part B: Methodological, Elsevier, vol. 44(8-9), pages 1104-1114, September.
    12. R. K. Ahuja & J. B. Orlin & S. Pallottino & M. P. Scaparra & M. G. Scutellà, 2004. "A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem," Management Science, INFORMS, vol. 50(6), pages 749-760, June.
    13. ,, 2002. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 18(4), pages 1007-1017, August.
    14. Martin Desrochers & Jacques Desrosiers & Marius Solomon, 1992. "A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows," Operations Research, INFORMS, vol. 40(2), pages 342-354, April.
    15. D Sariklis & S Powell, 2000. "A heuristic method for the open vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 51(5), pages 564-573, May.
    16. ,, 2002. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 18(3), pages 819-821, June.
    17. Laporte, Gilbert & Louveaux, Francois & Mercure, Helene, 1989. "Models and exact solutions for a class of stochastic location-routing problems," European Journal of Operational Research, Elsevier, vol. 39(1), pages 71-78, March.
    18. ,, 2002. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 18(2), pages 541-545, April.
    19. Kuby, Michael & Lim, Seow, 2005. "The flow-refueling location problem for alternative-fuel vehicles," Socio-Economic Planning Sciences, Elsevier, vol. 39(2), pages 125-145, June.
    20. Ichoua, Soumia & Gendreau, Michel & Potvin, Jean-Yves, 2003. "Vehicle dispatching with time-dependent travel times," European Journal of Operational Research, Elsevier, vol. 144(2), pages 379-396, January.
    21. ,, 2002. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 18(6), pages 1461-1465, December.
    22. Michael Kuby & Seow Lim, 2007. "Location of Alternative-Fuel Stations Using the Flow-Refueling Location Model and Dispersion of Candidate Sites on Arcs," Networks and Spatial Economics, Springer, vol. 7(2), pages 129-152, June.
    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. Yılmaz, Seren Bilge & Yücel, Eda, 2021. "Optimizing onboard catering loading locations and plans for airlines," Omega, Elsevier, vol. 99(C).
    2. Zanyang Cui & Zhimei Wang & Junhua Chen & Xingchen Zhang & Chunxiao Zhao, 2023. "Integrated Planning for Depot Location and Line Planning Problems in the Intercity Railway Network with Passenger Demand Uncertainty," Sustainability, MDPI, vol. 15(20), pages 1-22, October.
    3. Ningxuan Kang & Hao Shen & Ye Xu, 2022. "JD.com Improves Delivery Networks by a Multiperiod Facility Location Model," Interfaces, INFORMS, vol. 52(2), pages 133-148, March.
    4. Tönissen, D.D. & Arts, J.J., 2020. "The stochastic maintenance location routing allocation problem for rolling stock," International Journal of Production Economics, Elsevier, vol. 230(C).
    5. Tönissen, D.D. & Arts, J.J., 2018. "Economies of scale in recoverable robust maintenance location routing for rolling stock," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 360-377.

    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. Weijun Xie & Yanfeng Ouyang & Sze Chun Wong, 2016. "Reliable Location-Routing Design Under Probabilistic Facility Disruptions," Transportation Science, INFORMS, vol. 50(3), pages 1128-1138, August.
    2. Nagy, Gabor & Salhi, Said, 2007. "Location-routing: Issues, models and methods," European Journal of Operational Research, Elsevier, vol. 177(2), pages 649-672, March.
    3. Tan, K.C. & Chew, Y.H. & Lee, L.H., 2006. "A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 172(3), pages 855-885, August.
    4. Ting, Ching-Jung & Chen, Chia-Ho, 2013. "A multiple ant colony optimization algorithm for the capacitated location routing problem," International Journal of Production Economics, Elsevier, vol. 141(1), pages 34-44.
    5. Christian Prins & Caroline Prodhon & Angel Ruiz & Patrick Soriano & Roberto Wolfler Calvo, 2007. "Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic," Transportation Science, INFORMS, vol. 41(4), pages 470-483, November.
    6. Sahar Validi & Arijit Bhattacharya & P. J. Byrne, 2020. "Sustainable distribution system design: a two-phase DoE-guided meta-heuristic solution approach for a three-echelon bi-objective AHP-integrated location-routing model," Annals of Operations Research, Springer, vol. 290(1), pages 191-222, July.
    7. Zhang, Ying & Qi, Mingyao & Lin, Wei-Hua & Miao, Lixin, 2015. "A metaheuristic approach to the reliable location routing problem under disruptions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 83(C), pages 90-110.
    8. Roberto Baldacci & Aristide Mingozzi & Roberto Wolfler Calvo, 2011. "An Exact Method for the Capacitated Location-Routing Problem," Operations Research, INFORMS, vol. 59(5), pages 1284-1296, October.
    9. Drexl, Michael & Schneider, Michael, 2015. "A survey of variants and extensions of the location-routing problem," European Journal of Operational Research, Elsevier, vol. 241(2), pages 283-308.
    10. Dan A. Iancu & Mayank Sharma & Maxim Sviridenko, 2013. "Supermodularity and Affine Policies in Dynamic Robust Optimization," Operations Research, INFORMS, vol. 61(4), pages 941-956, August.
    11. Wasakorn Laesanklang & Dario Landa-Silva, 2017. "Decomposition techniques with mixed integer programming and heuristics for home healthcare planning," Annals of Operations Research, Springer, vol. 256(1), pages 93-127, September.
    12. Gao, Shangce & Wang, Yirui & Cheng, Jiujun & Inazumi, Yasuhiro & Tang, Zheng, 2016. "Ant colony optimization with clustering for solving the dynamic location routing problem," Applied Mathematics and Computation, Elsevier, vol. 285(C), pages 149-173.
    13. Claudio Contardo & Jean-François Cordeau & Bernard Gendron, 2014. "An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 88-102, February.
    14. Pourya Pourhejazy & Oh Kyoung Kwon, 2016. "The New Generation of Operations Research Methods in Supply Chain Optimization: A Review," Sustainability, MDPI, vol. 8(10), pages 1-23, October.
    15. Karaoglan, Ismail & Altiparmak, Fulya & Kara, Imdat & Dengiz, Berna, 2011. "A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery," European Journal of Operational Research, Elsevier, vol. 211(2), pages 318-332, June.
    16. Karaoglan, Ismail & Altiparmak, Fulya & Kara, Imdat & Dengiz, Berna, 2012. "The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach," Omega, Elsevier, vol. 40(4), pages 465-477.
    17. Prodhon, Caroline, 2011. "A hybrid evolutionary algorithm for the periodic location-routing problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 204-212, April.
    18. Melo, M.T. & Nickel, S. & Saldanha-da-Gama, F., 2009. "Facility location and supply chain management - A review," European Journal of Operational Research, Elsevier, vol. 196(2), pages 401-412, July.
    19. Sumanta Basu & Ghosh, Diptesh, 2008. "A review of the Tabu Search Literature on Traveling Salesman Problems," IIMA Working Papers WP2008-10-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    20. Said Dabia & Stefan Ropke & Tom van Woensel, 2019. "Cover Inequalities for a Vehicle Routing Problem with Time Windows and Shifts," Transportation Science, INFORMS, vol. 53(5), pages 1354-1371, September.

    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:orinte:v:46:y:2016:i:5:p:391-408. 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.