A study on bacterial colony chemotaxis algorithm and simulation based on differential strategy Online publication date: Thu, 01-Apr-2010
by Z. Wang, L. Zhang, Y. Fan
International Journal of Modelling, Identification and Control (IJMIC), Vol. 9, No. 1/2, 2010
Abstract: Bacterial colony chemotaxis (BCC) algorithm is one of the new heuristic algorithms based on colony intelligence. The algorithm much improves the convergence speed of bacterial colony (BC) algorithm while possessing the strong searching ability of a single bacterium. To further enhance the ability of breaking away from the local optimum on multimodal function, two improvements are presented, one is adjusting the sense limit (SL) self-adaptively and the other is introducing differential evolutionary strategy into algorithm. Large amounts of numerical experiments simulation show that the performances of the improved BCC algorithm have been enhanced in success rate, convergence precision and the ability of breaking away from the local optimum. The improved BCC algorithm applied to substation planning problem which is a multi-constraint, multi-objective, large-scale and non-linear combinatorial optimisation problem has good performance of global convergence and better convergence speed.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Modelling, Identification and Control (IJMIC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook