Splitting for Multi-objective Optimization

  • Qibin Duan
  • Dirk P. Kroese


We introduce a new multi-objective optimization (MOO) methodology based the splitting technique for rare-event simulation. The method generalizes the elite set selection of the traditional splitting framework, and uses both local and global sampling to sample in the decision space. In addition, an 𝜖-dominance method is employed to maintain good solutions. The algorithm was compared with state-of-the art MOO algorithms using a prevailing set of benchmark problems. Numerical experiments demonstrate that the new algorithm is competitive with the well-established MOO algorithms and that it can outperform the best of them in various cases.


Splitting method Multi-objective optimization Pareto front Pareto set Benchmarking Inverted generational distance 

Mathematics Subject Classification (2010)

68W20 90C29 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.



This work was supported by the Australian Research Council Centre of Excellence for Mathematical and Statistical Frontiers, under grant number CE140100049. Qibin Duan would also like to acknowledge the support from the University of Queensland through the UQ International Scholarships scheme.


  1. Akbari R, Hedayatzadeh R, Ziarati K, Hassanizadeh B (2012) A multi-objective artificial bee colony algorithm. Swarm Evol Comput 2:39–52CrossRefGoogle Scholar
  2. Botev ZI (2009) The generalized splitting method for combinatorial counting and static rare-event probability estimation. PhD thesis, The University of QueenslandGoogle Scholar
  3. Botev ZI, Kroese DP (2008) An efficient algorithm for rare-event probability estimation, combinatorial optimization, and counting. Methodol Comput Appl Probab 10(4):471–505MathSciNetCrossRefzbMATHGoogle Scholar
  4. Botev ZI, Kroese DP (2012) Efficient monte carlo simulation via the generalized splitting method. Stat Comput 1(1–16)Google Scholar
  5. Coello CAC, Lechuga MS (2002) MOPSO A proposal for multiple objective particle swarm optimization Proceedings of the IEEE congress on evolutionary computation, vol 2, pp 1051–1056Google Scholar
  6. Coello CAC, Van Veldhuizen DA, Lamont GB (2002) Evolutionary algorithms for solving multi-objective problems, vol 242. SpringerGoogle Scholar
  7. 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
  8. Duan Q, Kroese DP (2016) Splitting for optimization. Comput Oper Res 73:119–131MathSciNetCrossRefzbMATHGoogle Scholar
  9. Fonseca CM, Fleming PJ (1993) Multiobjective genetic algorithms IEE colloquium on genetic algorithms for control systems engineering. IET, pp 6–1Google Scholar
  10. Knowles J, Corne D (1999) The Pareto archived evolution strategy: A new baseline algorithm for pareto multiobjective optimisation. In: Proceedings of the IEEE congress on evolutionary computation, vol 1Google Scholar
  11. Knowles J, Corne DW (2000) Approximating the nondominated front using the Pareto archived evolution strategy. Evol Comput 8(2):149–172CrossRefGoogle Scholar
  12. Kroese DP, Taimre T, Botev ZI (2011) Handbook of Monte Carlo methods. Wiley, New YorkCrossRefzbMATHGoogle Scholar
  13. Kukkonen S, Lampinen J (2005) GDE3 The third evolution step of generalized differential evolution Proceedings of the IEEE congress on evolutionary computation, vol 1, pp 443–450Google Scholar
  14. Li H, Zhang Q (2009) Multiobjective optimization problems with complicated Pareto sets, MOEA/d and NSGA-II. IEEE Trans Evol Comput 13(2):284–302CrossRefGoogle Scholar
  15. Liu H, Li X (2009) The multiobjective evolutionary algorithm based on determined weight and sub-regional search Proceedings of the IEEE congress on evolutionary computation, pp 1928–1934Google Scholar
  16. Liu M, Zou X, Chen Y, Wu Z (2009) Performance assessment of DMOEA-DD with CEC 2009 MOEA competition test instances Proceedings of the IEEE congress on evolutionary computation, vol 1, pp 2913–2918Google Scholar
  17. Mishra S, Deb K, Mohan M (2005) Evaluating the -domination based multi-objective evolutionary algorithm for a quick computation of Pareto-optimal solutions. Evol Comput 13(4):501–526CrossRefGoogle Scholar
  18. Qiu X, Xu J, Tan KC, Abbass HA (2016) Adaptive cross-generation differential evolution operators for multiobjective optimization. IEEE Trans Evol Comput 20 (2):232–244CrossRefGoogle Scholar
  19. Rubinstein RY, Kroese DP (2017) Simulation and the Monte Carlo method, 3rd edn. WileyGoogle Scholar
  20. Tseng L, Chen C (2009) Multiple trajectory search for unconstrained/constrained multi-objective optimization Proceedings of the IEEE congress on evolutionary computation, pp 1951–1958Google Scholar
  21. Ünveren A, Acan A (2007) Multi-objective optimization with cross entropy method: Stochastic learning with clustered Pareto fronts Proceedings of the IEEE congress on evolutionary computation, pp 3065–3071Google Scholar
  22. Zhang Q, Li H (2007) MOEA/d A multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712–731CrossRefGoogle Scholar
  23. Zhang Q, Liu W, Li H (2009) The performance of a new version of MOEA/d on cec09 unconstrained MOP test instances Proceedings of the IEEE congress on evolutionary computation, vol 1, pp 203–208Google Scholar
  24. Zhang Q, Zhou A, Zhao S, Suganthan PN, Liu W, Tiwari S (2008) Multiobjective optimization test instances for the CEC, 2009 special session and competition. University of Essex, Colchester, UK and Nanyang technological University, Singapore, special session on performance assessment of multi-objective optimization algorithms, technical report, 264Google Scholar
  25. Zhou A, Qu B, Li H, Zhao S, Suganthan PN, Zhang Q (2011) Multiobjective evolutionary algorithms: a survey of the state of the art. Swarm Evol Comput 1(1):32–49CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2017

Authors and Affiliations

  1. 1.School of Mathematics and PhysicsThe University of QueenslandBrisbaneAustralia

Personalised recommendations