ABSTRACT
In this chapter, a method to generate all non-dominated points for a tri-objective integer problem has been developed. The proposed algorithm decomposes the criterion space by some additional constraints and binary variables according to the weighted-sum objective function. In this approach, the number of constraints and binary variables compared with earlier approaches has been reduced. The proposed approach also reduces the repeat calculations by using the history of already solved sub-problems. Thus, the proposed approach has an advantage: it reduces number of sub-problems solved and hence the central processing unit (CPU) time. Computational experiments demonstrate the efficiency of the proposed algorithm.
