Skip to main content

An Improvement Study of the Decomposition-Based Algorithm Global WASF-GA for Evolutionary Multiobjective Optimization

  • Conference paper
  • First Online:
Advances in Artificial Intelligence (CAEPIA 2018)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11160))

Included in the following conference series:

Abstract

The convergence and the diversity of the decomposition-based evolutionary algorithm Global WASF-GA (GWASF-GA) relies on a set of weight vectors that determine the search directions for new non-dominated solutions in the objective space. Although using weight vectors whose search directions are widely distributed may lead to a well-diversified approximation of the Pareto front (PF), this may not be enough to obtain a good approximation for complicated PFs (discontinuous, non-convex, etc.). Thus, we propose to dynamically adjust the weight vectors once GWASF-GA has been run for a certain number of generations. This adjustment is aimed at re-calculating some of the weight vectors, so that search directions pointing to overcrowded regions of the PF are redirected toward parts with a lack of solutions that may be hard to be approximated. We test different parameters settings of the dynamic adjustment in optimization problems with three, five, and six objectives, concluding that GWASF-GA performs better when adjusting the weight vectors dynamically than without applying the adjustment.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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.

    These values reported the best results after performing several initial tests. The results are not included due to space limitations, but they are available upon request.

  2. 2.

    https://research.cs.wisc.edu/htcondor/index.html.

  3. 3.

    https://github.com/rsain/Pareto-fronts-generation.

  4. 4.

    We use the wilcox.test function from the R software available at https://stat.ethz.ch/R-manual/R-devel/library/stats/html/wilcox.test.html.

References

  1. Coello, C.A.C., Lamont, G.B., Veldhuizen, D.A.V.: Evolutionary Algorithms for Solving Multi-Objective Problems, 2nd edn. Springer, New York (2007). https://doi.org/10.1007/978-1-4757-5184-0

    Book  MATH  Google Scholar 

  2. Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable multi-objective optimization test problems. In: Congress on Evolutionary Computation, pp. 825–830 (2002)

    Google Scholar 

  3. Huband, S., Hingston, P., Barone, L., While, L.: A review of multi-objective test problems and a scalable test problem toolkit. IEEE Trans. Evol. Comput. 10(5), 477–506 (2007)

    Article  Google Scholar 

  4. Li, H., Zhang, Q.: Multiobjective optimization problems with complicated Pareto sets, MOEA/D and NSGA-II. IEEE Trans. Evol. Comput. 12(2), 284–302 (2009)

    Article  Google Scholar 

  5. Nebro, A.J., Durillo, J.J., Vergne, M.: Redesigning the jMetal multi-objective optimization framework. In: Conference on Genetic and Evolutionary Computation, pp. 1093–1100 (2015)

    Google Scholar 

  6. Saborido, R., Ruiz, A.B., Luque, M.: Global WASF-GA: an evolutionary algorithm in multiobjective optimization to approximate the whole Pareto optimal front. Evol. Comput. 25(2), 309–349 (2017)

    Article  Google Scholar 

  7. Wierzbicki, A.P.: The use of reference objectives in multiobjective optimization. In: Fandel, G., Gal, T. (eds.) Multiple Criteria Decision Making, Theory and Applications, pp. 468–486. Springer, Heidelberg (1980). https://doi.org/10.1007/978-3-642-48782-8_32

    Chapter  Google Scholar 

  8. Wilcoxon, F.: Individual comparisons by ranking methods. Biom. Bull. 1(6), 80–83 (1945)

    Article  Google Scholar 

  9. Zhang, Q., Zhou, A., Zhao, S., Suganthan, P.N., Liu, W., Tiwari, S.: Multiobjective optimization test instances for the CEC 2009 special session and competition. Technical report (CES-487, University of Essex and Nanyang Technological University) (2008)

    Google Scholar 

  10. Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans. Evol. Comput. 3(4), 257–271 (1999)

    Article  Google Scholar 

Download references

Acknowledgements

This research is funded by the Spanish government (ECO2017-88883-R and ECO2017-90573-REDT) and by the Andalusian regional government (SEJ-532). Sandra González-Gallardo has a technical research contract within “Sistema Nacional de Garantía Juvenil y del Programa Operativo de Empleo Juvenil 2014-2020 - Fondos FEDER”, and thanks the University of Málaga PhD Programme in Economy and Business. Rubén Saborido is a post-doctoral fellow at Concordia University (Canada). Ana B. Ruiz thanks the post-doctoral fellowship “Captación de Talento para la Investigación” of the University of Málaga.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rubén Saborido .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

González-Gallardo, S., Saborido, R., Ruiz, A.B., Luque, M. (2018). An Improvement Study of the Decomposition-Based Algorithm Global WASF-GA for Evolutionary Multiobjective Optimization. In: Herrera, F., et al. Advances in Artificial Intelligence. CAEPIA 2018. Lecture Notes in Computer Science(), vol 11160. Springer, Cham. https://doi.org/10.1007/978-3-030-00374-6_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-00374-6_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-00373-9

  • Online ISBN: 978-3-030-00374-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics