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

A metaheuristic algorithm for a locomotive routing problem arising in the steel industry

Author

Listed:
  • Huang, Baobin
  • Tang, Lixin
  • Baldacci, Roberto
  • Wang, Gongshu
  • Sun, Defeng

Abstract

In this study, we address the locomotive routing problem faced in the steel industry. During steel production, locomotives are employed to move torpedo cars, which transport molten iron, between blast furnaces and converters. The resulting complex pickup and delivery routing system which features multiple types of practical constraints, such as hard time windows, incompatibility of requests, variable locomotives capacity, and last-in-first-out constraints, constitutes this problem. Herein, three-index and modified group-based formulations are described and an adaptive large neighborhood search (ALNS) algorithm is proposed as a solution. The ALNS algorithm relies on both adapted and novel removal and insertion operators and a feature-based local search procedure. The mathematical formulations and the ALNS algorithm are evaluated on instances generated according to the actual production process. The results validate the effectiveness of the algorithm. A comparison with the manual plan also verifies the quality of the solutions produced by the algorithm.

Suggested Citation

  • Huang, Baobin & Tang, Lixin & Baldacci, Roberto & Wang, Gongshu & Sun, Defeng, 2023. "A metaheuristic algorithm for a locomotive routing problem arising in the steel industry," European Journal of Operational Research, Elsevier, vol. 308(1), pages 385-399.
  • Handle: RePEc:eee:ejores:v:308:y:2023:i:1:p:385-399
    DOI: 10.1016/j.ejor.2022.11.006
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.ejor.2022.11.006?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. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    2. Marilène Cherkesly & Guy Desaulniers & Gilbert Laporte, 2015. "Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading," Transportation Science, INFORMS, vol. 49(4), pages 752-766, November.
    3. Imen Harbaoui Dridi & Essia Ben Alaïa & Pierre Borne & Hanen Bouchriha, 2020. "Optimisation of the multi-depots pick-up and delivery problems with time windows and multi-vehicles using PSO algorithm," International Journal of Production Research, Taylor & Francis Journals, vol. 58(14), pages 4201-4214, July.
    4. Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte, 2007. "Rejoinder on: Static pickup and delivery problems: a classification scheme and survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 45-47, July.
    5. Ropke, Stefan & Pisinger, David, 2006. "A unified heuristic for a large class of Vehicle Routing Problems with Backhauls," European Journal of Operational Research, Elsevier, vol. 171(3), pages 750-775, June.
    6. Maria Battarra & Güneş Erdoğan & Gilbert Laporte & Daniele Vigo, 2010. "The Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs," Transportation Science, INFORMS, vol. 44(3), pages 383-399, August.
    7. Benavent, Enrique & Landete, Mercedes & Mota, Enrique & Tirado, Gregorio, 2015. "The multiple vehicle pickup and delivery problem with LIFO constraints," European Journal of Operational Research, Elsevier, vol. 243(3), pages 752-762.
    8. Li, Yongquan & Lim, Andrew & Oon, Wee-Chong & Qin, Hu & Tu, Dejian, 2011. "The tree representation for the pickup and delivery traveling salesman problem with LIFO loading," European Journal of Operational Research, Elsevier, vol. 212(3), pages 482-496, August.
    9. Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte, 2007. "Static pickup and delivery problems: a classification scheme and survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 1-31, July.
    10. Piu, F. & Prem Kumar, V. & Bierlaire, M. & Speranza, M.G., 2015. "Introducing a preliminary consists selection in the locomotive assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 82(C), pages 217-237.
    11. Tang, Lixin & Liu, Jiyin & Rong, Aiying & Yang, Zihou, 2001. "A review of planning and scheduling systems and methods for integrated steel production," European Journal of Operational Research, Elsevier, vol. 133(1), pages 1-20, August.
    12. Cherkesly, Marilène & Gschwind, Timo, 2022. "The pickup and delivery problem with time windows, multiple stacks, and handling operations," European Journal of Operational Research, Elsevier, vol. 301(2), pages 647-666.
    13. Sun, Defeng & Meng, Ying & Tang, Lixin & Liu, Jinyin & Huang, Baobin & Yang, Jiefu, 2020. "Storage space allocation problem at inland bulk material stockyard," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 134(C).
    14. Cherkesly, Marilène & Desaulniers, Guy & Irnich, Stefan & Laporte, Gilbert, 2016. "Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks," European Journal of Operational Research, Elsevier, vol. 250(3), pages 782-793.
    15. Cheang, Brenda & Gao, Xiang & Lim, Andrew & Qin, Hu & Zhu, Wenbin, 2012. "Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints," European Journal of Operational Research, Elsevier, vol. 223(1), pages 60-75.
    16. Demir, Emrah & Bektaş, Tolga & Laporte, Gilbert, 2012. "An adaptive large neighborhood search heuristic for the Pollution-Routing Problem," European Journal of Operational Research, Elsevier, vol. 223(2), pages 346-359.
    17. Li, Yuan & Chen, Haoxun & Prins, Christian, 2016. "Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests," European Journal of Operational Research, Elsevier, vol. 252(1), pages 27-38.
    18. Xu, Xiaoming & Li, Chung-Lun & Xu, Zhou, 2018. "Integrated train timetabling and locomotive assignment," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 573-593.
    19. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
    20. Souza, M.J.F. & Coelho, I.M. & Ribas, S. & Santos, H.G. & Merschmann, L.H.C., 2010. "A hybrid heuristic algorithm for the open-pit-mining operational planning problem," European Journal of Operational Research, Elsevier, vol. 207(2), pages 1041-1051, December.
    21. Sun, Peng & Veelenturf, Lucas P. & Hewitt, Mike & Van Woensel, Tom, 2020. "Adaptive large neighborhood search for the time-dependent profitable pickup and delivery problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 138(C).
    22. Ali Mehsin Alyasiry & Michael Forbes & Michael Bulmer, 2019. "An Exact Algorithm for the Pickup and Delivery Problem with Time Windows and Last-in-First-out Loading," Transportation Science, INFORMS, vol. 53(6), pages 1695-1705, November.
    23. Marco E. Lübbecke & Uwe T. Zimmermann, 2003. "Engine Routing and Scheduling at Industrial In-Plant Railroads," Transportation Science, INFORMS, vol. 37(2), pages 183-197, May.
    24. Veenstra, Marjolein & Roodbergen, Kees Jan & Vis, Iris F.A. & Coelho, Leandro C., 2017. "The pickup and delivery traveling salesman problem with handling costs," European Journal of Operational Research, Elsevier, vol. 257(1), pages 118-132.
    25. Chen, Cheng & Demir, Emrah & Huang, Yuan, 2021. "An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots," European Journal of Operational Research, Elsevier, vol. 294(3), pages 1164-1180.
    26. Baldacci, Roberto & Mingozzi, Aristide & Roberti, Roberto, 2012. "Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints," European Journal of Operational Research, Elsevier, vol. 218(1), pages 1-6.
    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. Cherkesly, Marilène & Gschwind, Timo, 2022. "The pickup and delivery problem with time windows, multiple stacks, and handling operations," European Journal of Operational Research, Elsevier, vol. 301(2), pages 647-666.
    2. Bombelli, Alessandro & Fazi, Stefano, 2022. "The ground handler dock capacitated pickup and delivery problem with time windows: A collaborative framework for air cargo operations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 159(C).
    3. Du, Jianhui & Zhang, Zhiqin & Wang, Xu & Lau, Hoong Chuin, 2023. "A hierarchical optimization approach for dynamic pickup and delivery problem with LIFO constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 175(C).
    4. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
    5. Hammami, Farouk & Rekik, Monia & Coelho, Leandro C., 2019. "Exact and heuristic solution approaches for the bid construction problem in transportation procurement auctions with a heterogeneous fleet," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 150-177.
    6. Pereira, Armando Honorio & Mateus, Geraldo Robson & Urrutia, Sebastián Alberto, 2022. "Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks," European Journal of Operational Research, Elsevier, vol. 300(1), pages 207-220.
    7. Iassinovskaia, Galina & Limbourg, Sabine & Riane, Fouad, 2017. "The inventory-routing problem of returnable transport items with time windows and simultaneous pickup and delivery in closed-loop supply chains," International Journal of Production Economics, Elsevier, vol. 183(PB), pages 570-582.
    8. Veenstra, Marjolein & Roodbergen, Kees Jan & Vis, Iris F.A. & Coelho, Leandro C., 2017. "The pickup and delivery traveling salesman problem with handling costs," European Journal of Operational Research, Elsevier, vol. 257(1), pages 118-132.
    9. Kallestad, Jakob & Hasibi, Ramin & Hemmati, Ahmad & Sörensen, Kenneth, 2023. "A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 309(1), pages 446-468.
    10. Jiliu Li & Zhixing Luo & Roberto Baldacci & Hu Qin & Zhou Xu, 2023. "A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 31-49, January.
    11. Bergmann, Felix M. & Wagner, Stephan M. & Winkenbach, Matthias, 2020. "Integrating first-mile pickup and last-mile delivery on shared vehicle routes for efficient urban e-commerce distribution," Transportation Research Part B: Methodological, Elsevier, vol. 131(C), pages 26-62.
    12. Neves-Moreira, F. & Amorim, P. & Guimarães, L. & Almada-Lobo, B., 2016. "A long-haul freight transportation problem: Synchronizing resources to deliver requests passing through multiple transshipment locations," European Journal of Operational Research, Elsevier, vol. 248(2), pages 487-506.
    13. Liu, Yiming & Roberto, Baldacci & Zhou, Jianwen & Yu, Yang & Zhang, Yu & Sun, Wei, 2023. "Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 310(1), pages 133-155.
    14. Margaretha Gansterer & Richard F. Hartl & Sarah Wieser, 2021. "Assignment constraints in shared transportation services," Annals of Operations Research, Springer, vol. 305(1), pages 513-539, October.
    15. Schaumann, Sarah K. & Bergmann, Felix M. & Wagner, Stephan M. & Winkenbach, Matthias, 2023. "Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics," European Journal of Operational Research, Elsevier, vol. 311(1), pages 88-111.
    16. Marilène Cherkesly & Guy Desaulniers & Gilbert Laporte, 2015. "Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading," Transportation Science, INFORMS, vol. 49(4), pages 752-766, November.
    17. Gansterer, Margaretha & Hartl, Richard F. & Sörensen, Kenneth, 2020. "Pushing frontiers in auction-based transport collaborations," Omega, Elsevier, vol. 94(C).
    18. Mo, Pengli & Yao, Yu & D’Ariano, Andrea & Liu, Zhiyuan, 2023. "The vehicle routing problem with underground logistics: Formulation and algorithm," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 179(C).
    19. Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.
    20. Dumez, Dorian & Lehuédé, Fabien & Péton, Olivier, 2021. "A large neighborhood search approach to the vehicle routing problem with delivery options," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 103-132.

    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:308:y:2023:i:1:p:385-399. 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.