Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.
Digital Object Identifier (DOI) : 10.14569/IJACSA.2010.010411
Article Published in International Journal of Advanced Computer Science and Applications(IJACSA), Volume 1 Issue 4, 2010.
Abstract: Problems with multiple objectives can be solved by using Pareto optimization techniques in evolutionary multi-objective optimization algorithms. Many applications involve multiple objective functions and the Pareto front may contain a very large number of points. Selecting a solution from such a large set is potentially intractable for a decision maker. Previous approaches to this problem aimed to find a representative subset of the solution set. Clustering techniques can be used to organize and classify the solutions. Implementation of this methodology for various applications and in a decision support system is also discussed.
P.M Chaudhari, Dr. R.V. Dharaskar and Dr. V. M. Thakare, “Computing the Most Significant Solution from Pareto Front obtained in Multi-objective Evolutionary” International Journal of Advanced Computer Science and Applications(IJACSA), 1(4), 2010. http://dx.doi.org/10.14569/IJACSA.2010.010411