Adaptive cellular memetic algorithms

Evolutionary Computation

Volumn 17, Issue 2, 2009, Pages 231-256

  Huy, Nguyen Quang ^a   Soon, Ong Yew ^a   Hiot, Lim Meng ^b   Krasnogor, Natalio ^c  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^c UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Cellular genetic algorithm; Cellular memetic algorithm; Memetic algorithm; Parallel genetic algorithm

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; COMPARATIVE STUDY; COMPUTER SIMULATION; EVALUATION; EVOLUTION; POPULATION GENETICS; STATISTICAL MODEL; STATISTICS;

ALGORITHMS; COMPUTER SIMULATION; EVOLUTION; GENETICS, POPULATION; MODELS, GENETIC; MODELS, STATISTICAL;

EID: 66549112581     PISSN: 10636560     EISSN: 15309304     Source Type: Journal    
DOI: 10.1162/evco.2009.17.2.231     Document Type: Article

References (39)

1. Alba, E., and Dorronsoro, B. (2005). The exploration/exploitation tradeoff in dynamic cellular evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 9(2):126-142.
2. Alba, E., Dorronsoro, B., and Alfonso, H. (2005). Cellularmemetic algorithms. Journal of Computer Science & Technology, 5(4):257-263.
3. Alba, E., Giacobini, M., Tomassini, M., and Romero, S. (2002). Comparing synchronous and asynchronous cellular genetic algorithms. Parallel Problem Solving from Nature-PPSN VII, 2439:601-610.
4. Alba, E., and Troya, J. M. (2002). Improving flexibility and efficiency by adding parallelism to genetic algorithms. Statistics and Computing, 12(2):91-114.
5. Baluja, S. (1993). Structure and performance of fine-grain parallelism in genetic search. Proceedings of the Fifth International Conference on Genetic Algorithms, pp. 155-162.
6. Bradwell, R., and Brown, K. (1999). Parallel asynchronous memetic algorithms. In E. Cantu-Paz and B. Punch, (Eds.), Evolutionary Computation, pp. 157-159.
7. Burke, E., Cowling, P., De Causmaecker, P., and Berghe, G. (2001). A memetic approach to the nurse rostering problem. Applied Intelligence, 15(3):199-214.
8. Burke, E., Gustafson, S., Kendall, G., and Krasnogor, N. (2002). Advanced population diversity measures in genetic programming. In J.Merelo-Guervs, P. Adamidis, H. Beyer, J. Fernndez-Villacaas, and H. Schwefel, (Eds.), 7th International Conference on Parallel Problem Solving from Nature, volume 2439 of Springer Lecture Notes in Computer Science, pp. 341-350. Berlin: Springer.
9. Burke, E., Gustafson, S., Kendall, G., and Krasnogor, N. (2003). Is increased diversity beneficial in genetic programming? An analysis of the effects on fitness. In IEEE Congress on Evolutionary Computation, pp. 1398-1405.
10. Deb, K., and Beyer, H. (2001). Self-adaptive genetic algorithms with simulated binary crossover. Evolutionary Computation, 9(2):197-221.
11. Digalakis, J. G., andMargaritis, K. G. (2000). A performance comparison of parallel genetic andmemetic algorithms using MPI. IntRep03, University of Macedonia, Parallel Distributed Processing Laboratory, Thessaloniki, Greece.
12. Digalakis, J. G., and Margaritis, K. G. (2001). On benchmarking functions for genetic algorithms. International Journal of Computer Mathematics, 77(4):481-506.
13. Folino, G., Pizzuti, C., and Spezzano, G. (1998). Combining cellular genetic algorithms and local search for solving satisfiability problems. Tenth IEEE International Conference on Tools with Artificial Intelligence, 1998, pp. 192-198.
14. Goldberg, D., and Voessner, S. (1999). Optimizing Global-Local Search Hybrids. Urbana, 51:61801.
15. Hart, W. E. (1994). Adaptive Global Optimization with Local Search. PhD thesis, University of California, San Diego.
16. Hart, W., Krasnogor, N., and Smith, J. (2004a). Editorial introduction, special issue on memetic algorithms. Evolutionary Computation, 12(3):v-vi.
17. Hart, W., Krasnogor, N., and Smith, J., (Eds.). (2004b). Recent advances in memetic algorithms, volume 166 of Studies in Fuzzyness and Soft Computing. Berlin: Springer.
18. Hasan, S., Sarker, R., Essam, D., and Cornforth, D. (2009). Memetic algorithms for solving jobshop scheduling problems. Memetic Computing, 1(1):69-83.
19. Houck, C., Joines, J., Kay, M., and Wilson, J. (1997). Empirical investigation of the benefits of partial Lamarckianism. Evolutionary Computation, 5(1):31-60.
20. Ishibuchi, H., Yoshida, T., and Murata, T. (2003). Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Transactions on Evolutionary Computation, 7(2):204-223.
21. Kohlmorgen, U., Schmeck, H., and Haase, K. (1999). Experiences with fine-grained parallel genetic algorithms. Annals of Operations Research, 90:203-219.
22. Krasnogor, N., and Smith, J. (2005). A tutorial for competent memetic algorithms: Model, taxonomy, and design issues. IEEE Transactions on Evolutionary Computation, 9(5):474-488.
23. Krasnogor, N., and Smith, J. (2008). Memetic algorithms: The polynomial local search complexity theory perspective. Journal of Mathematical Modelling and Algorithms, 7(1):3-24.
24. Krasnogor, N., and Smith, J. (2000). A memetic algorithm with self-adaptive local search: TSP as a case study. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp. 987-994.
25. Leung, Y.W., andWang, Y. (2001). An orthogonal genetic algorithm with quantization for global numerical optimization. IEEE Transactions on Evolutionary Computation, 5(1):41-53.
26. Lim, M. H., and Xu, Y. L. (2005). Application of a hybrid genetic algorithm in supply chain management. Special Issue on Multi-Objective Evolution: Theory and Applications, International Journal of Computers, Systems, and Signals, 6(1).
27. Martin, W. N., Lienig, J., and Cohoon, J. P. (1997). Island (migration) models: Evolutionary algorithms based on punctuated equilibria. Handbook of Evolutionary Computation, 6:3.
28. Muhlenbein, H., Schomisch, M., and Born, J. (1991). The parallel genetic algorithm as a function optimizer. Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 271-278.
29. Ong, Y. S., and Keane, A. J. (2004). Meta-Lamarckian learning in memetic algorithms. IEEE Transactions on Evolutionary Computation, 8(2):99-110.
30. Ong, Y. S., Krasnogor, N., and Ishibuchi, H. (2007). Special issue on memetic algorithms. IEEE Transactions on Systems, Man and Cybernetics, Part B, 37(1):2-5.
31. Ong, Y. S., Lim, M. H., Zhu, N., and Wong, K. W. (2006). Classification of adaptive memetic algorithms: a comparative study. IEEE Transactions on Systems, Man and Cybernetics, Part B, 36(1):141-152.
32. Ong, Y., Lim, M., Neri, F., and Ishibuchi, H. (2008). Special issue on emerging trends in soft computing: Memetic algorithms. Soft Computing-A Fusion of Foundations, Methodologies and Applications, pp. 739-740.
33. Pettey, C. (1997). Diffusion (cellular) models. Handbook of Evolutionary Computation. London: IOP Publishing.
34. Spiessens, P., and Manderick, B. (1991). A massively parallel genetic algorithm: Implementation and RST analysis. Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 279-287.
35. Tang, J., Lim, M. H., and Ong, Y. S. (2006). Parallel memetic algorithm with selective local search for large scale quadratic assignment. International Journal of Innovative Computing, Information and Control, 2(6):1399-1416.
36. Tang, J., Lim, M. H., and Ong, Y. S. (2007). Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems. Soft Computing Journal, 11(9):873888.
37. Tsai, J. T., Liu, T. K., and Chou, J. H. (2004). Hybrid Taguchi-genetic algorithm for global numerical optimization. IEEE Transactions on Evolutionary Computation, 8(4):365-377.
38. Tsutsui, S., and Fujimoto, Y. (1993). Forking genetic algorithm with blocking and shrinkingmodes (fGA). Proceedings of the Fifth International Conference on Genetic Algorithms, pp. 206-215.
39. Yu, X., Tang, K., Chen, T., and Yao, X. (2009). Empirical analysis of evolutionary algorithms with immigrants schemes for dynamic optimization. Memetic Computing, 1(1):3-24.