Abstract

In view of the problem that Artificial Bee Colony (ABC) algorithm is liable to fall into local optimum, an improved ABC algorithm is proposed. Focusing on the selection of algorithm simulated annealing is introduced to the ABC algorithm. In this way precision and search capability of algorithm is improved. This algorithm is applied in bench test functions and its performance is analyzed and compared. Besides the array synthesis of uniform linear array is realized by this method. The simulation results show that the precision of proposed algorithm is much better than the standard ABC and it is effective and feasible in array synthesis application.

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.