Following a number of recent papers investigating the possibility of optimal comparison-based optimization algorithms for a given distribution of probability on fitness functions, we (i) discuss the comparison-based constraints (ii) choose a setting in ...

We consider a formulation of the biobjective soft graph coloring problem so as to simultaneously minimize the number of colors used as well as the number of edges that connect vertices of the same color. We aim to evolve hyperheuristics for this class ...

It is popular that there exist multiple objectives in practical control system. To solve this problem, a dynamic multi-objective control algorithm based on NSGA-II is presented. Based on the multi-objective evolutionary algorithm and the tight relation ...

In this work, alternative voting methods are compared to determine NASCAR rankings for the Sprint Cup Series. All of these methods make use only of the final placement of each driver in each race. We then construct a set of metrics to determine the ...

A mechanism involving evolutionary genetic programming (GP) and the expectation maximization algorithm (EM) is proposed to generate feature functions, based on the primitive features, for an image pattern recognition system on the diagnosis of the ...

Parameter control in evolutionary algorithms (EAs) has been shown to be beneficial; however, the control of offspring size has so far received very little attention. This paper introduces Futility-Based Offspring Sizing (FuBOS), a method for controlling ...

In this paper, we propose a methodology to improve the performance of the standard Differential Evolution (DE) in constraint optimization applications, in terms of accelerating its search speed, and improving the success rate. One critical mechanism ...

In this paper, we investigate the value of a new selection mechanism that is inspired from biochemistry, namely, vesicular selection. We test its effectiveness when used in evolutionary algorithms on a number of benchmark problems in both static and ...

The relevance of degree distribution to evolutionary search is supported by experiments. Hubs and their locality sit at the schwerpunkt of the explanation for this find. A full version of this paper including the method to generate hierarchically ...

This paper deals with the multi-objective definition of video compression and it solving using the NSGA-II algorithm. We define the video compression as a problem including two competing objectives and we try to find a set of near-optimal solutions so ...

This paper presents a novel evolutionary approach to solve numerical optimization problems, called Adaptive Evolution (AEv). AEv is a new micro-population-like technique because it uses small populations (less than 10 individuals). The two main ...

In this paper, we present a Fuzzy Influence Function for the CAEP model (Cultural Algorithms with Evolutionary Programming) proposed by Chung [1] and extended by Zhu [6], applied to real-valued function optimization. The proposal makes use of a Fuzzy ...

The ECGA is a competent Genetic Algorithm that uses a probabilistic model to learn the linkage among variables and then uses this information to solve hard problems using polynomial resources. However, in order to detect the linkage, the ECGA needs to ...

We address a large scale waste collection vehicle routing problem with time windows (VRPTW) complicated by multiple disposal trips and drivers lunch breaks. A fitness search space analysis for several problem instances of the waste collection VRPTW ...

In this paper, we propose a novel quantum-inspired evolutionary algorithm, called NQEA, for solving combinatorial optimization problems. NQEA uses a new Q-bit update operator to increase the balance between the exploration and exploitation of the search ...

Ant models are investigated with the purpose of providing a high-quality performing heuristic for solving the linear ordering problem. Extending the Ant Colony System (ACS) model, the proposed Step-Back Sensitive Ant Model (SBSAM) allows agents to take ...

This paper compares several metaheuristics on the balanced graph bisection problem and identifies their relative performance on structured test graphs. For this purpose, a Simple implementation of a graph Bisection Iterated Local Search algorithm (SBILS)...

Our aim in this paper is to analyse the evolvability of diverse coding conversion operators in an instance of the states based evolutionary algorithm (SEA). Since the representation of solutions or the selection of the best encoding during the ...

This article presents the implementation of a bio-inspired algorithm, which is the algorithm of particle swarm optimization (PSO) in with the objective of minimizing the function of conformational energy ECEPP/3 for the protein folding problem (PFP) for ...

This paper proposes an evolved control architecture based on neural fields for a relatively complex and unstable dynamical system. The neural field model is capable of addressing goal-based planning problems and has properties, like embedding in an ...