IDEAS home Printed from https://ideas.repec.org/a/spr/orspec/v43y2021i1d10.1007_s00291-020-00603-y.html
   My bibliography  Save this article

Multi-fidelity surrogate-based optimization for decomposed buffer allocation problems

Author

Listed:
  • Ziwei Lin

    (Shanghai Jiao Tong University
    Politecnico di Milano)

  • Nicla Frigerio

    (Politecnico di Milano)

  • Andrea Matta

    (Politecnico di Milano)

  • Shichang Du

    (Shanghai Jiao Tong University)

Abstract

The buffer allocation problem (BAP) for flow lines has been extensively addressed in the literature. In the framework of iterative approaches, algorithms alternate an evaluative method and a generative method. Since an accurate estimation of system performance typically requires high computational effort, an efficient generative method reducing the number of iterations is desirable, for searching for the optimal buffer configuration in a reasonable time. In this work, an iterative optimization algorithm is proposed in which a highly accurate simulation is used as the evaluative method and a surrogate-based optimization is used as the generative method. The surrogate model of the system performance is built to select promising solutions so that an expensive simulation budget is avoided. The performance of the surrogate model is improved with the help of fast but rough estimators obtained with approximated analytical methods. The algorithm is embedded in a problem decomposition framework: several problem portions are solved hierarchically to reduce the solution space and to ease the search of the optimum solution. Further, the paper investigates a jumping strategy for practical application of the approach so that the algorithm response time is reduced. Numerical results are based on balanced and unbalanced flow lines composed of single-machine stations.

