Fakülteler / Faculties
Permanent URI for this communityhttps://hdl.handle.net/11727/1395
Browse
2 results
Search Results
Item Design Of Reliable Communication Networks: A Hybrid Ant Colony Optimization Algorithm(2010) Dengiz, Berna; Altiparmak, Fulya; Belgin, Onder; 0000-0003-1730-4214; 0000-0001-6702-2608; AAF-7020-2021; K-1080-2019This article proposes a hybrid approach based on Ant Colony Optimization (ACO) and Simulated Annealing (SA), called ACO_SA, for the design of communication networks. The design problem is to find the optimal network topology for which the total cost is a minimum and the all-terminal reliability is not less than a given level of reliability. The proposed ACO_SA has the advantages of the ability to find higher performance solutions, created by the ACO, and the ability to jump out of local minima to find better solutions, created by the SA. The effectiveness of ACO_SA is investigated by comparing its results with those obtained by individual application of SA and ACO, which are basic forms of ACO_SA, two different genetic algorithms and a probabilistic solution discovery algorithm given in the literature for the design problem. Computational results show that ACO_SA has a better performance than its basic forms and the investigated heuristic approaches.Item A Hybrid Simulated Annealing For A Multi-Objective Stochastic Assembly Line Balancing Problem(2008) Cakir, Burcin; Dengiz, Berna; Altiparmak, Fulya; Xia, GP; Deng, XQ; 0000-0003-1730-4214; AAF-7020-2021Asssembly line balancing is the problem of assigning tasks to the workstations, while optimizing one or more objectives without violating restrictions imposed on the line. In practice, task times may be random due to the worker fatigue, low skill levels, job dissatisfaction, poorly maintained equipment, defects in raw material, etc. When stochastic task times are taken consideration in assembly lines, balancing procedure is more complex due to the probability of incompleteness of stations times in a given cycle time. In this study, a multi-objective simulated annealing algorithm (m_SAA) is proposed for single-model, stochastic assembly line balancing problem with the aim of minimizing of smoothness index and total design cost. To obtain Pareto-optimal solutions, m_SAA implements tabu list and a multinomial probability mass function approach. The effectiveness of the proposed m_SAA is comparatively investigated using another SA using weight-sum approach on the test problems. Computational results show that m_SAA with multinomial probability mass function approach is more effective than SA with weight-sum approach in terms of quality of Pareto-optimal solutions.