Interactive Evolutionary Algorithms with Decision-Maker’s Preferences for Solving Interval Multi-objective Optimization Problems
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.
KeywordsMulti-objective optimization Evolutionary algorithm Interval Decision-maker’s preferences Relative importance
Unable to display preview. Download preview PDF.
- 1.Gong, D.W., Qin, N.N., Sun, X.Y.: Evolutionary Algorithms for Multi-objective Optimization Problems with Interval Parameters. In: 5th IEEE International Conference on Bio-Inspired Computing: Theories and Applications, pp. 411–420 (2010)Google Scholar
- 6.Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable Test Problems for Evolutionary Multiobjective Optimization. In: Abraham, A., Jain, L., Goldberg, R. (eds.) Evolution-ary Mul-tiobjective Optimization: Theoretical Advances and Applications, pp. 105–145. Springer, New York (2005)Google Scholar