Mixed Ant Colony Optimization for the Unit Commitment Problem

Authors:
Ana-Talida Serban;Guillaume Sandou
Affiliations:
Supélec, Automatic Control Department, 3, rue Joliot Curie, F-91192 Gif-sur-Yvette, France and Politehnica University of Bucharest, Faculty of Automatic Control & Computer Science, 060042-Buc ...;Supélec, Automatic Control Department, 3, rue Joliot Curie, F-91192 Gif-sur-Yvette, France
Venue:
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
Year:
2007

Citing 4
Cited 1

MAX-MIN Ant system

Future Generation Computer Systems
The Ant Colony Metaphor for Searching Continuous Design Spaces

Selected Papers from AISB Workshop on Evolutionary Computing
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Extended ant colony optimization for non-convex mixed integer nonlinear programming

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a mixed integer programming method based on ant colony optimization is presented, and applied to the classical Unit Commitment problem. The idea is to reformulate the problem into a graph exploration structure, and to use discrete ant colony optimization to explicitly take into account time down, time up and demand constraints in the optimization procedure. This method is coupled with a continuous ant colony algorithm to compute produced powers. Results, obtained on relatively small cases, show the viability of the proposed approach: a near optimal solution, with guarantees of feasibility, can be computed with low computation times.