Suggested Citation

  • Ziwei Lin & Nicla Frigerio & Andrea Matta & Shichang Du, 2021. "Multi-fidelity surrogate-based optimization for decomposed buffer allocation problems," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(1), pages 223-253, March.
    • Handle: RePEc:spr:orspec:v:43:y:2021:i:1:d:10.1007_s00291-020-00603-y
    DOI: 10.1007/s00291-020-00603-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00291-020-00603-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00291-020-00603-y?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.

    References listed on IDEAS

    as
    1. Ziwei Lin & Andrea Matta & J. George Shanthikumar, 2019. "Combining simulation experiments and analytical models with area-based accuracy for performance evaluation of manufacturing systems," IISE Transactions, Taylor & Francis Journals, vol. 51(3), pages 266-283, March.
    2. Stefan Helber & Katja Schimmelpfeng & Raik Stolletz & Svenja Lagershausen, 2011. "Using linear programming to analyze and optimize stochastic flow lines," Annals of Operations Research, Springer, vol. 182(1), pages 193-211, January.
    3. Chrissoleon T. Papadopoulos & Michael J. Vidalis & Michael E. J. O’Kelly & Diomidis Spinellis, 2009. "The Design of Production Lines," Springer Optimization and Its Applications, in: Analysis and Design of Discrete Part Production Lines, chapter 3, pages 101-111, Springer.
    4. Sophie Weiss & Justus Arne Schwarz & Raik Stolletz, 2019. "The buffer allocation problem in production lines: Formulations, solution methods, and instances," IISE Transactions, Taylor & Francis Journals, vol. 51(5), pages 456-485, May.
    5. Sophie Weiss & Andrea Matta & Raik Stolletz, 2018. "Optimization of buffer allocations in flow lines with limited supply," IISE Transactions, Taylor & Francis Journals, vol. 50(3), pages 191-202, March.
    6. Marcello Colledani & Stanley Gershwin, 2013. "A decomposition method for approximate evaluation of continuous flow multi-stage lines with general Markovian machines," Annals of Operations Research, Springer, vol. 209(1), pages 5-40, October.
    7. Stanley B. Gershwin, 1987. "An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking," Operations Research, INFORMS, vol. 35(2), pages 291-305, April.
    8. Chuan Shi & Stanley B. Gershwin, 2016. "A segmentation approach for solving buffer allocation problems in large production systems," International Journal of Production Research, Taylor & Francis Journals, vol. 54(20), pages 6121-6141, October.
    9. Diomidis Spinellis & Michael J. Vidalis & Michael E. J. O'Kelly & Chrissoleon T. Papadopoulos, 2009. "Analysis and Design of Discrete Part Production Lines," Springer Optimization and Its Applications, Springer, number 978-0-387-89494-2, September.
    10. Stanley Gershwin & James Schor, 2000. "Efficient algorithms for buffer space allocation," Annals of Operations Research, Springer, vol. 93(1), pages 117-144, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Mehmet Ulaş Koyuncuoğlu & Leyla Demir, 2021. "A comparison of combat genetic and big bang–big crunch algorithms for solving the buffer allocation problem," Journal of Intelligent Manufacturing, Springer, vol. 32(6), pages 1529-1546, August.
    2. Bengisu Urlu & Nesim K. Erkip, 2020. "Safety stock placement for serial systems under supply process uncertainty," Flexible Services and Manufacturing Journal, Springer, vol. 32(2), pages 395-424, June.
    3. Kolb, Oliver & Göttlich, Simone, 2015. "A continuous buffer allocation model using stochastic processes," European Journal of Operational Research, Elsevier, vol. 242(3), pages 865-874.
    4. Sachs, F.E. & Helber, S. & Kiesmüller, G.P., 2022. "Evaluation of Unreliable Flow Lines with Limited Buffer Capacities and Spare Part Provisioning," European Journal of Operational Research, Elsevier, vol. 302(2), pages 544-559.
    5. Yifan Zhou & Chao Yuan & Tian Ran Lin & Lin Ma, 2021. "Maintenance policy structure investigation and optimisation of a complex production system with intermediate buffers," Journal of Risk and Reliability, , vol. 235(3), pages 458-473, June.
    6. Konstantinos S. Boulas & Georgios D. Dounias & Chrissoleon T. Papadopoulos, 2023. "A hybrid evolutionary algorithm approach for estimating the throughput of short reliable approximately balanced production lines," Journal of Intelligent Manufacturing, Springer, vol. 34(2), pages 823-852, February.
    7. Andrea Matta & Francesca Simone, 2016. "Analysis of two-machine lines with finite buffer, operation-dependent and time-dependent failure modes," International Journal of Production Research, Taylor & Francis Journals, vol. 54(6), pages 1850-1862, March.
    8. Huynh, Linh & Hoang, Hien & Tran, Hung, 2020. "Does FDI enhance provincial productivity? A panel data analysis in Vietnam," MPRA Paper 117620, University Library of Munich, Germany, revised Aug 2021.
    9. Colledani, Marcello & Tolio, Tullio, 2009. "Performance evaluation of production systems monitored by statistical process control and off-line inspections," International Journal of Production Economics, Elsevier, vol. 120(2), pages 348-367, August.
    10. George Liberopoulos, 2020. "Comparison of optimal buffer allocation in flow lines under installation buffer, echelon buffer, and CONWIP policies," Flexible Services and Manufacturing Journal, Springer, vol. 32(2), pages 297-365, June.
    11. Elisa Gebennini & Andrea Grassi & Cesare Fantuzzi & Stanley Gershwin & Irvin Schick, 2013. "Discrete time model for two-machine one-buffer transfer lines with restart policy," Annals of Operations Research, Springer, vol. 209(1), pages 41-65, October.
    12. Shi, Chuan & Gershwin, Stanley B., 2009. "An efficient buffer design algorithm for production line profit maximization," International Journal of Production Economics, Elsevier, vol. 122(2), pages 725-740, December.
    13. Michael Manitz, 2015. "Analysis of assembly/disassembly queueing networks with blocking after service and general service times," Annals of Operations Research, Springer, vol. 226(1), pages 417-441, March.
    14. Elisa Gebennini & Andrea Grassi & Cesare Fantuzzi, 2015. "The two-machine one-buffer continuous time model with restart policy," Annals of Operations Research, Springer, vol. 231(1), pages 33-64, August.
    15. Rodríguez-Castelán, Carlos & López-Calva, Luis Felipe & Barriga-Cabanillas, Oscar, 2023. "Market concentration, trade exposure, and firm productivity in developing countries: Evidence from Mexico," World Development, Elsevier, vol. 165(C).
    16. Jean-Sébastien Tancrez, 2020. "A decomposition method for assembly/disassembly systems with blocking and general distributions," Flexible Services and Manufacturing Journal, Springer, vol. 32(2), pages 272-296, June.
    17. Nahas, Nabil & Ait-Kadi, Daoud & Nourelfath, Mustapha, 2006. "A new approach for buffer allocation in unreliable production lines," International Journal of Production Economics, Elsevier, vol. 103(2), pages 873-881, October.
    18. Dang Trinh Nguyen & Quoc Bao Duong & Eric Zamai & Muhammad Kashif Shahzad, 2016. "Fault diagnosis for the complex manufacturing system," Journal of Risk and Reliability, , vol. 230(2), pages 178-194, April.
    19. Stefan Helber & Katja Schimmelpfeng & Raik Stolletz & Svenja Lagershausen, 2011. "Using linear programming to analyze and optimize stochastic flow lines," Annals of Operations Research, Springer, vol. 182(1), pages 193-211, January.
    20. Alain Patchong & Thierry Lemoine & Gilles Kern, 2003. "Improving Car Body Production at PSA Peugeot Citroën," Interfaces, INFORMS, vol. 33(1), pages 36-49, February.

    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:spr:orspec:v:43:y:2021:i:1:d:10.1007_s00291-020-00603-y. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.