IDEAS home Printed from https://ideas.repec.org/a/spr/joinma/v32y2021i6d10.1007_s10845-020-01647-1.html
   My bibliography  Save this article

A comparison of combat genetic and big bang–big crunch algorithms for solving the buffer allocation problem

Author

Listed:
  • Mehmet Ulaş Koyuncuoğlu

    (Pamukkale University)

  • Leyla Demir

    (Izmir Bakircay University)

Abstract

The buffer allocation problem (BAP) aims to determine the optimal buffer configuration for a production line under the predefined constraints. The BAP is an NP-hard combinatorial optimization problem and the solution space exponentially grows as the problem size increases. Therefore, problem specific heuristic or meta-heuristic search algorithms are widely used to solve the BAP. In this study two population-based search algorithms; i.e. Combat Genetic Algorithm (CGA) and Big Bang-Big Crunch (BB-BC) algorithm, are proposed in solving the BAP to maximize the throughput of the line under the total buffer size constraint for unreliable production lines. Performances of the proposed algorithms are tested on existing benchmark problems taken from the literature. The experimental results showed that the proposed BB–BC algorithm yielded better results than the proposed CGA as well as other algorithms reported in the literature.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:joinma:v:32:y:2021:i:6:d:10.1007_s10845-020-01647-1
    DOI: 10.1007/s10845-020-01647-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10845-020-01647-1
    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/s10845-020-01647-1?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. James MacGregor Smith, 2018. "Simultaneous buffer and service rate allocation in open finite queueing networks," IISE Transactions, Taylor & Francis Journals, vol. 50(3), pages 203-216, March.
    2. Thiago Cantos Lopes & Celso Gustavo Stall Sikora & Adalberto Sato Michels & Leandro Magatão, 2020. "An iterative decomposition for asynchronous mixed-model assembly lines: combining balancing, sequencing, and buffer allocation," International Journal of Production Research, Taylor & Francis Journals, vol. 58(2), pages 615-630, January.
    3. Frederick S. Hillier & Kut C. So & Ronald W. Boling, 1993. "Notes: Toward Characterizing the Optimal Allocation of Storage Space in Production Line Systems with Variable Processing Times," Management Science, INFORMS, vol. 39(1), pages 126-133, January.
    4. 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.
    5. Stanley Gershwin & James Schor, 2000. "Efficient algorithms for buffer space allocation," Annals of Operations Research, Springer, vol. 93(1), pages 117-144, January.
    6. Rodrigo Romero-Silva & Sabry Shaaban, 2019. "Influence of unbalanced operation time means and uneven buffer allocation on unreliable merging assembly line efficiency," International Journal of Production Research, Taylor & Francis Journals, vol. 57(6), pages 1645-1666, March.
    7. Ernest Koenigsberg, 1959. "Production Lines and Internal Storage--A Review," Management Science, INFORMS, vol. 5(4), pages 410-433, July.
    8. 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.
    9. 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.
    10. Giulia Pedrielli & Andrea Matta & Arianna Alfieri & Mengyi Zhang, 2018. "Design and control of manufacturing systems: a discrete event optimisation methodology," International Journal of Production Research, Taylor & Francis Journals, vol. 56(1-2), pages 543-564, January.
    11. 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.
    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. Federico Nuñez-Piña & Joselito Medina-Marin & Juan Carlos Seck-Tuoh-Mora & Norberto Hernandez-Romero & Eva Selene Hernandez-Gress, 2018. "Modeling of Throughput in Production Lines Using Response Surface Methodology and Artificial Neural Networks," Complexity, Hindawi, vol. 2018, pages 1-10, January.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. Papadopoulos, H. T. & Heavey, C., 1996. "Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines," European Journal of Operational Research, Elsevier, vol. 92(1), pages 1-27, July.
    8. Belmansour, Ahmed-Tidjani & Nourelfath, Mustapha, 2010. "An aggregation method for performance evaluation of a tandem homogenous production line with machines having multiple failure modes," Reliability Engineering and System Safety, Elsevier, vol. 95(11), pages 1193-1201.
    9. Battaïa, Olga & Dolgui, Alexandre, 2022. "Hybridizations in line balancing problems: A comprehensive review on new trends and formulations," International Journal of Production Economics, Elsevier, vol. 250(C).
    10. Sabry Shaaban & Tom Mcnamara & Sarah Hudson, 2015. "The impact of failure, repair and joint imbalance of processing time means & buffer sizes on the performance of unpaced production lines," Post-Print hal-01205567, HAL.
    11. Wei, Shuaichong & Nourelfath, Mustapha & Nahas, Nabil, 2023. "Analysis of a production line subject to degradation and preventive maintenance," Reliability Engineering and System Safety, Elsevier, vol. 230(C).
    12. Nabil Nahas, 2017. "Buffer allocation and preventive maintenance optimization in unreliable production lines," Journal of Intelligent Manufacturing, Springer, vol. 28(1), pages 85-93, January.
    13. Cruz, F.R.B. & Van Woensel, T. & Smith, J. MacGregor, 2010. "Buffer and throughput trade-offs in M/G/1/K queueing networks: A bi-criteria approach," International Journal of Production Economics, Elsevier, vol. 125(2), pages 224-234, June.
    14. 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.
    15. 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.
    16. 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.
    17. 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.
    18. Romero-Silva, Rodrigo & Shaaban, Sabry & Marsillac, Erika & Laarraf, Zouhair, 2021. "The impact of unequal processing time variability on reliable and unreliable merging line performance," International Journal of Production Economics, Elsevier, vol. 235(C).
    19. 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.
    20. Helber, Stefan, 1998. "Decomposition of unreliable assembly/disassembly networks with limited buffer capacity and random processing times," European Journal of Operational Research, Elsevier, vol. 109(1), pages 24-42, August.

    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:joinma:v:32:y:2021:i:6:d:10.1007_s10845-020-01647-1. 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.