The ant colony optimisation solving continuous problems
by Ioannis Karakonstantis; Aristidis Vlachos
International Journal of Computational Intelligence Studies (IJCISTUDIES), Vol. 2, No. 3/4, 2013

Abstract: This paper presents an approach for solving the economic power dispatch (EPD) problem using the ant colony optimisation for continuous domains (ACOR) algorithm (Socha and Dorigo, 2008). ACO family algorithms are inspired by the way that real ants searching for their food (Dorigo and Stutzle, 2004). When they find the source of food they deposit an amount of pheromone on their way in order to guide the other ants of the colony. Ants use pheromone trails as a mean of communication in order to find shortest paths between the food and their nest. We apply ACOR algorithm and two modifications of it, modified ACOR (M-ACOR) and ACOR with pattern search (PS-ACOR) to the well-known problem of EPD and compare the results with other methods presented in literature for solving the EPD.

Online publication date: Sat, 19-Jul-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Computational Intelligence Studies (IJCISTUDIES):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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