Abstract

This paper presents a distributed algorithm for optimization of nonconvex multimodal functions. In recent years, new distributed algorithms based on artificial life (ALife) system has been studied and its potential power has been demonstrated. In this paper, the frame work of ALife system is employed into a function minimization. We also propose a hybrid algorithm in which ALife system is incorporated with the local search method for finding good start points for the local search. Since the proposed method utilizes no gradient information it can be applied to very wide class of optimization problems. The effectiveness of the proposed method is demonstrated through some numerical tests.

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

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.