Ghosh, Ashish and Das, Mrinal Kanti (2008) Non-dominated Rank based Sorting Genetic Algorithms. In: Fundamenta Informaticae, 83 (3). pp. 231-252.
Full text not available from this repository. (Request a copy)Abstract
In this paper a new concept of ranking among the solutions of the same front, along with elite preservation mechanism and ensuring diversity through the nearest neighbor method is proposed for multi-objective genetic algorithms. This algorithm is applied on a set of benchmark multi-objective test problems and the results are compared with that of NSGA-II (a similar algorithm). The proposed algorithm is seen to over perform the existing algorithm. More specifically, the new approach has been used to solve the deceptive multi-objective optimization problems in a better way.
| Item Type: | Journal Article |
|---|---|
| Additional Information: | Copyright of this article belongs to IOS Press. |
| Keywords: | Multi-objective optimization;evolutionary computing;genetic algorithms;Pareto optimality. |
| Department/Centre: | Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation) |
| Date Deposited: | 14 Jul 2008 |
| Last Modified: | 27 Aug 2008 13:34 |
| URI: | http://eprints.iisc.ernet.in/id/eprint/14947 |
Actions (login required)
 |
View Item |
