Selection Based Efficient Algorithm for Finding Non Dominated Set in Multi Objective Optimization (original) (raw)
Non Dominated Sets always plays vital role in solution strategies for multi objective optimization, as the appropriateness of the solution is dependent on the selection of the sets hence efficient search for the optimal solution is dependent on the Non Dominated Sets. Finding Non Dominated set from the set of solutions is very time consuming so to increase the overall performance of the solution strategy an efficient approach is highly in demand. In this paper we have proposed a Selection Based Algorithm which finds effective Non Dominated sets among the set of solutions by establishing dominance among solutions in very less time as compared to the previous approaches
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.