A Memory Optimized Data Structure for Binary Chromosomes in Genetic Algorithm

by   Avijit Basak, et al.

This paper presents a memory-optimized metadata-based data structure for implementation of binary chromosome in Genetic Algorithm. In GA different types of genotypes are used depending on the problem domain. Among these, binary genotype is the most popular one for non-enumerated encoding owing to its representational and computational simplicity. This paper proposes a memory-optimized implementation approach of binary genotype. The approach improves the memory utilization as well as capacity of retaining alleles. Mathematical proof has been provided to establish the same.




A Genetic algorithm to solve the container storage space allocation problem

This paper presented a genetic algorithm (GA) to solve the container sto...

Parallel Genetic Algorithm to Solve Traveling Salesman Problem on MapReduce Framework using Hadoop Cluster

Traveling Salesman Problem (TSP) is one of the most common studied probl...

High-Performance Parallel Implementation of Genetic Algorithm on FPGA

Genetic Algorithms (GAs) are used to solve search and optimization probl...

Simulating Brain Reaction to Methamphetamine Regarding Consumer Personality

Addiction, as a nervous disease, can be analysed using mathematical mode...

FOGA: Flag Optimization with Genetic Algorithm

Recently, program autotuning has become very popular especially in embed...

GAAF: Searching Activation Functions for Binary Neural Networks through Genetic Algorithm

Binary neural networks (BNNs) show promising utilization in cost and pow...

Deriving Smaller Orthogonal Arrays from Bigger Ones with Genetic Algorithm

We consider the optimization problem of constructing a binary orthogonal...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.