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

A two-stage stochastic programming model and parallel Master–Slave adaptive GA for flexible Seru system formation

Author

Listed:
  • Yuhong Ren
  • Jiafu Tang
  • Yang Yu
  • Xiaolong Li

Abstract

High flexibility is an important feature of seru system that has received less attention. In this paper, we discuss how to do such flexible seru system formation, especially focusing on the strategic decision phase. We formulate the flexible seru system formation problem (FSFP) as a nonlinear programming model to evaluate flexibility performance in terms of flexibility–investment cost and flexibility–loss cost. To exactly obtain the optimal solution of the FSFP, we transform the nonlinear model into a linear one and solve it with Gurobi solver. For the large-scale problem, we proposed a parallel Master–Slave adaptive genetic algorithm (PMSA-GA) by transforming it into a two-stage stochastic programming model. The adaptive selection is used to improve the quality of solutions in PMSA-GA. To reduce the computational time, multiple populations of seru formation evolve in parallel with the assistance of the Master–Slave mechanism. Extensive experiments are tested to evaluate the performance of the proposed model and algorithm, and the effect of cost parameters on the system performance is discussed. The results show that the FSFP model takes the property of dynamic demand into account and is more suitable for dynamic demand environments than the task-oriented seru formation (TOSF) strategy from the previous literature.

Suggested Citation

  • Yuhong Ren & Jiafu Tang & Yang Yu & Xiaolong Li, 2024. "A two-stage stochastic programming model and parallel Master–Slave adaptive GA for flexible Seru system formation," International Journal of Production Research, Taylor & Francis Journals, vol. 62(4), pages 1144-1161, February.
  • Handle: RePEc:taf:tprsxx:v:62:y:2024:i:4:p:1144-1161
    DOI: 10.1080/00207543.2023.2177087
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207543.2023.2177087?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:4:p:1144-1161. 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.