Niche Search : an Evolutionary Algorithm
نویسنده
چکیده
In this paper we describe niche search, a genetic-based opti-misation approach which is characterised by an evolutionary search on two layers: the individual layer (which is comparable to search described in other genetic algorithms), and the niche layer. Neither of these searches is directed: both individuals and niches evolve based on the selection of the ttest. The numerical results obtained by niche search are quite promising, as our implementation has successfully handled all the tests carried out. The computational performance is considerably better than that of other algorithms of the same family analysed in the literature. 1 Overview Niche search is a genetic algorithm version for whose conception special attention has been paid to the aspects that follow. First, encode the reproduction operations that occur in nature, at the cellular and molecular level, more precisely and completely than the implementation proposed in the canonical genetic algorithm (CGA). In particular, it is proposed a simulation of the meiosis process in the reproduction of our artiicial organisms. Meiosis is the main source of diversity in nature (for sexual reproduction), and is absent in the CGA. Second, the overall population of individuals | the ecosystem | is assembled into diierent groups, each of them occupying a particular niche. This parallels what happens in nature: individuals of a given species are in general not found neither alone nor assembled in the same global pool. Furthermore, the parameters that control the reproduction (mutation probability, crossover probability, etc.) may vary from place to place, as may vary the way in which diierent species exploit diierent parameters. In the approach proposed, each niche is supplied its own set of these parameters by the ecosystem, in an arbitrary and endogenous way. Finally, selection and reproduction act not only at the level of individuals, but also at the level of groups of individuals (niches). Individuals must compete in order to survive among their similars; niches must also compete between them for resources in the environment. Competition and selection between individuals of a particular niche is similar to what is proposed in the CGA; competition
منابع مشابه
Niche Search : an Application to the
In this paper we describe a hybrid strategy for solving combinatorial optimisation problems, obtained by coupling a local search method to an evolutionary algorithm, and we provide an application to the Manhattan newspaper problem. The local search method has been devised speciically for this class of problems. It is based on a composite neighbourhood, which is searched iteratively up to the po...
متن کاملNiche Search: An Evolutionary Algorithm for Global Optimisation
We start this paper by an introduction to evolutionary algorithms and to their biological background. We present a survey of the most important evolutionary schemes found in the literature. We then describe niche search, a genetic-based optimisation approach that we have designed and implemented. It is characterised by an evolutionary search on two layers: the individual layer (which is compara...
متن کاملA Continuous Plane Model to Machine Layout Problems Considering Pick-Up and Drop-Off Points: An Evolutionary Algorithm
One of the well-known evolutionary algorithms inspired by biological evolution is genetic algorithm (GA) that is employed as a robust and global optimization tool to search for the best or near-optimal solution with the search space. In this paper, this algorithm is used to solve unequalsized machines (or intra-cell) layout problems considering pick-up and drop-off (input/output) points. Such p...
متن کاملAn Evolutionary Algorithm for Parametric Array Signal Processing
This paper presents an evolutionary algorithm for solving parameter optimization problems in parametric array signal processing. The method utilises the niche concept to maintain a population capable of exploring the search space while preserving the diversity to prevent the premature convergence. The former is achieved by a niche-based adaptive mutation scheme and the latter by a niche-based l...
متن کاملNiche Search : an Application in Vehicle
| In this paper we describe a hybrid strategy for solving combinatorial optimisation problems, obtained by coupling a local search method to an evolutionary algorithm, and we provide an application to a particular variant of the vehicle routing problem. The local search method has been devised speciically for this class of problems. It is based on a composite neighbourhood , which is searched i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007