Affiliations: Department Computer Science and Engineering, Motilal Nehru National Institute of Technology Allahabad, Allahabad, UP, India
Correspondence:
[*]
Corresponding author. Shailendra Pratap Singh, Department Computer Science and Engineering, Motilal Nehru National Institute of Technology Allahabad, Allahabad, UP, India. Tel.: +91 532 2271359;
E-mail: shail2007singh@gmail.com.
Abstract: Differential evolution algorithm is a very popular nature inspired algorithm and it is used for solving single objective optimization problems. Due to its high convergence rate and ability to produce diverse solutions, it has been extended to solve multiobjective optimization problems. Many versions of DE were proposed however multiobjective versions, where concept of Pareto optimality is used, are most popular. Pareto Based Differential Evolution (PBDE) is one of them. Although performance of this algorithm is very good, yet its convergence rate can be further improved by minimizing the time complexity of nondominated sorting and by improving the diversity among solutions. This has been implemented by using efficient nondominated algorithm whose time complexity is better than the previous one and a new mutation scheme is implemented in DE which can provide more diversity among solutions. The proposed variant adds one more vector named as Homeostasis mutation vector in the existing mutation vectors to provide more bandwidth for selecting effective mutant solutions. The proposed approach provides more promising solutions to guide the evolution and helps DE escaping the situation of stagnation. Performance of proposed algorithm is evaluated on twelve benchmark test functions (bi-objective and tri-objective) on Pareto-optimal front. Performance of proposed algorithm is compared with other state-of-the-art algorithms on five multiobjective evolutionary algorithms (MOEAs). The result verifies that our proposed Homeostasis mutation strategy performs better than other state-of-the-art variants.
