A comparison of combat genetic and big bang–big crunch algorithms for solving the buffer allocation problem
Mehmet Ulaş Koyuncuoğlu () and
Leyla Demir ()
Additional contact information
Mehmet Ulaş Koyuncuoğlu: Pamukkale University
Leyla Demir: Izmir Bakircay University
Journal of Intelligent Manufacturing, 2021, vol. 32, issue 6, No 2, 1529-1546
Abstract:
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.
Keywords: Buffer allocation problem; Throughput maximization; Production lines; Combat genetic algorithm; Big bang–big crunch algorithm (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s10845-020-01647-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:joinma:v:32:y:2021:i:6:d:10.1007_s10845-020-01647-1
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10845
DOI: 10.1007/s10845-020-01647-1
Access Statistics for this article
Journal of Intelligent Manufacturing is currently edited by Andrew Kusiak
More articles in Journal of Intelligent Manufacturing from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().