Interactive evolutionary algorithm FIEM for solving integer multiple objective problems (Q2844629)

In the paper under consideration integer multi-objective convex optimization problems are solved by developing fast interactive evolutionary algorithm (FIEM). The authors obtain a number of approximate Pareto optimal solutions at each iteration according to the Decision Maker's (DM) preferences. An illustrative example is provided in order to compare the developed in this paper algorithm with the performance of Strength Pareto Evolutionary Algorithm (SPEA) and the advantages are given: the algorithm is interactive, the step of clusterization is enriched/complemented by an arrangement according to the DM's preferences, an accelerating approaching to the Pareto front is achieved, the increasing number of objectives in the optimization problem does not have any negative influence on the algorithm performance.