paper-with-me

Papers

Genetic and Memetic Algorithm with Diversity Equilibrium based on Greedy Diversification

2017-02-12 · Andrés Herrera-Poyatos, Francisco Herrera

The lack of diversity in a genetic algorithm's population may lead to a bad performance of the genetic operators since there is not an equilibrium between exploration and exploitation. In those cases, genetic algorithms present a fast and unsuitable convergence. In this paper we develop a novel hybrid genetic algorithm which attempts to obtain a balance between exploration and exploitation. It confronts the diversity problem using the named greedy diversification operator. Furthermore, the proposed algorithm applies a competition between parent and children so as to exploit the high quality visited solutions. These operators are complemented by a simple selection mechanism designed to preserve and take advantage of the population diversity. Additionally, we extend our proposal to the field of memetic algorithms, obtaining an improved model with outstanding results in practice. The experimental study shows the validity of the approach as well as how important is taking into account the exploration and exploitation concepts when designing an evolutionary algorithm.

📄 PDF Abstract BibTeX arXiv:1702.03594

Code (0)

등록된 구현이 없습니다.

Tasks

Diversity

Similar Papers 제목 키워드 기반

Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem

2017-06-21 · A. V. Eremeev, Yu. V. Kovalenko

We propose a new genetic algorithm with optimal recombination for the asymmetric instances of travelling salesman problem. The algorithm incorporates several new features that contribute to its effectiveness: (i) Optimal…

Two-stage memetic algorithm for blind equalization in direct-sequence/code-division multiple-access Systems

2024-12-17 · Luis M. San-José-Revuelta, Pablo Casaseca-de-la-Higuera

This paper proposes a novel memetic algorithm (MA) for the blind equalization of digital multiuser channels with Direct-Sequence / Code-Division Multiple-Access (DS/CDMA) sharing scheme. Equalization involves two differe…

Recombination vs Stochasticity: A Comparative Study on the Maximum Clique Problem

2024-09-26 · Michael Vella, John Abela, Kristian Guillaumier

The maximum clique problem (MCP) is a fundamental problem in graph theory and in computational complexity. Given a graph G, the problem is that of finding the largest clique (complete subgraph) in G. The MCP has many imp…

Bootstrapping of memetic from genetic evolution via inter-agent selection pressures

2021-04-07 · Nicholas Guttenberg, Marek Rosa

We create an artificial system of agents (attention-based neural networks) which selectively exchange messages with each-other in order to study the emergence of memetic evolution and how memetic evolutionary pressures i…

A Novel Memetic Strategy for Optimized Learning of Classification Trees

2023-05-13 · Tommaso Aldinucci

Given the increasing interest in interpretable machine learning, classification trees have again attracted the attention of the scientific community because of their glass-box structure. These models are usually built us…

Interpretable Machine Learning