Solving Hard Multiobjective Problems with a Hybridized Method
Keywords:Particle Swarm Optimization, Multi-objective Optimization, Epsilon-constraint Method
This paper presents a hybrid method to solve hard multiobjective problems. The proposed approach adopts an epsilon-constraint method which uses a Particle Swarm Optimizer to get points near of the true Pareto front. In this approach, only few points will be generated and then, new intermediate points will be calculated using an interpolation method, to increase the among of points in the output Pareto front. The proposed approach is validated using two difficult multiobjective test problems and the results are compared with those obtained by a multiobjective evolutionary algorithm representative of the state of the art: NSGA-II.
 C. Coello Coello, G. Lamont, and D. Van Veldhuizen. Evolutionary algorithms for solving multi-objective problems. Springer, 2007. ISBN 978-0-387-33254-3.
 J. L. Cohon and D. H. Marks. A review and evaluation of multiobjective programming techniques. Water Resources Research, 11(2):208–220, 1975.
 K. Deb, A. Pratap, S. Agrawal, and T. Meyarivan. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2):182–197, 2002.
 R. Eberhart and J. Kennedy. A new optimizer using particle swarm theory. In Proceedings of the Sixth International Symposium on Micro Machine and Human Science, MHS’95, pages 39–43, Nagoya, Japan, October 1995. IEEE Press.
 J. Grobler and A. P. Engelbrecht. Hybridizing PSO and DE for improved vector evaluated multi-objective optimization. E-Commerce Technology, IEEE International Conference on, 0:1255–1262, 2009.
 Y. Y. Haimes, L. S. Lasdon, and D. A. Wismer. On a bicriterion formulation of the problems of integrated system identification and system optimization. IEEE Transaction on Systems, Man, and Cybernetics, 1(3):296–297, 1971.
 J. Horn. Multicriterion decision making. Handbook of Evolutionary Computation, 1:F1.9:1–F1.9:15, 1997.
 W. Jingxuan and W. Yuping. Multi-objective fuzzy particle swarm optimization based on elite archiving and its convergence. Journal of Systems Engineering and Electronics, 19(5):1035–1040, 2008.
 X. Lin and H. Li. Enhanced pareto particle swarm approach for multi-objective optimization of surface grinding process. 2007 Workshop on Intelligent Information Technology Applications, 2:618–623, 2008.
 C. Liu. New dynamic constrained optimization pso algorithm. In ICNC ’08: Proceedings of the 2008 Fourth International Conference on Natural Computation, pages 650–653, Washington, DC, USA, 2008. IEEE Computer Society.
 S. McKinley and M. Levine. Cubic spline interpolation. Math 45: Linear Algebra.
 K. M. Miettinen. Nonlinear Multiobjective Optimization. Kluwer Academic Publishers, 1999. Boston, Massachusetts.
 T. Okabe. Evolutionary Multi-Objective Optimization - On the Distribution of Offspring in Parameter and Fitness Space. PhD thesis, Bielefeld University, 2004.
 D. A. Van Veldhuizen and G. B. Lamont. Multiobjective evolutionary algorithm research: A history and analysis. Technical report, Dept. Elec. Comput. Eng., Graduate School of Eng., Air Force Inst. Technol, Wright-Patterson, AFB.OH, 1998. TR-98-03.
 D. A. Van Veldhuizen and G. B. Lamont. Multiobjective evolutionary algorithms: Analysing the state-of-the-art. Evolutionary Computation, 7(3):1–26, 2000.
 Y. Wang and Z. Cai. A hybrid multi-swarm particle swarm optimization to solve constrained optimization problems. Frontiers of Computer Science in China, 2009.
 Y. Wang and Y. Yang. Particle swarm optimization with preference order ranking for multi-objective optimization. Inf. Sci., 179(12):1944–1959, 2009.
 E. Zahara and C. Hu. Solving constrained optimization problems with hybrid particle swarm optimization. Engineering Optimization, 40, 2008.
 E. Zitzler, K. Deb, and L. Thiele. Comparison of the multiobjective evolutionary algorithms: Empirical results. Evolutionary Computation, 8(2):173–195, 2000.