Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
482316 | European Journal of Operational Research | 2007 | 12 Pages |
Abstract
The method Promethee II has produced attractive results in the choice of the most satisfactory optimal solution of convex multiobjective problems. However, according to the current literature, it may not work properly with nonconvex problems. A modified version of this method, called multiplicative Promethee, is proposed in this paper. Both versions are applied to some analytical problems, previously optimized by an evolutionary algorithm. The multiplicative Promethee got much better results than the original Promethee II, being capable of solving convex and nonconvex problems, with continuous and discontinuous Pareto fronts.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
R.O. Parreiras, J.A. Vasconcelos,