[PDF] An Introduction to Memetic Algorithms | Semantic Scholar (2024)

The memetic approach combining the Modified Artificial Bee Colony algorithm and the Hooke-Jeeves method to improve its performance to solve constrained numerical optimization problems outperforms those of the compared algorithms.

Different types of selection techniques have been considered for the study and steady state selection technique shows better results than the existing selection operator.

A memetic algorithm has been designed and compared with the main heuristics used in the design of laminated polymers in different scenarios to show that more effective and dynamic methods are obtained by using certain techniques based on systematic exploitation of knowledge of the problem.

This article is the development of a design for finding a configuration of the input vector to the work with the associative neural network.

The results of MA demonstrate that the use of Constraints Satisfaction Technique permits MA to work more efficiently in the VRPTW.

In present investigation, and based on previous works of the authors, a memetic algorithm is presented for optimization in the loading of kilns starting from a real production line.

Two new techniques are introduced for particle swarm optimization: "resets" increase exploitation and "delayed updates" increase exploration, which helps more with the lbest topology which is moreExploration and exploitation are two important factors in the design of optimization techniques.

This paper addresses the simultaneous training and topology optimization of RNNs using multiobjective hybrid procedures using the Baldwinian hybridization strategy and studies the effects of the selection of the objectives, crossover, and mutation in the diversity during evolution.

The proposed multi-objective memetic differential evolution algorithm (MOMDE) for text clustering combines memetic and differential evolution algorithms to improve the search for optimal clustering by improving the balance between exploitation and exploration.

Two parallel treatments of the sequential memetic approach are introduced for solving the translocation distance problem for unsigned genomes and results show that the parallel approaches outperform the sequential Memetic algorithm.

...

...

A comparison of the proposed memetic algorithm with some of the currently best alternative approaches-reactive tabu search, robusttabu search and the fast ant colony system-demonstrates that the MA outperforms its competitors on all studied problem instances of practical interest.

This paper compares the performance of several constuctive based techniques for the circuit partitioning problem with the aim of determining the most robust and simple heuristics.

The memetic algorithm presented here is essentially a genetic algorithm with an element of local search and the effectiveness of the method is tested through its application to real scale problems.

A hybrid genetic algorithm based in local search is described, which exhibits a better overall performance in both cases when compared with other GA-based approaches and an exact technique.

The hybrid method developed in this paper is well suited for Open Shop Scheduling problems (OSSP), and the results obtained appear to be quite satisfactory.

A new hybrid algorithm that incorporates the flexible polyhedron method into the orthogonal genetic algorithm (OGA) is presented in this paper and can achieve better performance by performing global search and local search alternately.

A new generic recombination operator (GX) is proposed which is comprised of four phases which can be controlled by parameters reflecting the most important properties of recombination operators.

A formal, representation-independent form of a memetic algorithm—a genetic algorithm incorporating local search—is introduced, and the memetic algorithms performed very well on the travelling sales-rep problem.

A heuristic operator which utilises problem-specific knowledge is incorporated into the standard genetic algorithm approach and is capable of obtaining high-quality solutions for problems of various characteristics.

...

...