Sürdürülebilir Kalkınma Amaçları
Yazarlar
Yayınlar
- BildiriYalnız künye2017An efficient heuristic algorithm for solving robotic assembly line balancing problem
Çil, Zeynel Abidin; Mete, Süleyman; Özceylan, Eren
In the assembly system, robots provide to increase flexibility of the system and automation. The balancing robotic assembly line (RALB) problem consists two main works, which are not only assigning task to station, but also allocation robots in stations. Because each robots can perform different performance on the same tasks due to their capabilities. In this study, iterative beam search algorithm is developed to minimize cycle time. The performance of the algorithm outperforms other algorithm in the literature.
AtıfScopus2OpenAlex1
İncele - MakaleYalnız künye2017Scopus SJRQ1A beam search approach for solving type II robotic parallel assembly line balancing problem
Çil, Zeynel Abidin; Mete, Süleyman; Özceylan, Eren; Ağpak, Kürşad
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.
AtıfScopus56WoS48OpenAlex56
İncele - MakaleYalnız künye2016Scopus SJRQ1A solution approach based on beam search algorithm for disassembly line balancing problem
Mete, Süleyman; Çil, Zeynel Abidin; Ağpak, Kürşad; Özceylan, Eren; Dolgui, Alexandre
The disassembly line balancing (DLB) problem is the process of allocating a set of disassembly tasks to an ordered sequence of workstations in such a way that optimizes some performance measures (e.g., cycle time, number of stations). Since DLB problems belong to the class of NP hard, many heuristic and meta-heuristic algorithms are applied to cope with the complexity of the DLB problems in order to obtain acceptable solutions in a reasonable amount of time. In this study, a beam search (BS) based approach for the DLB problem is proposed. Minimization of number of workstations is used as the performance measure. The proposed algorithm is compared with the optimal solutions of well-known real cases and generated test problems. The results indicate that the proposed approach based on BS is a very competitive and promising tool for further researches.
AtıfScopus70OpenAlex72İncele