A Multiobjective Genetic Algorithm for the Localization of Optimal and Nearly Optimal Solutions Which Are Potentially Useful: nevMOGA. (2nd October 2018)

• Record Type: Journal Article
• Authors: Pajares, Alberto; Blasco, Xavier; Herrero, Juan M.; Reynoso-Meza, Gilberto
• Other Names: Caldarelli Guido Academic Editor.
• Is Part Of: Complexity. Volume 2018(2018)
• Publication Date: 2018-10-02
• Subjects: Chaotic behavior in systems -- Periodicals; Complexity (Philosophy) -- Periodicals; 003
• DOI: 10.1155/2018/1792420
• Languages: English
• ISSNs: 1076-2787

Abstract

Abstract : Traditionally, in a multiobjective optimization problem, the aim is to find the set of optimal solutions, the Pareto front, which provides the decision-maker with a better understanding of the problem. This results in a more knowledgeable decision. However, multimodal solutions and nearly optimal solutions are ignored, although their consideration may be useful for the decision-maker. In particular, there are some of these solutions which we consider specially interesting, namely, the ones that have distinct characteristics from those which dominate them (i.e., the solutions that are not dominated in their neighborhood). We call these solutions potentially useful solutions. In this work, a new genetic algorithm called nevMOGA is presented, which provides not only the optimal solutions but also the multimodal and nearly optimal solutions nondominated in their neighborhood. This means that nevMOGA is able to supply additional and potentially useful solutions for the decision-making stage. This is its main advantage. In order to assess its performance, nevMOGA is tested on two benchmarks and compared with two other optimization algorithms (random and exhaustive searches). Finally, as an example of application, nevMOGA is used in an engineering problem to optimally adjust the parameters of two PI controllers that operate a plant.