A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...

This paper presents a theoretical study of the selection pressure in asynchronous cellular evolutionary algorithms (cEAs). This work is motivated by the search for a general model for asynchronous update of the individuals in a cellular EA, and by the necessity of better accuracy beyond what existing models of selection intensity can provide. Therefore, we investigate the differences between th...

Up to now there is no standardized strategy in how to teach evolutionary algorithms. Surely the answer to this question depends on the teaching context and the target group. But in the field of scientific teaching it is essential to abstract from paradigm orientation to a more general concept of evolutionary computing and to the underlying foundation. At the University of Stuttgart we pursue th...

Optimization of turning process is a non-linear optimization with constrains and it is difficult for the conventional optimization algorithms to solve this problem. The purpose of present study is to demonstrate the potential of Imperialist Competitive Algorithm (ICA) for optimization of multipass turning process. This algorithm is inspired by competition mechanism among imperialists and coloni...

This research presents a new application of the cloud theory-based simulated annealing algorithm to solve mixed model assembly line sequencing problems where line stoppage cost is expected to be optimized. This objective is highly significant in mixed model assembly line sequencing problems based on just-in-time production system. Moreover, this type of problem is NP-hard and solving this probl...

We present quantitative models for the selection pressure of cellular evolutionary algorithms structured in two dimensional regular lattices. We derive models based on probabilistic difference equations for synchronous and several asynchronous cell update policies. Theoretical results are in agreement with experimental values and show that the selection intensity can be controlled by using diff...

It has long been recognised that the choice of recombination and mutation operators and the rates at which they are applied to a Genetic Algorithm will have a significant effect on the outcome of the evolutionary search, with sub-optimal values often leading to poor performance. In this paper an evolutionary algorithm (APES) is presented within which both the units of heredity and the probabili...

fuzzy time series have been developed during the last decade to improve the forecast accuracy. many algorithms have been applied in this approach of forecasting such as high order time invariant fuzzy time series. in this paper, we present a hybrid algorithm to deal with the forecasting problem based on time variant fuzzy time series and particle swarm optimization algorithm, as a highly effici...