Abstract

Simultaneous optimization of two or more objectives is an instance of multi-objective optimization (MOO). However, for most of the Multi-Objective Problems (MOPs), no single solution can optimize all the objective functions simultaneously. Evolutionary algorithms are a type of optimization algorithm used for constructing a well-distributed optimal front more quickly than a much more efficient approach. One of the most commonly used algorithms in this regard is differential evolution (DE). To solve the problem of non-dominated sorting for Multi-Objective DE (MODE), an approach is proposed that reduces the time complexity. DE is commonly recognized as one of the best methods for solving the MOPs. Several versions of DEs have been proposed for MOPs. This article proposes a novel mutation technique, named Environmental Parameter-based Multi-Objective Differential Evolution (EP-MODE) that acquires two additional environmental parameters to preserve diversity and accelerate the convergence. The proposed approach also reduces the time complexity of non-dominated sorting for Multi-Objective DE (MODE). The proposed mutation's performance has been evaluated on DTLZ series and ZDT series benchmark test functions on the Pareto-optimal front and compared with existing multi-objective algorithms (MODE and MODE-RMO). The solution comparatively verifies that the proposed EP-MODE outperforms most of the MODEs for lower dimension functions and higher functions. HIGHLIGHTS New environmental parameters-based mutation has been introduced in a differential evolution algorithm to solve multi-objective optimization problems (EP-mode) The addition of two additional environmental parameters to EP-mode has been found to be appropriate for maintaining diversity while also accelerating the convergence rate EP-MODE evaluated on bi-objective (DTLZ series) and tri-objective (ZDT series) benchmark test functions on the Pareto-optimal front and found EP-MODE's efficiency is higher than that of the MODE algorithm and the MODE algorithm with a ranking-based mutation operator GRAPHICAL ABSTRACT

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call