Performance evaluation of WMN-GA for different mutation and crossover rates considering number of covered users parameter

Node placement problems have been long investigated in the optimization field due to numerous applications in location science and classification. Facility location problems are showing their usefulness to communication networks, and more especially from Wireless Mesh Networks (WMNs) field. Recently, such problems are showing their usefulness to communication networks, where facilities could be servers or routers offering connectivity services to clients. In this paper, we deal with the effect of mutation and crossover operators in GA for node placement problem. We evaluate the performance of the proposed system using different selection operators and different distributions of router nodes considering number of covered users parameter. The simulation results show that for Linear and Exponential ranking methods, the system has a good performance for all rates of crossover and mutation.Peer ReviewedPostprint (published version

The Effect of Distinct Geometric Semantic Crossover Operators in Regression Problems

This paper investigates the impact of geometric semantic crossover operators in a wide range of symbolic regression problems. First, it analyses the impact of using Manhattan and Euclidean distance geometric semantic crossovers in the learning process. Then, it proposes two strategies to numerically optimize the crossover mask based on mathematical properties of these operators, instead of simply generating them randomly. An experimental analysis comparing geometric semantic crossovers using Euclidean and Manhattan distances and the proposed strategies is performed in a test bed of twenty datasets. The results show that the use of different distance functions in the semantic geometric crossover has little impact on the test error, and that our optimized crossover masks yield slightly better results. For SGP practitioners, we suggest the use of the semantic crossover based on the Euclidean distance, as it achieved similar results to those obtained by more complex operators

A comparison of crossover operators in neural network feature selection with multiobjective evolutionary algorithms

Genetic algorithms are often employed for neural network feature selection. The efficiency of the search for a good subset of features, depends on the capability of the recombination operator to construct building blocks which perform well, based on existing genetic material. In this paper, a commonality-based crossover operator is employed, in a multiobjective evolutionary setting. The operator has two main characteristics: first, it exploits the concept that common schemata are more likely to form useful building blocks; second, the offspring produced are similar to their parents in terms of the subset size they encode. The performance of the novel operator is compared against that of uniform, 1 and 2-point crossover, in feature selection with probabilistic neural networks

A genetic algorithm for the mixed flow shop problem

In this thesis we present a new interesting version of the mixed flow shop se-quencing problem, which at the same time is a version of the classic flow shop,a very common topic on operations research.We propose a genetic algorithm to solve it that we will compare at the endwith a simple initial genetic-based algorithm previously design. For that wefirst focus on the crossover operator as we consider it the most challenging parton a sequencing problem. We study and compare 5 different crossover operatorsand we choose the one that performs better. Finally we calibrate the populationsize, the weight of mutation and crossover operators on the algorithm and alsothe mutations operator itself.The goal of the thesis is to better understand the specific mixed flow shopproblem version presented and design a genetic algorithm that clearly improvesthe performance of the initial algorith