The ant colony optimisation solving continuous problems

Authors:
Ioannis Karakonstantis;Aristidis Vlachos
Affiliations:
Department of Informatics, University of Piraeus, 80, Karaoli & Dimitriou str., 18534 Piraeus, Greece;Department of Informatics, University of Piraeus, 80, Karaoli & Dimitriou str., 18534 Piraeus, Greece
Venue:
International Journal of Computational Intelligence Studies
Year:
2013

Citing 7
Cited 0

Pattern Search Algorithms for Bound Constrained Minimization

SIAM Journal on Optimization
Pattern Search Methods for Linearly Constrained Minimization

SIAM Journal on Optimization
Ant Colony Optimization

Ant Colony Optimization
Applied Optimization with MATLAB Programming

Applied Optimization with MATLAB Programming
The oracle penalty method

Journal of Global Optimization
Economic load dispatch using improved harmony search

WSEAS Transactions on Systems and Control
Evolutionary programming techniques for economic load dispatch

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

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.