mcga (Q36097)

From MaRDI portal
Machine Coded Genetic Algorithms for Real-Valued Optimization Problems
Language Label Description Also known as
English
mcga
Machine Coded Genetic Algorithms for Real-Valued Optimization Problems

    Statements

    0 references
    0 references
    3.0.3
    13 May 2018
    0 references
    1.0
    13 December 2010
    0 references
    1.1
    23 December 2010
    0 references
    1.2.1
    11 January 2011
    0 references
    1.2
    11 January 2011
    0 references
    2.0.1
    25 June 2011
    0 references
    2.0.2
    17 October 2011
    0 references
    2.0.3
    6 January 2012
    0 references
    2.0.4
    6 January 2012
    0 references
    2.0.5
    9 January 2012
    0 references
    2.0.6
    31 October 2012
    0 references
    2.0.7
    4 April 2013
    0 references
    2.0.9
    25 March 2014
    0 references
    2.0
    21 June 2011
    0 references
    3.0.1
    12 May 2016
    0 references
    3.0.6
    20 August 2023
    0 references
    3.0
    25 March 2016
    0 references
    3.0.7
    27 November 2023
    0 references
    0 references
    0 references
    27 November 2023
    0 references
    Machine coded genetic algorithm (MCGA) is a fast tool for real-valued optimization problems. It uses the byte representation of variables rather than real-values. 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 encoding-decoding process and the classical operators are directly applicable on real-values. It is fast and can handle a wide range of a search space with high precision. Using a 256-unary 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 non-dominated sorting algorithm.
    0 references
    0 references
    0 references