A Multi-objective Optimization Algorithm Based on Preference Three-Way Decomposition

摘要

Most of refining processes were optimized using single objective approach, but practically such complex processes must be optimized with several objectives. Inspired by the theory of three-way decisions, a multi-objective optimization algorithm based on preference three-way decomposition is proposed in this paper. First, according to the preferences of the DM, the analytic hierarchy process (AHP) is used to sort objectives. Then, based on the idea of three-way decisions, these objectives are divided into three sub-parts as the primary objective set, the secondary objective set and the general objective set. Besides, a multi-group parallel optimization algorithm is presented to solve each sub-optimization problem. Finally, based on Non-dominated set of the three sub-problems, a set of external preservation sets are formed so as to get the optimal set that the DM is interested in. Experimental results show that the proposed method can reduce the workload of the DM and obtain more accurately converge to the optimal frontiers of the optimization problems.