Machine coded genetic algorithm (MCGA) is a fast tool for realvalued optimization problems. It uses the byte representation of variables rather than realvalues. It performs the classical crossover operations (uniform) on these byte representations. Mutation operator is also similar to classical mutation operator, which is to say, it changes a randomly selected byte value of a chromosome by +1 or 1 with probability 1/2. In MCGAs there is no need for encodingdecoding process and the classical operators are directly applicable on realvalues. It is fast and can handle a wide range of a search space with high precision. Using a 256unary alphabet is the main disadvantage of this algorithm but a moderate size population is convenient for many problems. Package also includes multi_mcga function for multi objective optimization problems. This function sorts the chromosomes using their ranks calculated from the nondominated sorting algorithm.
Package details 


Author  Mehmet Hakan Satman 
Maintainer  Mehmet Hakan Satman <mhsatman@istanbul.edu.tr> 
License  GPL (>= 2) 
Version  3.0.3 
Package repository  View on CRAN 
Installation 
Install the latest version of this package by entering the following in R:

Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.