Industrial Engineering

Permanent URI for this collectionhttps://hdl.handle.net/10679/45

Browse

Browsing by Author "Alkaya, A. F."

Filter results by typing the first few letters
Now showing 1 - 5 of 5
  • Placeholder
    ArticlePublicationMetadata only
    Application of sequence-dependent traveling salesman problem in printed circuit board assembly
    (IEEE, 2013-06) Alkaya, A. F.; Duman, Ekrem; Industrial Engineering; DUMAN, Ekrem
    Optimization issues regarding the automated assembly of printed circuit boards attracted the interest of researchers for several decades. This is because even small gains in assembly time result in very important benefits in mass production. In this paper, the focus is on a particular placement machine type that has a rotational turret and a stationary component magazine. So far, this type of machine received little attention among the researchers. In this paper, the feeder configuration, placement sequencing, and assembly time minimization problems are formulated explicitly and completely (without simplifying assumptions) using nonlinear integer programming. In addition, the placement sequencing problem is shown to be a recently introduced new generalization of the traveling salesman problem (the sequence-dependent traveling salesman). These formulations show the complexity of the problems and the need for effective heuristic designs for solving them. We propose three heuristics that improve previously suggested solution methods and give comparable results when compared to simulated annealing that is a widely accepted good performing metaheuristic on combinatorial optimization problems. The heuristics are experimentally shown to improve previous methods significantly in assembly time that implies a huge economic benefit. The heuristics proposed could also be applied to other placement machines with similar operation principles.
  • Placeholder
    ArticlePublicationMetadata only
    Combining and solving sequence dependent traveling salesman and quadratic assignment problems in PCB assembly
    (Elsevier, 2015-09-10) Alkaya, A. F.; Duman, Ekrem; Industrial Engineering; DUMAN, Ekrem
    In this study we undertake the optimization of chip shooter component placement machines which became popular in assembling printed circuit boards (PCB) in recent years. A PCB is usually a rectangular plastic board on which the electrical circuit to be used in a particular electronic equipment is printed. The overall optimization of the chip shooter placement machines leads to a very complicated optimization problem which we formulate here for the first time (without any simplifying assumptions). However, it is possible to decompose the problem into placement sequencing problem and feeder configuration problem which turn out to be sequence dependent traveling salesman problem (SDTSP) and Quadratic Assignment Problem (QAP), respectively. We use simulated annealing metaheuristic approach and the heuristics developed for the SDTSP in an earlier study to solve these two problems in an iterative manner. We also attempt to solve the combined overall optimization problem by simulated annealing and artificial bee colony metaheuristics and compare their performances with the iterative approach. The results are in favor of iterative approach.
  • Placeholder
    ArticlePublicationMetadata only
    Comparison of computational intelligence models on forecasting automated teller machine cash demands
    (Old City Publishing, 2020) Alkaya, A. F.; Gultekin, O. G.; Danaci, E.; Duman, Ekrem; Industrial Engineering; DUMAN, Ekrem
    We take up the problem of forecasting the amount of money to be withdrawn from automated teller machines (ATM). We compare the performances of eleven different algorithms from four different research areas on two different datasets. The exploited algorithms are fuzzy time series, multiple linear regression, artificial neural network, autoregressive integrated moving average, gaussian process regression, support vector regression, long-short term memory, simultaneous perturbation stochastic approximation, migrating birds optimization, differential evolution, and particle swarm optimization. The first dataset is very volatile and is obtained from a Turkish bank whereas the more stationary second dataset is obtained from a UK bank which was used in competitions previously. We use mean absolute deviation (MAD) to compare the algorithms since it provides a universal comparison ability independent of the magnitude of the data. The results show that support vector regression (SVR) performs the best on both data sets with a very short run time.
  • Placeholder
    ArticlePublicationMetadata only
    Migrating birds optimization: a new metaheuristic approach and its performance on quadratic assignment problem
    (Elsevier, 2012-12-25) Duman, Ekrem; Uysal, M.; Alkaya, A. F.; Industrial Engineering; DUMAN, Ekrem
    We propose a new nature inspired metaheuristic approach based on the V flight formation of the migrating birds which is proven to be an effective formation in energy saving. Its performance is tested on quadratic assignment problem instances arising from a real life problem and very good results are obtained. The quality of the solutions we report are better than simulated annealing, tabu search, genetic algorithm, scatter search, particle swarm optimization, differential evolution and guided evolutionary simulated annealing approaches. The proposed method is also tested on a number of benchmark problems obtained from the QAPLIB and in most cases it was able to obtain the best known solutions. These results indicate that our new metaheuristic approach could be an important player in metaheuristic based optimization.
  • Placeholder
    EditorialPublicationMetadata only
    Preface: 13th cologne-twente workshop on graphs and combinatorial optimization (CTW 2015)
    (Elsevier, 2019-01-10) Duman, Ekrem; Alkaya, A. F.; Pickl, S.; Faigle, U.; Industrial Engineering; DUMAN, Ekrem
    N/A