IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v73y2022i8p1800-1811.html
   My bibliography  Save this article

Improved genetic-simulated annealing algorithm for seru loading problem with downward substitution under stochastic environment

Author

Listed:
  • Zhe Zhang
  • Lili Wang
  • Xiaoling Song
  • Huijun Huang
  • Yong Yin

Abstract

To cope with fluctuating production demands in the volatile markets, a new-type seru production system is adopted due to its efficiency, flexibility, and responsiveness advantages. Seru loading problems are receiving tremendous attention, however, full downward substitution and uncertainties in product demand and yield are seldom considered. Accordingly, a combinatorial optimization seru loading model is constructed to address these concerns so as to maximize system profits, which, however, is notoriously challenging to solve with exact algorithms. Therefore, an improved genetic-simulated annealing algorithm (IGSA) is designed to obtain optimal loading results. To validate the effectiveness and efficacy of the proposed IGSA, algorithm comparisons with adaptive genetic algorithm (A-GA) and simulated annealing (SA) algorithm are conducted. Results show that the proposed model is effective for addressing the seru loading problem and IGSA is robust in solving the seru loading model.

Suggested Citation

  • Zhe Zhang & Lili Wang & Xiaoling Song & Huijun Huang & Yong Yin, 2022. "Improved genetic-simulated annealing algorithm for seru loading problem with downward substitution under stochastic environment," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 73(8), pages 1800-1811, August.
    • Handle: RePEc:taf:tjorxx:v:73:y:2022:i:8:p:1800-1811
    DOI: 10.1080/01605682.2021.1939172
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2021.1939172
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2021.1939172?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Lili Wang & Min Li & Guanbin Kong & Haiwen Xu, 2024. "Joint decision-making for divisional seru scheduling and worker assignment considering process sequence constraints," Annals of Operations Research, Springer, vol. 338(2), pages 1157-1185, July.

    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:tjorxx:v:73:y:2022:i:8:p:1800-1811. 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/tjor .

    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.