A Markov Chain analysis of genetic algorithms with power of 2 cardinality alphabets-Reference-Cited by-同舟云学术

A Markov Chain analysis of genetic algorithms with power of 2 cardinality alphabets

Published:1997-01 Issue:1 Volume:96 Page:195-201
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Aytug Haldun,Bhattacharrya Siddartha,Koehler Gary J.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference16 articles.

1. Stopping criteria for finite length genetic algorithms;Aytug;ORSA Journal on Computing,1994

2. An analysis of non-binary genetic algorithms with cardinality 2x;Bhattacharrya,1994

3. Toward an extrapolation of the simulated annealing convergence theory onto the simple genetic algorithm;Davis,1991

4. Real-coded genetic algorithms and interval schemata;Eschelman,1992

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Addressing Optimisation Challenges for Datasets with Many Variables, Using Genetic Algorithms to Implement Feature Selection;AI, Computer Science and Robotics Technology;2022-03-28

2. Genetic Algorithms;Nature-Inspired Optimization Algorithms;2021

3. Nature-inspired optimization algorithms: Challenges and open problems;Journal of Computational Science;2020-10

4. Mathematical framework for algorithm analysis;Nature-Inspired Computation and Swarm Intelligence;2020

5. Global Convergence Analysis of the Flower Pollination Algorithm: A Discrete-Time Markov Chain Approach;Procedia Computer Science;2017