This paper provides insight into combining stochastic and deterministic search methods using evolutionary algorithms (EAs) such as evolutionary programming, evolutionary strategies, and genetic algorithms integrated with depth-rst search with backtracking, branch and bound, and best-rst search algorithms such as A. An important view of such an integration focuses on both theoretical analysis an...

A challenge in hybrid evolutionary algorithms is to employ efficient strategies to cover all the search space, applying local search only in actually promising search areas; on the other hand, clustering algorithms, a fundamental base for data mining procedures and learning techniques, suffer from the lack of efficient methods for determining the optimal number of clusters to be found in an arb...

This manuscript contains an outline of lectures course"Evolutionary Algorithms"read by the author in Omsk State University n.a. F.M.Dostoevsky. The course covers Canonic Genetic Algorithm and various other genetic algorithms as well as evolutionary strategies, genetic programming, tabu search and the class of evolutionary algorithms in general. Some facts, such as the Rotation Property of cross...

The Vehicle Routing Problem with Time Windows (VRPTW) is an important problem in logistics, which is an extension of well known Vehicle Routing Problem (VRP), with a central depot. The Objective is to design an optimal set of routes for serving a number of customers without violating the customer’s time window constraints and vehicle capacity constraint. It has received considerable attention i...

I present a new approach to evolutionary search called novelty search, wherein only behavioral novelty is rewarded, thereby abstracting evolution as a search for novel forms. This new approach contrasts with the traditional approach of rewarding progress towards the objective through an objective function. Although they are designed to light a path to the objective, objective functions can inst...

World Wide Web is growing at a very fast pace and makes a lot of information available to the public. Search engines used conventional methods to retrieve information on the Web; however, the search results of these engines are still able to be refined and their accuracy is not high enough. One of the methods for web mining is evolutionary algorithms which search according to the user interests...

This paper proposes a Hybrid Quantum Evolutionary Algorithm. Quantum computing is capable of processing huge numbers of quantum states simultaneously, in parallel, (“quantum parallelism”), whereas evolutionary computing can only process one chromosome per processor. In theory, QC ought to be able to process upto all possible points in a 2 search space (of N bit chromosomes). An evolutionary alg...