Focused on the issue that the Sine Cosine Algorithm is trapped in the local minima due to premature convergence in complex nonlinear optimization problems, an improved Sine Cosine Algorithm based on Levy flight was proposed. The algorithm combines the current rank of individual fitness and its historical fitness value to mark the individuals which may fall into local minimums. The marked individuals update their position by using the variable parameters Levy flight, which enhances the algorithm’s global searching ability in the exploration period and the local searching ability in the exploitation period. Five benchmark functions are used to test the performance of the algorithm. The theoretical analysis and simulation results show that the proposed algorithm performs well in the complex nonlinear optimization problem
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.