Memetic algorithms are evolutionary algorithms incorporating local search to increase exploitation. This hybridization has been fruitful in countless applications. However, theory...
We present a memetic algorithm that dynamically optimizes the design of a wireless sensor network towards energy conservation and extension of the life span of the network, taking ...
Konstantinos P. Ferentinos, Theodore A. Tsiligirid...
The Multidimensional Assignment Problem (MAP or s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though...
The main purpose of this study is to find out a good solution to the vehicle routing problem considering heterogeneous vehicles. This problem tries to solve the generation of paths...
Abstract— Memetic algorithms arise as very effective algorithms to obtain reliable and high accurate solutions for complex continuous optimization problems. Nowadays, high dimens...
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra...
This paper presents a memetic algorithm with self-adaptive local search, applied to protein structure prediction in an HP, cubiclattice model. Besides describing in detail how the ...
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
A Quasi-Monte-Carlo method based on the computation of a surrogate model of the fitness function is proposed, and its convergence at super-linear rate 3/2 is proved under rather ...
Abstract. Memetic Algorithms are the most frequently used hybrid of Evolutionary Algorithms (EA) for real-world applications. This paper will deal with one of the most important ob...