DISCRETE GENETIC ALGORITHM AND REAL ANT COLONY OPTIMIZATION FOR THE UNIT COMMITMENT PROBLEM

Guillaume Sandou

2007

Abstract

In this paper, a cooperative metaheuristic for the solution of the Unit Commitment problem is presented. This problem is known to be a large scale, mixed integer problem. Due to combinatorial complexity, the exact solution is often intractable. Thus, a metaheuristic based method has to be used to compute a near optimal solution with low computation times. A new approach is presented here. The main idea is to couple a genetic algorithm to compute binary variables (on/off status of units), and an ant colony based algorithm to compute real variables (produced powers). Finally, results show that the cooperative method leads to the tractable computation of a satisfying solution for medium scale Unit Commitment problems.

Paper Citation

in Harvard Style

Sandou G. (2007). DISCRETE GENETIC ALGORITHM AND REAL ANT COLONY OPTIMIZATION FOR THE UNIT COMMITMENT PROBLEM . In Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 978-972-8865-82-5, pages 256-261. DOI: 10.5220/0001641602560261

in Bibtex Style

@conference{icinco07,
author={Guillaume Sandou},
title={DISCRETE GENETIC ALGORITHM AND REAL ANT COLONY OPTIMIZATION FOR THE UNIT COMMITMENT PROBLEM},
booktitle={Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2007},
pages={256-261},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001641602560261},
isbn={978-972-8865-82-5},
}

in EndNote Style

TY - CONF
JO - Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - DISCRETE GENETIC ALGORITHM AND REAL ANT COLONY OPTIMIZATION FOR THE UNIT COMMITMENT PROBLEM
SN - 978-972-8865-82-5
AU - Sandou G.
PY - 2007
SP - 256
EP - 261
DO - 10.5220/0001641602560261