Skip to main content
SpringerLink
Log in

S-Metric-Based Multi-objective Fireworks Algorithm

  • Chapter
  • First Online:
Fireworks Algorithm

Abstract

This chapter is to present how to apply FWA to solving multi-objective optimization problems with the help of a hypervolume indicator such as S-metric, then proposes a S-metric multi-objective fireworks algorithm (S-MOFWA). The S-metric is a frequently used quality measure for solution sets comparison in evolutionary multi-objective optimization algorithms (EMOAs) , which is also used to evaluate the contribution of a single solution among the solution sets. Traditional multi-objective optimization algorithms usually perform a \((\mu + 1)\) strategy and update the external archive one by one, while the proposed S-MOFWA performs a \((\mu + \mu )\) strategy, thus converging faster to a set of Pareto solutions by three steps: (1) Exploring the solution space by mimicking the explosion of fireworks; (2) Performing a simple selection strategy for choosing the next generation of fireworks according to their S-metric; (3) Utilizing an external archive to maintain the best solution set ever found, with a new archive definition and a novel updating strategy, which can update the archive with \(\mu \) solutions in a single process. The detailed comparison results with NSGA-II, SPEA2, and PESA2 demonstrate the efficiency of the proposed S-MOFWA .

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    jmetal: http://sourceforge.net/projects/jmetal/.

References

  1. K. Deb, Multi-objective Optimization Using Evolutionary Algorithms, vol. 16 (Wiley, Chichester, 2001)

    MATH  Google Scholar 

  2. E.J. Hughes, MSOPS-II: A general-purpose many-objective optimiser, in IEEE Congress on Evolutionary Computation, CEC 2007 (IEEE, 2007), pp. 3944–3951

    Google Scholar 

  3. E.J. Hughes, Multiple single objective pareto sampling, in The 2003 Congress on Evolutionary Computation, CEC’03. vol. 4 (IEEE, 2003), pp. 2678–2684

    Google Scholar 

  4. K. Deb, A. Pratap, S. Agarwal, T.A.M.T. Meyarivan, A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)

    Article  Google Scholar 

  5. E. Zitzler, M. Laumanns, L. Thiele, SPEA2: Improving the strength pareto evolutionary algorithm (2001)

    Google Scholar 

  6. E. Zitzler, S. Knzli, Indicator-based selection in multiobjective search. Parallel Problem Solving from Nature-PPSN VIII (Springer, Berlin, 2004), pp. 832–842

    Google Scholar 

  7. E. Zitzler, L. Thiele, Multiobjective optimization using evolutionary algorithms: comparative case study, in Parallel Problem Solving from Nature, PPSN V (Springer, Berlin, 1998), pp. 292–301

    Google Scholar 

  8. N. Beume, C.M. Fonseca, M. López-Ibáñez, L. Paquete, J. Vahrenhold, On the complexity of computing the hypervolume indicator. IEEE Trans. Evol. Comput. 13(5), 1075–1082 (2009)

    Article  Google Scholar 

  9. J. Knowles, D. Corne, Properties of an adaptive archiving algorithm for storing nondominated vectors. IEEE Trans. Evol. Comput. 7(2), 100–116 (2003)

    Article  Google Scholar 

  10. L. Lang, Z. Shaoqiu, T. Ying, S-metric based multi-objective fireworks algorithm, in The 2015 IEEE Congress on Evolutionary Computation, vol. 2 (IEEE, 2015), pp. 1257–1264

    Google Scholar 

  11. M. Emmerich, N. Beume, B. Naujoks, An emo algorithm using the hypervolume measure as selection criterion. Evolutionary Multi-criterion Optimization (Springer, Berlin, 2005), pp. 62–76

    Google Scholar 

  12. S. Zheng, A. Janecek, Y. Tan, Enhanced fireworks algorithm, in 2013 IEEE Congress on Evolutionary Computation (CEC) (IEEE, 2013), pp. 2069–2077

    Google Scholar 

  13. Y. Tan, Y. Zhu, Fireworks algorithm for optimization, in Advances in Swarm Intelligence (Springer, Berlin, 2010), pp. 355–364

    Google Scholar 

  14. H. Gazit, New upper bounds in Klee’s measure problem. SIAM J. Comput. 20(6), 1034–1045 (1991)

    Article  MathSciNet  Google Scholar 

  15. B. Naujoks, N. Beume, M. Emmerich, Multi-objective optimisation using s-metric selection: application to three-dimensional solution spaces, in The 2005 IEEE Congress on Evolutionary Computation, vol. 2 (2005) pp. 1282–1289

    Google Scholar 

  16. M. Fleischer, The measure of pareto optima applications to multi-objective metaheuristics, Evolutionary Multi-criterion Optimization (Springer, New York, 2003), pp. 519–533

    Chapter  Google Scholar 

  17. J.D. Knowles, Local-search and hybrid evolutionary algorithms for Pareto optimization. Ph.D. thesis, University of Reading (2002)

    Google Scholar 

  18. E. Zitzler, Hypervolume metric calculation, Computer Engineering and Networks Laboratory (TIK) (Zürich, 2001)

    Google Scholar 

  19. L. While, P. Hingston, L. Barone, S. Huband, A faster algorithm for calculating hypervolume. IEEE Trans. Evol. Comput. 10(1), 29–38 (2006)

    Article  Google Scholar 

  20. N. Beume, B. Naujoks, M. Emmerich, SMS-EMOA: multiobjective selection based on dominated hypervolume. Eur. J. Oper. Res. 181(3), 1653–1669 (2007)

    Article  MATH  Google Scholar 

  21. I.C. Garcia, C.A. Coello Coello, A. Arias-Montano, MOPSHOhv: a new hypervolume-based multi-objective particle swarm optimizer, in 2014 IEEE Congress on Evolutionary Computation (CEC) (IEEE, 2014), pp. 266–273

    Google Scholar 

  22. W. Ponweiser, T. Wagner, D. Biermann, M. Vincze, Multiobjective optimization on a limited budget of evaluations using model-assisted \(S\)-metric selection. Parallel Problem Solving from Nature–PPSN X (Springer, 2008), pp. 784–794

    Google Scholar 

  23. N. Beume, G. Rudolph, Faster S-metric calculation by considering dominated hypervolume as Klee S measure problem (2006)

    Google Scholar 

  24. S. Kukkonen, K. Deb, Improved pruning of non-dominated solutions based on crowding distance for bi-objective optimization problems, in Proceedings of the World Congress on Computational Intelligence (WCCI-2006) (IEEE Press, Vancouver, 2006), pp. 1179–1186

    Google Scholar 

  25. D.A. Van Veldhuizen, Multiobjective evolutionary algorithms: classifications, analyses, and new innovations. Technical report, DTIC Document (1999)

    Google Scholar 

  26. E. Zitzler, K. Deb, L. Thiele, Comparison of multiobjective evolutionary algorithms: empirical results. Evol. Comput. 8(2), 173–195 (2000)

    Article  Google Scholar 

  27. K. Deb, M. Mohan, S. Mishra, A fast multi-objective evolutionary algorithm for finding well-spread pareto-optimal solutions. KanGAL report 2003002 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Peking University, Beijing, China

    Ying Tan

Authors
  1. Ying Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ying Tan .

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Tan, Y. (2015). S-Metric-Based Multi-objective Fireworks Algorithm. In: Fireworks Algorithm. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-46353-6_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-46353-6_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-46352-9

  • Online ISBN: 978-3-662-46353-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation