A Simplex-Crossover-Based Multi-Objective Evolutionary Algorithm

Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 247)


The key issue for an efficient and reliable multi-objective evolutionary algorithm is the ability to converge to the True Pareto Front with the least number of objective function evaluations, while covering it as much as possible. To this purpose, in a previous paper performance comparisons showed that the Genetic Diversity Evolutionary Algorithm (GeDEA) was at the same level of the best state-of-the-art MOEAs due to it intrinsic ability to properly conjugate exploitation of current non-dominated solutions and the exploration of the search space. In this paper, an improved version, namely the GeDEA-II, is proposed which features a novel crossover operator, the Simplex-Crossover, and a novel mutation operator, the Shrink-Mutation. GeDEM operator was left unchanged and completed using the non-dominated-sorting based on crowding distance. The comparison among GeDEA-II and GeDEA, as well as with three other modern elitist methods, on different extremely multidimensional test problems, clearly indicates that the performance of GeDEA-II is, at least in these cases, superior. In addition, authors aimed at putting in evidence the very good performance of GeDEA-II even in extremely multidimensional landscapes. To do this, four test problems were considered, and the GeDEA-II performance tested as the number of decision variables was increased. In particular, ZDT test functions featured a number of decision variables ranging from the original proposed number up to 1,000, whereas on DTLZ the decision variables were increased up to 100 times the original proposed number. Results obtained contribute to demonstrate further the GeDEA-II breakthrough performance.


Empirical–comparison Evolutionary algorithms Genetic diversity Multi objective optimization Pareto optimality Simplex crossover Shrink mutation 


  1. 1.
    Bhusan Agrawal R, Deb K (1994) Simulated binary crossover for continuous search space. Complex Sys 9:115–148Google Scholar
  2. 2.
    Bäck T (1996) Evolutionary Algorithms in Theory and Practice. Oxford University Press, OxfordMATHGoogle Scholar
  3. 3.
    Bäck T, Schwefel H-P (1993) An overview of evolutionary algorithms for parameter optimization. Evol Comput 1(1):1–23CrossRefGoogle Scholar
  4. 4.
    Bleuler S, Laumanns M, Thiele L, Zitzler E (2002) PISA–a platform and programming language independent interface for search algorithms. Springer, NYGoogle Scholar
  5. 5.
    Coello Coello CA, Van Veldhuizen DA, Lamont GB (2002) Evolutionary algorithms for solving multi-objective problems. Kluwer Academic Publishers, New YorkCrossRefMATHGoogle Scholar
  6. 6.
    Comis Da Ronco C, Benini E (2012) Gedea-II: a novel evolutionary algorithm for multi-objective optimization problems based on the simplex crossover and the shrink mutation. In: Lecture notes in engineering and computer science: proceedings of the world congress on engineering and computer science (2012) WCECS 2012, 24–26 Oct 2012. USA, San Francisco, pp 1298–1303Google Scholar
  7. 7.
    Deb K (1999) Multi-objective genetic algorithms: problem difficulties and construction of test problems. Evol Comput 7(3):205–230CrossRefGoogle Scholar
  8. 8.
    Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197CrossRefGoogle Scholar
  9. 9.
    Deb K, Thiele L, Laumanns M, Zitzler E (2001) Scalable test problems for evolutionary multi-objective optimization. Computer Engineering and Networks Laboratory (TIK), TIK-Technical Report No. 112, Swiss Federal Institute of TechnologyGoogle Scholar
  10. 10.
    Fogel DB (1995) Evolutionary computation: toward a new philosophy of machine intelligence. IEEE Press, Piscataway, NJGoogle Scholar
  11. 11.
    Fonseca CM, Paquete L, López-Ibáñez M (2006) An improved dimension-sweep algorithm for the hypervolume indicator. In: IEEE congress on evolutionary computation, pp 1157–1163Google Scholar
  12. 12.
    Ghiasi Hossein, Pasini Damiano, Lessard Larry (2011) A non-dominated sorting hybrid algorithm for multi-objective optimization of engineering problems. Eng Optim 43(1):39–59CrossRefGoogle Scholar
  13. 13.
    Koduru P, Dong Z, Das S, Welch S, Roe JL, Charbit E (2008) A multiobjective evolutionary-simplex hybrid approach for the optimization of differential equation models of gene networks. IEEE Trans Evol Comput 12(5):572–590Google Scholar
  14. 14.
    Laumanns M, Zitzler E, Thiele L (2001) On the effects of archiving, elitism, and density based selection in evolutionary multi-objective optimization. In: Proceedings of the first international conference on evolutionary multi-criterion optimization, Springer-Verlag, London, UK, pp 181–196Google Scholar
  15. 15.
    Nelder JM, Mead R (1965) A simplex method for function minimization. Comput J 7(4):308–313CrossRefMATHGoogle Scholar
  16. 16.
    Toffolo A, Benini E (2002) Genetic diversity as an objective in multi-objective evolutionary algorithms. Evol Comput 11(2):151–157CrossRefGoogle Scholar
  17. 17.
    Tsutsui S, Yamamura M, Higuchi T (1999) Multi-parent recombination with simplex crossover in real coded genetic algorithms. In: Proceedings of the GECCO-99, pp 657–644Google Scholar
  18. 18.
    Zitzler E, Deb K, Thiele L (2000) Comparison of multiobjective evolutionary algorithms: empirical results. Evol Comput 8(2):173–195CrossRefGoogle Scholar
  19. 19.
    Zitzler E, Künzli S et al (2004) Indicator-based selection in multiobjective search. In: Yao X (ed) Parallel problem solving from nature (PPSN VIII). Springer-Verlag, Berlin, Germany, pp 832–842Google Scholar
  20. 20.
    Zitzler E, Laumanns M, Thiele L (2001) SPEA2: improving the strength pareto evolutionary algorithm. In: Technical report 103, computer engineering and networks laboratory (TIK), Swiss Federal Institute of Technology (ETH) Zurich, Gloriastrasse 35, CH-8092 Zurich, Switzerland, May 2001Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2014

Authors and Affiliations

  1. 1.HIT09 S.r.lPadovaItaly
  2. 2.Department of Industrial EngineeringUniversity of PadovaPadovaItaly

Personalised recommendations