Improving multi-objective evolutionary algorithms using Grammatical Evolution

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@Article{BERNABERODRIGUEZ:2024:swevo,

• author = "Amin V. {Bernabe Rodriguez} and Braulio I. Alejo-Cerezo and Carlos A. {Coello Coello}",
• title = "Improving multi-objective evolutionary algorithms using Grammatical Evolution",
• journal = "Swarm and Evolutionary Computation",
• year = "2024",
• volume = "84",
• pages = "Article Number: 101434",
• keywords = "genetic algorithms, genetic programming, Grammatical evolution, Evolutionary algorithms, Multi-objective optimization",
• ISSN = "2210-6502",
• URL = "http://delta.cs.cinvestav.mx/~ccoello/journals/amin-swevo-final.pdf.gz",
• URL = "https://www.sciencedirect.com/science/article/pii/S2210650223002067",
• DOI = "doi:10.1016/j.swevo.2023.101434",
• size = "54 pages",
• abstract = "Multi-objective evolutionary algorithms (MOEAs) have become an effective choice to solve multi-objective optimization problems (MOPs). However, it is well known that Pareto dominance-based MOEAs struggle in MOPs with four or more objective functions due to a lack of selection pressure in high dimensional spaces. The main choices for dealing with such problems are decomposition-based and indicator-based MOEAs. In this work, we propose the use of Grammatical Evolution (an evolutionary computation search technique) to generate functions that can improve decomposition-based and indicator-based MOEAs. Namely, we propose a methodology to generate new scalarizing functions, which are known to have a great impact in the performance of decomposition-based MOEAs and in some indicator-based MOEAs. Additionally, we propose another methodology to generate hypervolume approximations, since the hypervolume is a popular performance indicator used not only in indicator-based MOEAs but also to assess performance of MOEAs. Using our first methodology, we generate two new scalarizing functions and provide their corresponding experimental validation to show that they exhibit a competitive behavior when compared against some well-known scalarizing functions such as ASF, PBI and the Tchebycheff scalarizing function. Using our second methodology, we produce 4 different hypervolume approximations and compare their performance against the Monte Carlo method and against two other state-of-the-art hypervolume approximations. The experimental results show that our functions exhibit a good compromise in terms of quality and execution time",

}

Genetic Programming entries for Amin V Bernabe Rodriguez Braulio I Alejo-Cerezo Carlos Artemio Coello Coello

Citations