International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 1 - Number 25 |
Year of Publication: 2010 |
Authors: K.K.Mishra, Sandeep Harit |
10.5120/460-764 |
K.K.Mishra, Sandeep Harit . A Fast Algorithm for Finding the Non Dominated Set in Multi objective Optimization. International Journal of Computer Applications. 1, 25 ( February 2010), 35-39. DOI=10.5120/460-764
The working of single objective optimization algorithm and multi objective optimization algorithm is quite different. This difference is due to number of optimal solution approached by both the algorithms. In single objective optimization problem there will be a single optimal solution, even though in multi model optimization there may be more than one solution but we are interested in only one optimal solution, where as in multi objective optimization problem, there will be many set of optimal solutions. These sets are called different non dominated front, and every non dominated front will contain a set of non dominated solutions thus there are two tasks of an ideal multi objective optimization algorithm (i) To find multiple non dominated fronts (or to identify different set of non dominated solutions). (ii) To seek for Pareto optimal solutions with a good diversity in objective and decision variable values.