Discrete/combinatorial optimization has been an interesting and challenging area to researchers belonging to development of algorithms and OR techniques for real-world applications. Most such problems abstracted/taken from graph theory are NP-complete ...

Information is the tennis ball of communication- this sentence concluded Keith Devlin's talk trying to answer the question: 'Does information Really Exist?'. Whether information exists or not, the discussion about information surely does. Even though ...

Successful and efficient use of evolutionary algorithms (EAs) depends on the choice of the problem representation - that is, the genotype and the mapping from genotype to phenotype - and on the choice of search operators that are applied to this ...

The Future of Experimental Research

We present a comprehensive, effective and very efficient methodology for the design and experimental analysis of search heuristics such as evolutionary algorithms, differential evolution, pattern search or even ...

Many real-world search and optimization problems are naturally posed as non-linear programming problems having multiple conflicting objectives.

Due to lack of suitable solution techniques, such problems are usually artificially converted into a single-...

Probabilistic model-building algorithms (PMBGAs) replace traditional variation of genetic and evolutionary algorithms by (1) building a probabilistic model of promising solutions and (2) sampling the built model to generate new candidate solutions. ...

Much of this material is based on: David Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, 1989 (still one of the best introductions!) and Darrell Whitley, "Genetic Algorithm Tutorial" -- on the web at ...

Genetic Network Programming (GNP), one of the extended evolutionary algorithms was proposed, whose gene is constructed by the directed graph. GNP is distinguished from other evolutionary techniques in terms of its compact structure and implicit memory ...

Today, a lot of Automatic Programming techniques have been proposed and applied various fields. Graph Structured Program Evolution (GRAPE) is one of the recent Automatic Programming techniques. GRAPE succeeds in generating the complex programs ...

Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this method can be used to approximate takeover dynamics in spatially ...

In this paper, we propose a new method to predict the risk of an event very accurately from imbalanced data in which the number of instances of the majority class is very larger than that of the minority class and to identify the features that are ...

The paper considers the problem of selecting individuals in the current population in Genetic Algorithms for crossover to find a solution of high fitness of a given combinatorial optimization problem. Many different schemes have been considered in ...