Multi-population co-genetic algorithm with double chain-like agents structure for parallel global numerical optimization

Applied Intelligence

Volumn 32, Issue 3, 2010, Pages 292-310

  Li, Yongming ^a   Zeng, Xiaoping ^a  

^a CHONGQING UNIVERSITY   (China)

Author keywords

Agent; Chain like agent structure; Genetic algorithm; Multi population

Indexed keywords

AGENT STRUCTURE; BENCHMARK TESTS; CHAIN-LIKE; DOUBLE CHAIN; DYNAMIC NEIGHBORHOOD; MULTI POPULATION; NUMERICAL OPTIMIZATIONS; ORTHOGONAL CROSSOVER; PARALLEL OPTIMIZATION;

GENETIC ALGORITHMS; POPULATION STATISTICS;

SHAPE OPTIMIZATION;

EID: 77952010169     PISSN: 0924669X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10489-008-0146-7     Document Type: Article

References (24)

1. Goldberg DE (1989) Genetic algorithms in search optimization & machine learning. Addison-Wesley, Reading
2. Holland JH (1992) Adaptation in nature and artificial system. MIT Press, Cambridge
3. Michalewicz Z, Fogel DB (2000) How to solve it: modern heuristics. Springer, Berlin, pp. 83-234
4. J Potvin D Dube C Robillard 1966 Hybrid approach to vehicle routing using neural networks and genetic algorithm Appl Intell 6 3 241 252 10.1007/BF00126629
5. M Srinivas LM Patnaik 1994 Adaptive probabilities of crossover and mutation in genetic algorithms IEEE Trans Syst Man Cybern Part B 24 4 656 667 10.1109/21.286385
6. D-W Gong X-Y Sun X-J Guo 2002 Novel survival of the fittest genetic algorithm Control Decis 17 6 908 911
7. W Zhong J Liu M Xue L Jiao 2004 A multi-agent genetic algorithm for global numerical optimization IEEE Trans Syst Man Cybern Part B 34 2 1128 1141 10.1109/TSMCB.2003.821456
8. Zeng X-P, Li Y-M, Qin J A dynamic chain-like agent genetic algorithm for global numerical optimization and feature selection, Neurocomputing. Available online at www.sciencedirect.com
9. B Olsson 2001 Co-evolutionary search in asymmetric spaces Inf Sci 133 3-4 103 125 0981.68741 10.1016/S0020-0255(01)00080-9 (Pubitemid 32380899)
10. MA Potter KA De Jong 2000 Cooperative coevolution: an architecture for evolving coadapted subcomponents IEEE Trans Evol Comput 8 1 1 29 10.1162/106365600568086
11. Y Gao S-L Xie R-N Xu Z-H Li 2006 A multi sub-population particle swarm optimizer based on clustering Appl Res Comput 23 4 40 41
12. C-H Su T-H Hou 2008 Using multi-population intelligent genetic algorithm to find the Pareto-optimal parameters for a nano-particle milling process Expert Syst Appl 34 4 2502 2510 10.1016/j.eswa.2007.04.017 (Pubitemid 351173759)
13. YW Leung Y Wang 2001 An orthogonal genetic algorithm with quantization for global numerical optimization IEEE Trans Evol Comput 5 2 41 53 10.1109/4235.910464 (Pubitemid 32330496)
14. Pan ZJ, Kang LS (1997) An adaptive evolutionary algorithms for numerical optimization. In: X Yao, JH Kim, T Furuhashi (eds.) Simulated evolution and learning. Lecture notes in artificial intelligence. Springer, Berlin, pp 27-34
15. X Yao Y Liu G Lin 1999 Evolutionary programming made faster IEEE Trans Evol Comput 3 7 82 102
16. DH Wolpert WG Macready 1997 No free lunch theorems for optimization IEEE Trans Evol Comput 1 1 67 82 10.1109/4235.585893
17. Whitley D (1999) A Free Lunch proof for gray versus binary encodings. In: W Banzhaf, J Daida, AE Eiben, MH Garzon, V Honavar, M Jakiela, RE Smith (eds.), Proceedings of the genetic and evolutionary computation conference (GECCO'99), Orlando, FL, vol 1. Morgan Kaufmann, San Francisco, pp 726-733
18. Kimbrough SO, Koehler GJ, Lu M, Wood DH On a Feasible-Infeasible Two-Population (FI-2Pop) genetic algorithm for constrained optimization: Distance tracing and no free lunch. European J Oper Res. Available online at www.sciencedirect.com
19. Schumacher C, Vose MD, Whitley LD (2001) The No Free Lunch and description length. In: L Spector, E Goodman, A Wu, W Langdon, H-M Voigt, M Gen, S Sen, M Dorigo, S Pezeshk, M Garzon, E Burke (eds.), Proceedings of the genetic and evolutionary computation conference (GECCO 2001), San Francisco, CA. Morgan Kaufmann, San Francisco, pp 565-570
20. ZG Tu Y Lu 2004 A robust stochastic genetic algorithms (StGA) for global numerical optimization IEEE Trans Evol Comput 8 5 456 470 10.1109/TEVC.2004. 831258
21. GJ Koehler 2007 Conditions that obviate the no free lunch theorems for optimization Inf J Comput 19 2 273 279 10.1287/ijoc.1060.0194 2321915
22. C Igel M Toussaint 2003 On classes of functions for which no free lunch results hold Inf Process Lett 86 6 317 321 1162.68816 10.1016/S0020-0190(03) 00222-9 1978204
23. K Deb A Pratap S Agarwal TA Meyarivan 2002 A fast and elitist multi-objective genetic algorithm: NSGA-II IEEE Trans Evol Comput 6 2 182 197 10.1109/4235.996017 (Pubitemid 34555372)
24. Mitchell M (1996) An introduction to genetic algorithms. MIT Press, Cambridge, pp 155-181