Dynamic Programming Based Metaheuristic for the Unit Commitment Problem

Sophie Jacquin (1) , Laetitia Jourdan (2) , El-Ghazali Talbi (2)

1 LIFL - Laboratoire d'Informatique Fondamentale de Lille
2 DOLPHIN - Parallel Cooperative Multi-criteria Optimization

Unit Commitment Problem (UCP) is a strategic optimization problem in power system operation. Its objective is to schedule the generating units online or offline over a scheduling horizon such that the power production cost is minimized with the load demand fully met and the operation constraints satisfied.In this paper an approach to solve the UCP called DYNAMOP for DYNAmic programming using Metaheuristic for Optimizations Problems is proposed. The main idea of this method is to use a genetic algorithm (GA) to run through the graph of Dynamic Programming.

Mots clés: Metaheuristic

Domaines: Optimisation et contrôle [math.OC]; Algorithme et structure de données [cs.DS]

Sophie Jacquin, Laetitia Jourdan, El-Ghazali Talbi. Dynamic Programming Based Metaheuristic for the Unit Commitment Problem. META, Oct 2014, Marrakech, Morocco. ⟨hal-01110444⟩