Objective weight computation based on personal preference for multi- objective optimization problem

For the problem that how to compute the objective weight based on personal preference during multi-objective optimization process, a method which decides the objective weights by solving a constrained optimization problem is proposed. Firstly, by using this method, the objective weight computation problem is transformed into a synthetical fitness optimization problem according to the statistics theory. Then the personal preference is transformed into the constrain condition of the synthetical fitness optimization problem. Finally, the gradient projection method is used to solve the constrained synthetical fitness optimization problem to get optimum objective weights. The proposed method is used to compute the objective weight of economical efficiency and safety during the electric locomotive repair strategy decision process, and the test result shows that the proposed method can get the optimum objective weight under the constraint of personal preference.

[1]  Eun-Soo Kim,et al.  Preference-Based Solution Selection Algorithm for Evolutionary Multiobjective Optimization , 2012, IEEE Transactions on Evolutionary Computation.

[2]  Qiu Fei.  Many-Objective Evolutionary Algorithm Based on Bipolar Preferences Dominance , 2013 .

[3]  Tan Yue-jin.  Research on multi-objective imaging satellites scheduling techniques based on fuzzy preferences , 2008 .

[4]  Ki-Baek Lee,et al.  Improved version of a multiobjective quantum-inspired evolutionary algorithm with preference-based selection , 2012, 2012 IEEE Congress on Evolutionary Computation.

[5]  L. Zanni,et al.  Accelerating gradient projection methods for ℓ1-constrained signal recovery by steplength selection rules , 2009 .

[6]  Carlos A. Coello Coello,et al.  Evolutionary multi-objective optimization: a historical view of the field , 2006, IEEE Comput. Intell. Mag..

[7]  Wang Rui.  The Evolutionary Multi-Objective Optimization Algorithm with Maximization of Personal Preference , 2010 .

[8]  Yang Dong.  Clone Selection Algorithm to Solve Preference Multi-Objective Optimization , 2010 .

[9]  Lily Rachmawati,et al.  Multiobjective Evolutionary Algorithm With Controllable Focus on the Knees of the Pareto Front , 2009, IEEE Transactions on Evolutionary Computation.

[10]  Dmitry Podkopaev,et al.  Interactive Multiple Criteria Decision Making based on preference driven Evolutionary Multiobjective Optimization with controllable accuracy , 2012, Eur. J. Oper. Res..

[11]  Ki-Baek Lee,et al.  Multi-objective particle swarm optimization with preference-based sorting , 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).

[12]  Qian Qing-quan.  Study on multiobjective particle swarm optimization algorithm based on preference , 2009 .

[13]  Nicholas I. M. Gould,et al.  A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds , 1997, Math. Comput..