Fine-grained parallel genetic algorithm: a global convergence criterion

International Journal of Computer Mathematics

Volumn 73, Issue 2, 1999, Pages 139-155

  Muhammad, A ^a,b   Bargiela, A ^a   King, G ^a  

^a SOUTHAMPTON SOLENT UNIVERSITY   (United Kingdom)

^b NOTTINGHAM TRENT UNIVERSITY   (United Kingdom)

Author keywords

Global convergence; Markov chain; Parallel model; Stochastic optimisation

Indexed keywords

CHAINS; GENETIC ALGORITHMS; MARKOV PROCESSES; RANDOM PROCESSES; SIMULATED ANNEALING; STOCHASTIC MODELS; STOCHASTIC SYSTEMS; CONVERGENCE OF NUMERICAL METHODS; MATHEMATICAL MODELS; MATHEMATICAL MORPHOLOGY; PARALLEL ALGORITHMS;

ERGODIC MARKOV CHAINS; GLOBAL CONVER-GENCE; MATHEMATICAL DIFFICULTY; PARALLEL GENETIC ALGORITHMS; PARALLEL MODELS; STATIONARY DISTRIBUTION; STOCHASTIC OPTIMISATION; TEMPERATURE PARAMETERS;

OPTIMIZATION; GENETIC ALGORITHMS;

FINE-GRAINED ALGORITHMS; TERMINATION POINT;

EID: 0033282428     PISSN: 00207160     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207169908804885     Document Type: Article

References (16)

1. Davis, T. E. (1991). A simulated annealing like convergence theory for the simple genetic algorithm, International Conference on Genetic Algorithms and Applications.
2. Kemeny, J. G. (1960). Finite Markov Chains, Springer-Verlag.
3. Lundy, M. (1986). Convergence of an annealing algorithm, Mathematical Programming, 34,111-124.
4. Manderick, B. (1989). Fine-grained parallel genetic algorithms, International Conference on Genetic Algorithms and Applications.
5. Muhammad, A., Bargiela, A. and King, G. (1997). Fine-grained genetic algorithm: A stochastic optimisation method, 1st World Congress on Computer Simulation, Singapore.
6. Muhlenbein, H. (1989). Parallel genetic algorithms, population genetics and combinatorial optimisation, International Conference on Genetic Algorithms and Applications.
7. Muhlenbein, H. (1991). The parallel genetic algorithm as function optimiser, International Conference on Genetic Algorithms and Applications.
8. Otten, R. H. J. M. (1989). The annealing algorithm, Kluwer Academic Publisher.
9. Pettey, C. C. (1989). A theoretical investigation of a parallel genetic algorithm, International Conference on Genetic Algorithms and Applications.
10. Romeo, F. (1985). Probabilistic hill climbing algorithms: properties and applications, Chapel Hill conference on VLSI.
11. Rudolph, G. (1994). Convergence analysis of canonical genetic algorithms, IEEE Transactions on Neural Networks, 5(1), 78-93.
12. Suzuki, J. (1993). A Markov chain analysis on a genetic algorithm, International Conference on Genetic Algorithms and Applications.
13. Tanese, R. (1989). Distributed genetic algorithms, International Conference on Genetic Algorithms and Applications.
14. Tomassini, M. (1993). The parallel genetic cellular automata: Application to global optimization, International Conference on Genetic Algorithms and Applications.
15. Linkens, D. and Nyongesa, H. (1995). Genetic algorithms for fuzzy control (Parts 1 and 2), lEEProc., Control Theory Applic., 142(3), 161-185.
16. Pham, D. and Karaboga, D. (1997). Genetic algorithms with variable mutation rates: application to fuzzy logic controller design, Systems and Control Engineering Journal (Proc. Inst. Mech. Eng.), 211(1), 157-167.