摘要：This paper presents a method, based on the Strength Pareto Evolutionary Algorithm (SPEA), designed to solve multi-objective convex integer optimization problems. The proposed method has the aim to overcome some shortcomings of SPEA, as noted in [2]. An interaction phase with the Decision Maker (DM) is also included in the method, so that the search process can be quickly directed to the part of the search space, where the location of a desired non-dominated solution is expected. In this manner good convergence of the method is ensured.
