IDEAS home Printed from https://ideas.repec.org/a/ids/ijmtma/v39y2025i1-2p122-136.html
   My bibliography  Save this article

Multi-product supply chain scheduling method based on hybrid genetic algorithm

Author

Listed:
  • Lingmin Yang

Abstract

In order to solve the shortcomings of traditional methods such as high Hamming loss value and low demand supply rate, a multi-product supply chain scheduling method based on hybrid genetic algorithm was designed. First, build supply time series, and sort the priority of supply chain scheduling according to the priority attribute values of backup plans in each link of the supply chain closed-loop model. Then, taking the shortest scheduling time as the objective function and the location constraints of the revolving warehouse as the constraints, the scheduling results are obtained by combining the genetic algorithm. In order to avoid the genetic algorithm falling into the local optimum, the simulated annealing algorithm is introduced to solve the global optimal solution of the objective function to achieve the coordinated scheduling of the supply chain. The experimental results show that this method can achieve multi-product supply chain scheduling more reasonably and effectively.

Suggested Citation

  • Lingmin Yang, 2025. "Multi-product supply chain scheduling method based on hybrid genetic algorithm," International Journal of Manufacturing Technology and Management, Inderscience Enterprises Ltd, vol. 39(1/2), pages 122-136.
    • Handle: RePEc:ids:ijmtma:v:39:y:2025:i:1/2:p:122-136
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=144117
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ids:ijmtma:v:39:y:2025:i:1/2:p:122-136. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=21 .

    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.