Browsing by Subject "Evolutionary algorithms"

Now showing 1 - 7 of 7

Open Access
A beam search algorithm to optimize robustness under random machine breakdowns and processing time variability
(Institute of Industrial Engineers, 2007) Gören, S.; Sabuncuoğlu, İhsan
The vast majority of the machine scheduling research assumes complete information about the scheduling problem and a static environment in which scheduling systems operate. In practice, however, scheduling systems are subject to considerable uncertainty in dynamic environments. The ability to cope with the uncertainty in scheduling process is becoming increasingly important in today's highly dynamic and competitive business environments. In the literature, two approaches have appeared as the effective way: reactive and proactive scheduling. The objective in reactive scheduling is to revise schedules as necessary, while proactive scheduling attempts to incorporate future disruptions when generating schedules. In this paper we take a proactive scheduling approach to solve a machine scheduling problem with two sources of uncertainty: processing time variability and machine breakdowns. We define two robustness measures and develop a heuristic based on beam search methodology to optimize them. The computational results show that the proposed algorithms perform significantly better than a number of heuristics available in the literature.
Open Access
Examining the annealing schedules for RNA design algorithm
(IEEE, 2016-07) Erhan, H. E.; Sav, Sinem; Kalashnikov, S.; Tsang, H. H.
RNA structures are important for many biological processes in the cell. One important function of RNA are as catalytic elements. Ribozymes are RNA sequences that fold to form active structures that catalyze important chemical reactions. The folded structure for these RNA are very important; only specific conformations maintain these active structures, so it is very important for RNA to fold in a specific way. The RNA design problem describes the prediction of an RNA sequence that will fold into a given RNA structure. Solving this problem allows researchers to design RNA; they can decide on what folded secondary structure is required to accomplish a task, and the algorithm will give them a primary sequence to assemble. However, there are far too many possible primary sequence combinations to test sequentially to see if they would fold into the structure. Therefore we must employ heuristics algorithms to attempt to solve this problem. This paper introduces SIMARD, an evolutionary algorithm that uses an optimization technique called simulated annealing to solve the RNA design problem. We analyzes three different cooling schedules for the annealing process: 1) An adaptive cooling schedule, 2) a geometric cooling schedule, and 3) a geometric cooling schedule with warm up. Our results show that an adaptive annealing schedule may not be more effective at minimizing the Hamming distance between the target structure and our folded sequence's structure when compared with geometric schedules. The results also show that warming up in a geometric cooling schedule may be useful for optimizing SIMARD. © 2016 IEEE.
Open Access
Levy walk evolution for global optimization
(ACM, 2008-07) Urfalıoğlu, Onay; Çetin, A. Enis; Kuruoğlu, E. E.
A novel evolutionary global optimization approach based on adaptive covariance estimation is proposed. The proposed method samples from a multivariate Levy Skew Alpha-Stable distribution with the estimated covariance matrix to realize a random walk and so to generate new solution candidates in the mutation step. The proposed method is compared to the popular Differential Evolution method, which is one of the best general evolutionary global optimizers available. Experimental results indicate that the proposed approach yields a general improvement in the required number of function evaluations to solve global optimization problems. Especially, as shown in experiments, the underlying heavy tailed alpha-stable distribution enables a considerably more effective global search in more complex problems. Track: Evolution Strategies.
Open Access
Performance limits on ranging with cognitive radio
(IEEE, 2009-06) Dardari, D.; Karisan, Yasir; Gezici, Sinan; D'Amico, A. A.; Mengali, U.
Cognitive radio is a promising paradigm for efficient utilization of the radio spectrum due to its capability to sense environmental conditions and adapt its communication and localization features. In this paper, the theoretical limits on time-of-arrival estimation for cognitive radio localization systems are derived in the presence of interference. In addition, an optimal spectrum allocation strategy which provides the best ranging accuracy limits is proposed. The strategy accounts for the constraints from the sensed interference level as well as from the regulatory emission mask. Numerical results are presented to illustrate the improvements that can be achieved by the proposed approach. © 2009 IEEE.
Open Access
Randomized and rank based differential evolution
(IEEE, 2009-12) Urfalıoğlu, Onay; Arıkan, Orhan
Many real world problems which can be assigned to the machine learning domain are inverse problems. The available data is often noisy and may contain outliers, which requires the application of global optimization. Evolutionary Algorithms (EA's) are one class of possible global optimization methods for solving such problems. Within population based EA's, Differential Evolution (DE) is a widely used and successful algorithm. However, due to its differential update nature, given a current population, the set of possible new populations is finite and a true subset of the cost function domain. Furthermore, the update formula of DE does not use any information about the fitnesses of the population. This paper presents a novel extension of DE called Randomized and Rank based Differential Evolution (R2DE) to improve robustness and global convergence speed on multimodal problems by introducing two multiplicative terms in the DE update formula. The first term is based on a random variate of a Cauchy distribution, which leads to a randomization. The second term is based on ranking of individuals, so that R2DE exploits additional information provided by the fitnesses. In experiments including non-linear dimension reduction by autoencoders, it is shown that R2DE improves robustness and speed of global convergence. © 2009 IEEE.
Open Access
Simulation optimization: a comprehensive review on theory and applications
(Taylor & Francis, 2004) Tekin, E.; Sabuncuoglu, I.
For several decades, simulation has been used as a descriptive tool by the operations research community in the modeling and analysis of a wide variety of complex real systems. With recent developments in simulation optimization and advances in computing technology, it now becomes feasible to use simulation as a prescriptive tool in decision support systems. In this paper, we present a comprehensive survey on techniques for simulation optimization with emphasis given on recent developments. We classify the existing techniques according to problem characteristics such as shape of the response surface (global as compared to local optimization), objective functions (single or multiple objectives) and parameter spaces (discrete or continuous parameters). We discuss the major advantages and possible drawbacks of the different techniques. A comprehensive bibliography and future research directions are also provided in the paper.
Open Access
Time-delay estimation in multiple-input single-output systems
(IEEE, 2010) Koçak, Fatih; Gezici, Sinan
In this paper, the time-delay estimation problem is studied for multiple-input single-output (MISO) systems. First, a theoretical analysis is carried out by deriving the Cramer-Rao lower bound (CRLB) for time-delay estimation in a MISO system. Then, the maximum likelihood (ML) estimator for the time-delay parameter is obtained, which results in a complex optimization problem in general. In order to provide a solution of the ML estimator with low computational complexity, ML estimation based on a genetic global optimization algorithm, namely, differential evolution (DE), is proposed. Simulation studies for various fading scenarios are performed to investigate the performance of the proposed algorithm. ©2010 IEEE.