Abstract
Binary ant colony algorithm has good performance in the function optimization problem. However, the drawbacks that easy to fall into the local optimization still exist. Through the analysis of “best-so-far” pheromone update rule, we get the lower probability bound under this update rule. Then binary ant colony algorithm with Balanced search bias is proposed. Experiment results have shown that the improved algorithm has good globe search ability and need small iterate times.
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 callDisclaimer: 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.
