IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v62y2024i11p4122-4142.html
   My bibliography  Save this article

Multiobjective analytical evolutionary algorithm for train stowage planning problem of steel industry

Author

Listed:
  • Yun Dong
  • Xiangling Zhao

Abstract

The train stowage planning problem (TSPP) of the steel industry aims to select steel coils and allocate them to trains cost-effectively. It is a key component in the transportation of steel products. This study focuses on a multiobjective train stowage planning problem (MoTSPP) that maximises both the loading efficiency of the crane and the loading rate of the train. The MoTSPP also considers operation constraints related to steel coils, train wagons, and stowage modes in real-life railway transportation. An integer programming model is established to mathematically describe this problem. To obtain an efficient solution, a multiobjective analytical evolutionary algorithm (MAEA) that combines evolutionary algorithm (EA) with machine learning (ML) is presented. The EA part is a multiobjective differential evolution that introduces guided evolution and parameter adaptation to produce promising individuals and parameters, respectively. ML part adopts clustering algorithm and surrogate model to accelerate the search. Extensive comparisons and insight analyses are conducted from various perspectives to demonstrate the effectiveness and efficiency of the MAEA for solving the MoTSPP.

Suggested Citation

  • Yun Dong & Xiangling Zhao, 2024. "Multiobjective analytical evolutionary algorithm for train stowage planning problem of steel industry," International Journal of Production Research, Taylor & Francis Journals, vol. 62(11), pages 4122-4142, June.
  • Handle: RePEc:taf:tprsxx:v:62:y:2024:i:11:p:4122-4142
    DOI: 10.1080/00207543.2023.2254405
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2023.2254405
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2023.2254405?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:62:y:2024:i:11:p:4122-4142. 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.

    We have no bibliographic references for this item. You can help adding them by using 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.