Analysis of VEGA and SPEA2 using exploration and exploitation measures

Proceedings of the 5th International Conference on Bioinspired Optimization Methods and their Applications, BIOMA 2012

Volumn , Issue , 2012, Pages 97-108

  Liu, Shih Hsi ^a   Črepinšek, Matej ^b   Mernik, Marjan ^b  

^a CALIFORNIA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF MARIBOR   (Slovenia)

Author keywords

Exploitation; Exploration; Multi objective 0 1 knapsack problem

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; GENETIC ALGORITHMS; NATURAL RESOURCES EXPLORATION; OPTIMIZATION;

0/1 KNAPSACK PROBLEMS; EXPLOITATION; EXPLORATION AND EXPLOITATION; STRENGTH PARETO EVOLUTIONARY ALGORITHM; VECTOR EVALUATED GENETIC ALGORITHMS (VEGA);

EVOLUTIONARY ALGORITHMS;

EID: 84976417047     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. J. Bader and E. Zitzler. Hype: An algorithm for fast hypervolume-based manyobjectiveoptimization. Evol. Comput., 19(1):45-76, 2011.
2. M. Črepinšek, M. Mernik, and S.-H. Liu. Analysis of exploration and exploitationin evolutionary algorithms by ancestry trees. International Journal of InnovativeComputing and Applications, 3(1):11-19, 2011.
3. M. Črepinšek, S.-H. Liu, and M. Mernik. Exploration and exploitation in evolutionaryalgorithms: A survey. ACM Comput. Surv., in press.
4. Á. E. Eiben and C. Schippers. On evolutionary exploration and exploitation.Fundame. Inform., 35(1-4):35-50, 1998.
5. J. Knowles and D. Corne. Towards Landscape Analyses to Inform the Design ofHybrid Local Search for the Multiobjective Quadratic Assignment Problem. InSoft Computing Systems: Design Management, and Applications, pages 271-279,2002.
6. E. Lutton and J.-D. Fekete. Visual Analytics and Experimental Analysisof Evolutionary Algorithms. Technical Report. INRIA, 2011 (http://hal.archives-ouvertes.fr/docs/00/58/71/70/PDF/RR-7605.pdf).
7. Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs.Springer-Verlag, 1996.
8. K. Parsopoulos, D. K. Tasoulis, and M. N. Vrahatis. Multiobjective OptimizationUsing Parallel Vector Evaluated Particle Swarm Optimization. In Proce.IASTED International Conference on Artificial Intelligence and Applications,pages 823-828, 2004.
9. M. Reyes and C. Coello. Improving PSO-based Multiobjective OptimizationUsing Crowding, Mutation and e-dominance, In Evolutionary Multi-CriterionOptimization, pages 505-519, 2005.
10. J. D. Schaffer. Multiple Objective Optimization with Vector Evaluated GeneticAlgorithms. In Proc. 1st International Conference on Genetic Algorithms, pages93-100, 1985.
11. V. K. Vassilev, T. C. Fogarty, and J. F. Miller. Smoothness, Ruggedness andNeutrality of Fitness Landscapes: from Theory to Application. In A. Ghosh andS. Tsutsui, editors. Advances in Evolutionary Computing, pages 3-44. Springer,2003.
12. Q. Zhang and H. Li. MOEA/D: A multi-objective evolutionary algorithm basedon decomposition. IEEE T. Evolut. Comput., 11(6):712-731, 2007.
13. E. Zitzler and L. Thiele. Multiobjective evolutionary algorithms: A comparativecase study and the strength Pareto approach. IEEE T. Evolut. Comput.,3(4):257-271, 1999.
14. E. Zitzler, K. Deb, and L. Thiele. Comparison of Multiobjective EvolutionaryAlgorithms: Empirical Results. Evol. Comput., 8(2):173-195, 2000.
15. E. Zitzler, M. Laumanns, and L. Thiele. SPEA2: Improving the Strength ParetoEvolutionary Algorithm for Multiobjective Optimization. In Evolutionary Methodsfor Design: Optimisation and Control, pages 95-100, 2002.