Abstract
Differential evolution (DE) is an evolutionary optimization technique that is exceptionally simple, fast, and robust at numerical optimization. However, the convergence rate of DE in optimizing a computationally expensive objective function still does not meet our requirements, and an attempt to speed up DE is considered necessary. This article introduces a modified differential evolution (MDE) that enhances the convergence rate without compromising the robustness. MDE algorithm utilizes only one set of population array as against two sets in original DE at any given generation. This modification improves the convergence rate of DE and at the same time maintains the robustness. The performance of MDE is evaluated on two benchmark test functions followed by nonlinear chemical processes. The simulation results show empirical evidences on the efficiency and effectiveness of the proposed MDE.
Sign-in/Register to access full text options 
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 callMore From: Journal of Experimental & Theoretical Artificial Intelligence
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
