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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
