Sürdürülebilir Kalkınma Amaçları
Yayınlar
- MakaleYalnız künye2020Scopus SJRQ1A fast branch, bound and remember algorithm for disassembly line balancing problem
Li, Zixiang; Çil, Zeynel Abidin; Mete, Suleyman; Kucukkoc, Ibrahim
In recent years, the interests of disassembly line have increased owing to economic reasons and the increase of environmental awareness. Effective line can provide many advantages in terms of economic aspect and it facilitates competition the companies with others. This study contributes to the relevant literature by a branch, bound and remember algorithm for disassembly line balancing problem with AND/OR precedence. The proposed exact solution method employs the memory-based dominance rule to eliminate the reduplicated sub-problems by storing all the searched sub-problems and to utilise cyclic best-first search strategy to obtain high-quality complete solutions fast. In this paper, minimising the number of stations is taken as the performance measure. The proposed methodology is tested on a set of 260 instances and compared with the mathematical model using CPLEX solver and five well-known metaheuristics. Computational results show that the proposed method is capable of obtaining the optimal solutions for all the tested instances with less than 0.1 seconds on average. Additionally, comparative study demonstrates that the proposed method is the state-of-the-art algorithm and outperforms the CPLEX solver and metaheuristics in terms of both solution quality and search speed aspects.
AtıfWoS66OpenAlex65
İncele - MakaleAçık Erişim2020Scopus SJRQ1Robotic disassembly line balancing problem: A mathematical model and ant colony optimization approach
Çil, Zeynel Abidin; Mete, Suleyman; Serin, Faruk
The use of robots is significantly increasing day by day in manufacturing systems, and especially improving the efficiency of the lines. Robots can be used to complete disassembly tasks, and each of the robots can need different operation times to perform the tasks. In this paper, the balancing of the robotic disassembly line problem has been studied to develop efficient solution techniques. Firstly, a mixed-integer linear mathematical model is proposed to determine and solve the problem optimally. A case study from literature is addressed to assess and show the efficiency and effectiveness of the model to minimize cycle time. Secondly, a heuristic algorithm based on ant colony optimization is also proposed to discover a solution for especially the large-size test problems due to the complexity of the problem. The performance of the proposed heuristic algorithm is verified and compared with the different heuristic on data sets. The computational results indicate that the proposed mathematical model and the algorithms are promising for the small and large-size test problems, respectively. Finally, it should be stated that robots have great potential to use in the area of disassembly line and useful solutions provide according to test results.
AtıfScopus80OpenAlex84
İncele - MakaleYalnız künye2019Scopus SJRQ1Supply-driven rebalancing of disassembly lines: A novel mathematical model approach
Mete, Suleyman; Çil, Zeynel Abidin; Celik, Erkan; Ozceylan, Eren
In recent years, the interest of disassembly line has increased owing to the economic reasons and increase of environmental awareness. The balancing of the disassembly line is one of the factors affecting directly the performance of the process. Companies with a line used effectively can gain many advantages in terms of economic aspect and it facilitates competition the companies with others. Moreover, uncertainties end-of-life products characteristics and quantity of supply/demand causes reassigned of task and altering cycle time. Rebalancing of disassembly line is required in this situation. In this study, a novel mixed integer programming model is proposed. Firstly, disassembly line balance is created, and then according to the given new supply, tasks are reselected and reassigned to the workstations. A real case study is presented. The generated test problems are also analyzed using proposed mathematical model. Through the analysis of rebalancing the existing disassembly line, it has been identified that an existing balance might have been changed to accommodate changes in the desired output rate in order to cope up with the variation of the cycle time.
AtıfScopus31WoS27OpenAlex31İncele - MakaleAçık Erişim2018Forward supply Chain network design problem: Heuristic approaches
Koc, Cagri; Özceylan, Eren; Kesen, Saadettin Erhan; Çil, Zeynel Abidin; Mete, Suleyman
Determining positions and counting of actors, amount of product flowbetween and decreasing transportation costs are handled as a networkdesign problem in supply chain management. Supply chain networkdesign (SCND) problem belongs to the class of NP-hard problems. It hastherefore appealed to a number of researchers’ close attention.However, existing literature lacks of common benchmark instances forforward SCND problems so as to make a fair comparison betweendeveloped and applied heuristic approaches. To this end, 450 newbenchmark instances ranging from small to large size for forward SCNDproblems with two, three and four-echelon are generated and amathematical model for each of the problems is formulated. Due to thecomplexity issues, we develop two heuristic solution approaches, geneticalgorithm (GA) and hybrid heuristic algorithm (HHA), and we applythem to the large pool of benchmark instances. Comparativeexperiments show that both the GA and HHA can yield feasible solutionsin much less computational time and, in particular, outperforms CPLEXregarding the solution quality as the number of echelon grows.
AtıfOpenAlex4TR Dizin2
İncele - MakaleAçık Erişim2018Scopus SJRQ1An optimisation support for the design of hybrid production lines including assembly and disassembly tasks
Mete, Süleyman; Çil, Zeynel Abidin; Özceylan, Eren; Ağpak, Kürşad; Battaïa, Olga
The optimisation problems related to the assignment of tasks to workstations in assembly and disassembly lines have been largely discussed in the literature. They are known, respectively, as Assembly Line Balancing and Disassembly Line Balancing Problems. In this study, both types of task performed on the identical product are integrated in a common hybrid production system. Therefore, the logistic process is simplified and disassembly tasks can supply easier the assembly tasks with the required components. The considered production system has the layout of two parallel lines with common workstations. The product flow is conventional in the assembly line and reverse in the disassembly line. The paper provides a new mathematical model for designing such a hybrid system and an approximate approach based on ant colony optimisation for solving large-scale instances. The solution method is tested in a case study. The obtained results are compared with the solution provided by the design of two independent lines. The analysis of the results highlights the potential benefits of the hybrid production system.
AtıfScopus53OpenAlex51İncele - 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 - BildiriYalnız künye2017A heuristic approach for joint design of assembly and disassembly line balancing problem
Mete, Suleyman; Çil, Zeynel Abidin; Özceylan, Eren
Balancing assembly and disassembly on parallel line together will positively affect to remanufacture production systems. In this study, two lines, which is one for assembly and other for disassembly, are considered as parallel line configuration. Parallelization of lines helps decrease the need for workforce significantly. Therefore, we propose heuristic approach based on ant colony optimization (ACO) for solving the balancing parallel line with minimizing number of workstations.
AtıfScopus2OpenAlex3İncele - BildiriYalnız künye2017Optimizing the location-allocation problem of bike sharing stations: A case study in gaziantep university campus
Özceylan, Eren; Mete, Süleyman; Çil, Zeynel Abidin; Drobne, S.; Zerovnik, J.; Zadnik Stirn, L.; Kljajic Borstar, M.
A growing number of cities are implementing bike-sharing programs to increase bicycle use. One of the key factors for the success of such programs is the location of bike stations in relation to potential demand. In this paper, potential locations of bike sharing stations in Gaziantep University campus are investigated to provide optimal utilization for users. To do so, first of all, 20 demand points and 20 potential bike stations are determined. Second, set covering mathematical model is handled to determine coverage capability of potential bike stations. Finally, P-center and P-median mathematical models are applied to set up potential stations and to assign demand points to the opened stations so that the total walking distance can be minimized. Computational experiments prove that our approach can find new potential bike stations which cover all demand points.
AtıfScopus5İ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 - BildiriYalnız künye2017A heuristic algorithm for assembly line balancing with stochastic sequence-dependent setup times
Çil, Zeynel Abidin; Mete, Süleyman; Özceylan, Eren; Diri Kenger, Zülal; Çil, Hande
Having analyzed studies on the assembly line balancing problem considering setup times, a few papers are observed. However, researches show that setup time plays an important role in total production time. Besides, in these studies, the setup times are assumed to be deterministic. Considering setup times to be deterministic decreases proximity of problem to real life application. Because the operation and setup times may vary in real applications due to human factors, machine breakdowns, lack of equipment and environmental factors. Therefore, in this study, assembly line balancing problem is investigated considering the sequence-dependent stochastic setup times. A heuristic approach based on COMSOAL is presented for the problem and it is seen that algorithm is effective for the problem.
AtıfScopus2İ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