Journal
JOURNAL OF INTELLIGENT MANUFACTURING
Volume 32, Issue 6, Pages 1529-1546Publisher
SPRINGER
DOI: 10.1007/s10845-020-01647-1
Keywords
Buffer allocation problem; Throughput maximization; Production lines; Combat genetic algorithm; Big bang-big crunch algorithm
Ask authors/readers for more resources
The BAP is an NP-hard combinatorial optimization problem with exponentially growing solution space. Two population-based search algorithms, CGA and BB-BC, were proposed to solve the BAP. Experimental results showed that BB-BC algorithm outperformed CGA and other algorithms.
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available