# Heterogeneous Parallel Genetic Algorithm Paradigm

arXiv: https://arxiv.org/abs/1905.06636 · HTML: https://mlsanity.com/paper/1905.06636/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 16 May 2019.

## Built on by (most cited first, 1 of 1)

- [A new node-shift encoding representation for the travelling salesman problem](https://mlsanity.com/paper/2305.09257/) (2023)

## Abstract (arXiv)

The encoding representation of the genetic algorithm can boost or hinder its performance albeit the care one can devote to operator design. Unfortunately, a representation-theory foundation that helps to find the suitable encoding for any problem has not yet become mature. Furthermore, we argue that such a best-performing encoding scheme can differ even for instances of the same problem. In this contribution, we present the basic principles of the heterogeneous parallel genetic algorithm that federates the efforts of many encoding representations in order to efficiently solve the problem in hand without prior knowledge of the best encoding.