An evolutionary algorithm for global optimization based on level-set evolution and latin squares

IEEE Transactions on Evolutionary Computation

Volumn 11, Issue 5, 2007, Pages 579-595

  Wang, Yuping ^a   Dang, Chuangyin ^b  

^a XIDIAN UNIVERSITY   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Evolutionary algorithm (EA); Global optimization; Latin squares; Level set evolution

Indexed keywords

COMPUTER SIMULATION; GLOBAL OPTIMIZATION; MATHEMATICAL OPERATORS; MONTE CARLO METHODS;

CROSSOVER OPERATOR; LATIN AQUARES; LEVEL-SET SOLUTION; MUTATION OPERATOR;

EVOLUTIONARY ALGORITHMS;

EID: 34948900352     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2006.886802     Document Type: Article

References (36)

1. S. Lucidi and V. Piccialli, "New classes of globally convexized filled functions for global optimization," J. Global Optim., vol. 24, pp. 219-236, 2002.
2. R. P. Ge and Y. F. Qin, "Globally convexized filled functions for global optimization," Applied Mathematics and Computation, vol. 35, pp. 131-158, 1999.
3. E. M. Oblow, "Stochastic tunneling algorithm for global optimization," J. Global Optim., vol. 20, pp. 195-212, 2001.
4. J. J. Liang, A. K. Qin, P. N. Suganthan, and S. Basker, "Comprehensive learning particle swarm optimizer for global optimization of multimodel functions," IEEE Trans. Evol. Comput., vol. 10, no. 3, pp. 281-295, Jun. 2006.
5. V. K. Koumousis and C. P. Katsaras, "A saw-tooth genetic algorithm combining the effects of variable population size and reinitialization to enhance performance," IEEE Trans. Evol. Comput., vol. 10, no. 1, pp. 19-28, Feb. 2006.
6. P. C. H. Ma, K. C. C. Chan, X. Yao, and D. K. Y. Chiu, "An evolutionary clustering algorithm for gene expression microarray data analysis," IEEE Trans. Evol. Comput., vol. 10, no. 3, pp. 296-314, Jun. 2006.
7. E. Alba and B. Dorronsoro, "The exploration/exploitation tradeoff in dynamic cellular genetic algorithms," IEEE Trans. Evol. Comput., vol. 9, no. 2, pp. 126-142, Apr. 2005.
8. C. Y. Lee and X. Yao, "Evolutionary programming using mutations based on the levy probability distribution," IEEE Trans. Evol. Comput., vol. 8, no. 1, pp. 1-13, Feb. 2004.
9. A. Ratnaweera, S. K. Halgamuge, and H. C. Watson, "Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients," IEEE Trans. Evol. Comput., vol. 8, no. 3, pp. 240-255, Jun. 2004.
10. F. V. d. Bergh and A. P. Engelbrecht, "A cooperative approach to particle swarm optimization," IEEE Trans. Evol. Comput., vol. 8, no. 3, pp. 225-239, Jun. 2004.
11. Y. W. Leung and Y. P. Wang, "An orthogonal genetic algorithm with quantization for global numerical optimization," IEEE Trans. Evol. Comput., vol. 5, no. 1, pp. 41-53, Feb. 2001.
12. X. Yao, Y. Liu, and G. Lin, "Evolutionary programming made faster," IEEE Trans. Evol. Comput., vol. 3, no. 2, pp. 82-102, Jul. 1999.
13. D. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Addison-Wesley, 1989.
14. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs. Berlin, Germany: Springer-Verlag, 1994.
15. H. D. Beyer, The Theory of Evolution Strategies. Berlin, Germany: Springer-Verlag, 2001.
16. D. B. Fogel, Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. New York: IEEE Press, 1995.
17. T. Bäck, Evolutionary Algorithms in Theory and Practice. Oxford, U.K.: Oxford Univ. Press, 1996.
18. K. Gurney, An Introduction to Neural Networks. London, U.K.: UCL Press, 1997.
19. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, pp. 671-680, 1983.
20. Q. Zhang and Y. W. Leung, "Orthogonal genetic algorithm for multimedia multicast routing," IEEE Trans. Evol. Comput, vol. 3, no. 1, pp. 91-96, Apr. 1998.
21. D. G. Li and C. Smith, "A new global optimization algorithm based on Latin square theory," in Proc. IEEE Int. Conf. Evol. Program. VII May 20-22, 1996, pp. 628-630.
22. J.-T. Tsai, T.-K. Liu, and J.-H. Chou, "Hybrid Taguchi-genetic algorithm for global numerical optimization," IEEE Trans. Evol. Comput., vol. 8, no. 4, pp. 365-377, Aug. 2004.
23. Q. Zhang and H. Muehlenbein, "On the convergence of a class of estimation of distribution algorithms," IEEE Trans. Evol. Comput. vol. 8, no. 2, pp. 127-136, Apr. 2004.
24. Q. Zhang, J. Sun, E. Tsang, and J. Ford, "Hybrid estimation of distribution algorithm for global optimization," Eng. Comput., vol. 21, no. 1, pp. 91-107, 2004.
25. C. S. Hong and Z. Quan, Integral Global Optimization: Theory, Implementation and Applications. Berlin, Germany: Springer-Verlag, 1988.
26. F. T. Fang and Y. Wang, Number-Theoretic Methods in Statistics. London, U.K.: Chapman & Hall, 1994.
27. G. Rudolph, "Finite Markov chain results in evolutionary computation: A tour d'horizon," Fundamenta Informaticae, vol. 35, no. 2, pp. 67-89, 1998.
28. M. A. Stybinski and T. S. Tang, "Experiments in nonconvex optimization: Stochastic approximation and function smoothing and simulated annealing," Neural Netw., vol. 3, pp. 467-483, 1990.
29. P. Siarry, G. Berthiau, F. Durbin, and J. Haussy, "Enhanced simulated annealing for globally minimizing functions of many-continuous variables," ACM Trans. Math. Softw., vol. 23, pp. 209-228, 1997.
30. X. Yao and Y. Liu, "Fast evolution strategies," in Evolutionary Programming VI, P. J. Angeline and R. Reynolds, Eds. Berlin, Germany: Springer-Verlag, 1997, pp. 151-161.
31. J. Yen and B. Lee, "A simplex genetic algorithm hybrid," in Proc. IEEE Int. Conf. Evol. Comput., Apr. 1991, pp. 175-180.
32. J. Renders and H. Bersini, "Hybridizing genetic algorithms with hill-climbing methods for global optimization," in Proc. 1st IEEE Conf. Evol. Comput., Orlando, FL, Jun. 1994, pp. 312-317.
33. H. P. Schwefel, Evolution and Optimization Seeking. New York: Wiley, 1995.
34. P. J. Angeline, "Evolutionary optimization versus particle swarm optimization: Philosophy and performance differences," in Proc. Evolutionary Programming VII, V. W. Porto and N. Saravanan, Eds. Berlin, Germany: Springer-Verlag, 1998, pp. 601-610.
35. K. Chellapilla, "Combining mutation operators in evolutionary programming," IEEE Trans. Evol. Comput., vol. 2, no. 3, pp. 91-96, Sep. 1998.
36. M. J. D. Powell, "On trust region methods for unconstrained optimization without derivatives," Dept. Appl. Math. Theoretical Phys., Univ. Cambridge, Cambridge, U.K., Work Rep. DAMTP 2002/NA02, 2002.