4.7 Article

A beam search approach for solving type II robotic parallel assembly line balancing problem

Journal

APPLIED SOFT COMPUTING
Volume 61, Issue -, Pages 129-138

Publisher

ELSEVIER SCIENCE BV
DOI: 10.1016/j.asoc.2017.07.062

Keywords

Assembly line balancing; Beam search; Heuristic; Parallel; Robotic

Funding

  1. BAGEP Award of the Science Academy in Turkey

Ask authors/readers for more resources

In a robotic assembly line, a series of stations are arranged along a conveyor belt and a robot performs on tasks at each station. Parallel assembly lines can provide improving line balance, productivity and so on. Combining robotic and parallel assembly lines ensure increasing flexibility of system, capacity and decreasing breakdown sensitivity. Although aforementioned benefits, balancing of robotic parallel assembly lines is lacking-to the best knowledge of the authors-in the literature. Therefore, a mathematical model is proposed to define/solve the problem and also iterative beam search (IBS), best search method based on IBS (BIBS) and cutting BIBS (CBIBS) algorithms are presented to solve the large-size problem due to the complexity of the problem. The algorithm also tested on the generated benchmark problems for robotic parallel assembly line balancing problem. The superior performances of the proposed algorithms are verified by using a statistical test. The results show that the algorithms are very competitive and promising tool for further researches in the literature. (C) 2017 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available