Scopus İndeksli Açık & Kapalı Erişimli Yayınlar
Permanent URI for this communityhttps://hdl.handle.net/11727/10752
Browse
8 results
Search Results
Item An International Facility Design Project(2008) Lacksonen, Thomas; Dengiz, BernaThis paper describes an international facilities design project for Manufacturing and Industrial Engineering students. American and Turkish engineering students collaborated to create and implement the re-design of a Turkish wheelchair manufacturing facility. The company needed engineering assistance to improve the efficiency and increase the capacity of their existing factory. Turkish Industrial Engineering students went on-site to collect data and draw the existing facility layout. American Manufacturing Engineering students analyzed the data and developed new layout designs. Four American students traveled to Turkey between semesters to implement the initial phases of their design. In the second semester, the Turkish students simulated the new layout to see the performance improvements, completing their project. Student learning outcomes were positive for both groups of students. The paper explains critical steps in identifying projects and partners. Lessons are shown about successes and shortcomings in planning, operating, and communicating with design teams across cultures.Item Aintshop Production Line Optimization Using Response Surface Methodology(2007) Dengiz, Berna; Belgin, Onder; 0000-0001-6702-2608; K-1080-2019This paper deals with the problem of determining the optimum number of workstations to be used in parallel and workers at some stations using simulation optimization approach in a paint shop line of an automotive factory in Ankara, Turkey. In the optimization stage of the study Response Surface Methodology (RSM) is used to find the optimum levels of considered factors. Simulation model and optimization stage integration is used both to analyse the performance of the current paint shop line and determine the optimum working conditions, respectively, with reduced cost, time and effort.Item A Tabu Search Algorithm for the Training of Neural Networks(2009) Dengiz, B.; Alabas-Uslu, C.; Dengiz, O.The most widely used training algorithm of neural networks (NNs) is back propagation ( BP), a gradient-based technique that requires significant computational effort. Metaheuristic search techniques such as genetic algorithms, tabu search (TS) and simulated annealing have been recently used to cope with major shortcomings of BP such as the tendency to converge to a local optimal and a slow convergence rate. In this paper, an efficient TS algorithm employing different strategies to provide a balance between intensification and diversification is proposed for the training of NNs. The proposed algorithm is compared with other metaheuristic techniques found in literature using published test problems, and found to outperform them in the majority of the test cases.Item A Local Search Heuristic with Self-tuning Parameter for Permutation Flow-Shop Scheduling Problem(2009) Dengiz, Berna; Alabas-Uslu, Cigdem; Sabuncuoglu, IhsanIn this paper, a new local search metaheuristic is proposed for the permutation flow-shop scheduling problem. In general, metaheuristics are widely used to solve this problem due to its NP-completeness. Although these heuristics are quite effective to solve the problem, they suffer from the need to optimize parameters. The proposed heuristic, named STLS, has a single self-tuning parameter which is calculated and updated dynamically based on both the response surface information of the problem field and the performance measure of the method throughout the search process. Especially, application simplicity of the algorithm is attractive for the users. Results of the experimental study show that STLS generates high quality solutions and outperforms the basic tabu search, simulated annealing, and record-to-record travel algorithms which are well-known local search based metaheuristics.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.Item A hybrid ant colony optimization approach for the design of reliable networks(2007) Dengiz, B.; Altiparmak, F.; Belgin, O.; 0000-0003-1730-4214; 0000-0001-6702-2608; AAF-7020-2021; K-1080-2019This paper presents a new solution approach, which is a hybridization of ant colony optimization (ACO) and simulated annealing (SA), called (h_ACO) to design of communication networks. The design problem is to find the optimal network topology where total cost is minimum and all-terminal reliability is not less-than a given level of reliability. The effectiveness of the h_ACO is investigated comparing its results with those obtained by SA and ACO, which are basic forms of the h_ACO, and also GAs given in the literature for the design problem. Computational results show that the h_ACO is an effective heuristic approach to design of reliable networks.Item A General Neural Network Model for Estimating Telecommunications Network Reliability(2009) Altiparmak, Fulya; Dengiz, Berna; Smith, Alice E.; 0000-0003-1730-4214; 0000-0001-8808-0663; AAF-7020-2021; AAK-2318-2021This paper puts forth a new encoding method for using neural network models to estimate the reliability of telecommunications networks with identical link reliabilities. Neural estimation is computationally speedy, and can be used during network design optimization by an iterative algorithm such as tabu search, or simulated annealing. Two significant drawbacks of previous approaches to using neural networks to model system reliability are the long vector length of the inputs required to represent the network link architecture, and the specificity of the neural network model to a certain system size. Our encoding method overcomes both of these drawbacks with a compact, general set of inputs that adequately describe the likely network reliability. We computationally demonstrate both the precision of the neural network estimate of reliability, and the ability of the neural network model to generalize to a variety of network sizes, including application to three actual large scale communications networks.Item A cross entropy approach to design of reliable networks(2009) Dengiz, Berna; Altiparmak, Fulya; 0000-0003-1730-4214; AAF-7020-2021One of the most important parameters determining the performance of communication networks is network reliability. The network reliability strongly depends on not only topological layout of the communication networks but also reliability and availability of the communication facilities. The selection of optimal network topology is an NP-hard problem so that computation time of enumeration-based methods grows exponentially with network size. This paper presents a new solution approach based on cross-entropy method, called NCE, to design of communication networks. The design problem is to find a network topology with minimum cost such that all-terminal reliability is not less than a given level of reliability. To investigate the effectiveness of the proposed NCE, comparisons with other heuristic approaches given in the literature for the design problem are carried out in a three-stage experimental study. Computational results show that NCE is an effective heuristic approach to design of reliable networks. (C) 2008 Elsevier B.V. All rights reserved.