Gene-Machine, a new search heuristic algorithm

03/08/2013
by   Alfredo Garcia Woods, et al.
0

This paper introduces Gene-Machine, an efficient and new search heuristic algorithm, based in the building-block hypothesis. It is inspired by natural evolution, but does not use some of the concepts present in genetic algorithms like population, mutation and generation. This heuristic exhibits good performance in comparison with genetic algorithms, and can be used to generate useful solutions to optimization and search problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/24/2012

New Hoopoe Heuristic Optimization

Most optimization problems in real life applications are often highly no...
research
01/09/2018

Novel Methods for Enhancing the Performance of Genetic Algorithms

In this thesis we propose new methods for crossover operator namely: cut...
research
03/15/2023

Epigenetics Algorithms: Self-Reinforcement-Attention mechanism to regulate chromosomes expression

Genetic algorithms are a well-known example of bio-inspired heuristic me...
research
06/21/2017

Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem

We propose a new genetic algorithm with optimal recombination for the as...
research
05/18/2015

Emergence-focused design in complex system simulation

Emergence is a phenomenon taken for granted in science but also still no...
research
01/20/2023

Massively Parallel Genetic Optimization through Asynchronous Propagation of Populations

We present Propulate, an evolutionary optimization algorithm and softwar...
research
04/16/2012

Explaining Adaptation in Genetic Algorithms With Uniform Crossover: The Hyperclimbing Hypothesis

The hyperclimbing hypothesis is a hypothetical explanation for adaptatio...

Please sign up or login with your details

Forgot password? Click here to reset