Abstract
Interval multi-objective optimization problems (MOPs) are popular and important in real-world applications. We present a novel interactive evolutionary algorithm (IEA) incorporating an optimization-cum-decision-making procedure to obtain the most preferred solution that fits a decision-maker (DM)'s preferences. Our method is applied to two interval MOPs and compared with PPIMOEA and the posteriori method, and the experimental results confirm the superiorities of our method. © 2011 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Sun, J., Gong, D., & Sun, X. (2011). Optimizing interval multi-objective problems using IEAs with preference direction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7063 LNCS, pp. 445–452). https://doi.org/10.1007/978-3-642-24958-7_52
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
