Two coding based adaptive parallel co-genetic algorithm with double agents structure

Engineering Applications of Artificial Intelligence

Volumn 23, Issue 4, 2010, Pages 526-542

  Li, Yongming ^a   Zeng, Xiaoping ^a   Han, Liang ^a   Wang, Pin ^a  

^a CHONGQING UNIVERSITY   (China)

Author keywords

Adaptability; Agent; Chain like agent structure; Feature selection; Genetic algorithm; Global numerical optimization; Multi population; Size of sub population

Indexed keywords

AGENT STRUCTURE; CHAIN-LIKE; CHAIN-LIKE AGENT STRUCTURE; GLOBAL NUMERICAL OPTIMIZATION; MULTI POPULATION; NUMERICAL OPTIMIZATIONS;

FEATURE EXTRACTION; GENETIC ALGORITHMS; POPULATION STATISTICS;

SHAPE OPTIMIZATION;

EID: 77950516223     PISSN: 09521976     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.engappai.2009.04.004     Document Type: Article

References (25)

1. Dun-wei G., Xiao-yan S., and Xi-jin G. Novel survival of the fittest genetic algorithm. Control and Decision 17 6 (2002) 908-911
2. Goldberg D.E. Genetic Algorithms in Search Optimization and Machine Learning (1989), Addison-Wesley, Reading, MA
3. Holland J.H. Adaptation in Nature and Artificial System (1992), MIT Press, Cambridge, MA
4. Igel C., and Toussaint M. On classes of functions for which no free lunch results hold. Information Processing Letters 86 6 (2003) 317-321
5. Kherallah, M., Bouri, F., Alimi, A.M., et al., 2008. On-line Arabic handwriting recognition system based on visual encoding and genetic algorithm. Engineering Applications of Artificial Intelligence. Available from: 〈www.sciencedirect.com〉.
6. Koehler G.J. Conditions that obviate the no free lunch theorems for optimization. Informs Journal on Computing 19 2 (2007) 273-279
7. Leung Y.W., and Wang Y. An orthogonal genetic algorithm with quantization for global numerical optimization. IEEE Transactions on Evolutionary Computation 5 2 (2001) 41-53
8. Michalewicz Z., and Fogel D.B. How to Solve It: Modern Heuristics (2000), Springer-Verlag, Berlin, Heidelberg pp. 83-234
9. Olsson B. Co-evolutionary search in asymmetric spaces. Information Sciences 133 3-4 (2001) 103-125
10. Pan Z.J., and Kang L.S. An adaptive evolutionary algorithms for numerical optimization in simulated evolution and learning. In: Yao X., Kim J.H., and Furuhashi T. (Eds). Lecture Notes in Artificial Intelligence (1997), Springer-Verlag, Berlin, Germany 27-34
11. Potter M.A., and De Jong K.A. Cooperative coevolution: an architecture for evolving coadapted subcomponents. IEEE Transactions on Evolutionary Computation 8 1 (2000) 1-29
12. Schumacher C., Vose M.D., and Whitley L.D. The no free lunch and description length. In: Spector L., Goodman E., Wu A., Langdon W., Voigt H.-M., Gen M., Sen S., Dorigo M., Pezeshk S., Garzon M., and Burke E. (Eds). Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2001) (2001), Morgan Kaufmann, San Francisco, CA 565-570
13. Silva H., and Fred A. Feature subspace ensembles: a parallel classifier combination scheme using feature selection. Lecture Notes in Computer Science 4472 (2007) 261-270
14. Srinivas M., and Patnaik L.M. Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Transactions on Systems, Man and Cybernetics: Part B 24 4 (1994) 656-667
15. Kimbrough, Steven Orla, Koehler, Gary J., Lu, Ming, Wood, David Harlan. On a feasible-infeasible two-population (FI-2Pop) genetic algorithm for constrained optimization: distance tracing and no free lunch. European Journal of Operational Research. Available from: www.sciencedirect.com.
16. Su C.-H., and Hou T.-H. Using multi-population intelligent genetic algorithm to find the pareto-optimal parameters for a nano-particle milling process. Expert Systems with Applications 34 4 (2008) 2502-2510
17. Tu Z.G., and Lu Y. A robust stochastic genetic algorithms (StGA) for global numerical optimization. IEEE Transactions on Evolutionary Computation 8 5 (2004) 456-470
18. Whitley D. A free lunch proof for gray versus binary encodings. In: Banzhaf W., Daida J., Eiben A.E., Garzon M.H., Honavar V., Jakiela M., and Smith R.E. (Eds). Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'99), Orlando, FL vol. 1 (1999), Morgan Kaufmann, San Francisco, CA 726-733
19. Wolpert D.H., and Macready W.G. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation 1 1 (1997) 67-82
20. Yao X., Liu Y., and Lin G. Evolutionary programming made faster. IEEE Transactions on Evolutionary Computation 3 7 (1999) 82-102
21. Ying G., Sheng-li X., Ruo-ning X., and Zhao-hui L. A multi sub-population particle swarm optimizer based on clustering. Application Research of Computers 23 4 (2006) 40-41
22. Yongming, Li, Sujuan, Zhang, Xiaoping, Zeng. Research of multi-population agent genetic algorithm for feature selection. Experts Systems with Applications. Available on line.
23. Yongming, Li, Xiaoping, Zeng. Multi-population co-genetic algorithm with double chain-like agents structure for parallel global numerical optimization. Applied Intelligence, available on line.
24. Zeng X.-P., Li Y.-M., and Qin J. A Dynamic chain-like agent genetic algorithm for global numerical optimization and feature selection. Neurocomputing 72 4 (2008) 1214-1228
25. Zhong W., Liu J., Xue M., and Jiao L. A multi-agent genetic algorithm for global numerical optimization [J]. IEEE Transactions on Systems, Man and Cybernetics 34 2 (2004) 1128-1141