A Trade-off Pareto Solution Algorithm for Multi-objective Optimization

Most optimization problems in real life are multi-objective optimization problems. The difficulity of multi-objective programming lies in the fact that the objectives are in conflict with each other and an improvement of one objective may lead to the reduction of other objectives. While achieving the global optimal in all objective at the same time is impossible. we use particle swarm optimization to improve the multi-objective patero solution and get the multi-objective trade-off patero optimal solutions. Numerical experiments show that our algorithms are effective, we can get multi-objective patero solutions set and multi-objective trade-offs patero optimal solution at the same time.

[1]  David W. Corne,et al.  Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy , 2000, Evolutionary Computation.

[2]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[3]  Kang Li-shan,et al.  A new evolutionary algorithm for function optimization , 2008, Wuhan University Journal of Natural Sciences.

[4]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[5]  Lothar Thiele,et al.  Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.