A numerical method for constructing the Pareto front of multi-objective optimization problems

• Autores: Esmaile Khorram, K. Khaledian, M. Khaledyan
• Localización: Journal of computational and applied mathematics, ISSN 0377-0427, Vol. 261, Nº 1, 2014, págs. 158-171
• Idioma: inglés
• DOI: 10.1016/j.cam.2013.11.007
• Texto completo no disponible (Saber más ...)
• Resumen

  • In this paper, a new numerical method is presented for constructing an approximation of the Pareto front of multi-objective optimization problems. This method is based on the well-known scalarization approach by Pascoletti and Serafini. The proposed method is applied to four test problems that illustrate specific difficulties encountered in multiobjective optimization problems, such as nonconvex, disjoint and local Pareto fronts. The effectiveness of the proposed method is demonstrated by comparing it with the NSGA-II algorithm and the Normal Constraint method.