Multi-objective optimization problems (MOPs) with interval parameters are considerably popular and important in real-world applications. A novel evolutionary algorithm incorporating with a decision-maker (DM)'s preferences is presented to obtain their Pareto subsets which meet the DM's preferences in this study. The proposed algorithm is applied to four MOPs with interval parameters and compared with other two algorithms. The experimental results confirm the advantages of the proposed algorithm. © 2012 Springer-Verlag.
CITATION STYLE
Gong, D., Ji, X., Sun, J., & Sun, X. (2012). Interactive evolutionary algorithms with decision-maker’s preferences for solving interval multi-objective optimization problems. In Communications in Computer and Information Science (Vol. 304 CCIS, pp. 23–29). https://doi.org/10.1007/978-3-642-31837-5_4
Mendeley helps you to discover research relevant for your work.