.png){kind=icon}
.png){kind=icon}
Return
A Water-Flow Like Algorithm for Solving U-Shaped Assembly Line Balancing Problems
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2939724.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The problem of assigning assembly tasks to the stations arranged along a material handling device is known as assembly line balancing. This paper aims to address the U-shaped assembly line balancing problem (UALBP) which arises when a U-shaped assembly line has to be configured. It is widely known that this problem is NP-hard. Accordingly, different meta-heuristics based on a single solution (such as Simulated Annealing) or a population of solutions (such as Genetic Algorithms) have been proposed in the literature. Meanwhile, it has been argued that either of these meta-heuristics with a fixed number of solutions cannot maintain efficient search progress and thus can lead to premature convergence. Thus, this study aims at adopting a novel meta-heuristic algorithm with dynamic population sizes, namely Water Flow-like Algorithm (WFA), inspired by the behaviour of water flows in nature, to address the UALBP. The line efficiency and variation of workload are considered as the primary and the secondary objective, to be optimized, respectively. To verify the efficiency and robustness of the proposed WFA, a real case study taken from an automobile manufacturer as well as a set of standard problems are solved and the results compared with the existing approaches in the literature. The computational results demonstrate the superiority of the WFA, particularly in addressing medium to large-sized problems.
Keywords:
U-shaped
assembly line balancing
water flow-like algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.7W
Citations:
29.4W