Journal article · 2016 · Open access

Global WASF-GA: An Evolutionary Algorithm in Multiobjective Optimization to Approximate the Whole Pareto Optimal Front

Rubén Saborido, Ana Belén Mirete Ruíz, Mariano Luque

Evolutionary Computation, 25(2), 309–349 · Published 8 February 2016 · DOI 10.1162/evco_a_00175

Open PDFView at the publisherCite this paper

In brief

“Global WASF-GA: An Evolutionary Algorithm in Multiobjective Optimization to Approximate the Whole Pareto Optimal Front” is a 2016 journal article by Rubén Saborido and 2 co-authors, published in Evolutionary Computation. OpenAlex counts 76 citations as of 19 November 2026, which puts it in the top 7% of works published in 2016 by citations. It is open access under a CC BY-NC-ND licence: the full text is free to read at Repositorio Institucional de la Universidad de Málaga (University of Málaga).

Citations
76
Most cited in
2017 (12)
Field-weighted impact
8.55
References
66
Authors
3

Abstract

In this article, we propose a new evolutionary algorithm for multiobjective optimization called Global WASF-GA ( global weighting achievement scalarizing function genetic algorithm), which falls within the aggregation-based evolutionary algorithms. The main purpose of Global WASF-GA is to approximate the whole Pareto optimal front. Its fitness function is defined by an achievement scalarizing function (ASF) based on the Tchebychev distance, in which two reference points are considered (both utopian and nadir objective vectors) and the weight vector used is taken from a set of weight vectors whose inverses are well-distributed. At each iteration, all individuals are classified into different fronts. Each front is formed by the solutions with the lowest values of the ASF for the different weight vectors in the set, using the utopian vector and the nadir vector as reference points simultaneously. Varying the weight vector in the ASF while considering the utopian and the nadir vectors at the same time enables the algorithm to obtain a final set of nondominated solutions that approximate the whole Pareto optimal front. We compared Global WASF-GA to MOEA/D (different versions) and NSGA-II in two-, three-, and five-objective problems. The computational results obtained permit us to conclude that Global WASF-GA gets better performance, regarding the hypervolume metric and the epsilon indicator, than the other two algorithms in many cases, especially in three- and five-objective problems.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Saborido, R., Ruíz, A. B. M., & Luque, M. (2016). Global WASF-GA: An Evolutionary Algorithm in Multiobjective Optimization to Approximate the Whole Pareto Optimal Front. Evolutionary Computation, 25(2), 309–349. https://doi.org/10.1162/evco_a_00175

MLA 9

Saborido, Rubén, et al. “Global WASF-GA: An Evolutionary Algorithm in Multiobjective Optimization to Approximate the Whole Pareto Optimal Front.” Evolutionary Computation, vol. 25, no. 2, 2016, pp. 309–349. https://doi.org/10.1162/evco_a_00175.

Chicago

Saborido, Rubén, Ana Belén Mirete Ruíz, and Mariano Luque. 2016. “Global WASF-GA: An Evolutionary Algorithm in Multiobjective Optimization to Approximate the Whole Pareto Optimal Front.” Evolutionary Computation 25 (2): 309–349. https://doi.org/10.1162/evco_a_00175.

Harvard

Saborido, R., Ruíz, A. B. M. and Luque, M. (2016) ‘Global WASF-GA: An Evolutionary Algorithm in Multiobjective Optimization to Approximate the Whole Pareto Optimal Front’, Evolutionary Computation, 25(2), pp. 309–349. doi:10.1162/evco_a_00175.

IEEE

R. Saborido, A. B. M. Ruíz, and M. Luque, “Global WASF-GA: An Evolutionary Algorithm in Multiobjective Optimization to Approximate the Whole Pareto Optimal Front,” Evolutionary Computation, vol. 25, no. 2, pp. 309–349, 2016, doi: 10.1162/evco_a_00175.

BibTeX

@article{saborido2016global,
  title     = {{Global WASF-GA: An Evolutionary Algorithm in Multiobjective Optimization to Approximate the Whole Pareto Optimal Front}},
  author    = {Saborido, Rubén and Ruíz, Ana Belén Mirete and Luque, Mariano},
  journal   = {Evolutionary Computation},
  year      = {2016},
  volume    = {25},
  number    = {2},
  pages     = {309--349},
  doi       = {10.1162/evco_a_00175},
  url       = {https://doi.org/10.1162/evco_a_00175}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
20171212
201877
20191212
202088
202166
202244
20231010
202477
202544
202644

Its field-weighted citation impact is 8.55: it has been cited 8.55 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms

  • multi-objective optimization
  • achievement scalarizing function
  • MOEA/D
  • NSGA-II
  • hypervolume
  • epsilon indicator

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Saborido, R., Ruíz, A. B. M., & Luque, M. (2016). Global WASF-GA: An Evolutionary Algorithm in Multiobjective Optimization to Approximate the Whole Pareto Optimal Front. Evolutionary Computation, 25(2), 309–349. https://doi.org/10.1162/evco_a_00175

How many times has this paper been cited?

76 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at Repositorio Institucional de la Universidad de Málaga (University of Málaga): sign in and open the PDF from this page.

Who wrote this paper?

Rubén Saborido, Ana Belén Mirete Ruíz, Mariano Luque.

What is the DOI of this paper?

10.1162/evco_a_00175, permanently at https://doi.org/10.1162/evco_a_00175. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.