IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0315545.html
   My bibliography  Save this article

An enhanced genetic-based multi-objective mathematical model for industrial supply chain network

Author

Listed:
  • Yanchun Li

Abstract

The multi-objective supply chain needs a full look at enterprise costs, coordinated delivery of different products, and more fluidity and efficiency within the network of the supply chain. However, existing methodologies rarely delve into the intricacies of the industrial supply chain. Therefore, in the emerging industrial supply chain network, a model for the multi-objective problem was made using a meta-heuristic approach, specifically the improved genetic algorithm, which is a type of soft computing. To create the initial population, a hybrid approach that combines topology theory and the random search method was adopted, which resulted in a modification of the conventional single roulette wheel selection procedure. Additionally, the crossover and mutation operations were enhanced, with determining their respective probabilities determined through a fusion of the elite selection approach and the roulette method. The simulation results indicate that the improved genetic algorithm reduced the supply load from 0.678 to 0.535, labor costs from 1832 yuan to 1790 yuan, and operational time by approximately 39.5%, from 48 seconds to 29.5 seconds. Additionally, the variation in node utilization rates significantly decreased from 30.1% to 12.25%, markedly enhancing resource scheduling efficiency and overall balance within the supply chain.

Suggested Citation

  • Yanchun Li, 2025. "An enhanced genetic-based multi-objective mathematical model for industrial supply chain network," PLOS ONE, Public Library of Science, vol. 20(3), pages 1-21, March.
  • Handle: RePEc:plo:pone00:0315545
    DOI: 10.1371/journal.pone.0315545
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0315545
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0315545&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0315545?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
    ---><---

    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:plo:pone00:0315545. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.