Work

Dynamic Programming Based Metaheuristic for the Unit Commitment Problem

Year: 2014

Type: conference-paper

Abstract: 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.

Source: HAL

Authors: Jacquin, Sophie, Jourdan, Laetitia, Talbi, El-Ghazali

Institution: Laboratoire d'Informatique Fondamentale de Lille

Language: English

Topic: Electric Power System Optimization

Subfield: Electrical and Electronic Engineering

Field: Engineering

Domain: Physical Sciences

SDGs: Affordable and clean energy, Industry, innovation and infrastructure

Open Access status: green

OpenAlex ID: W2728169586

FWCI:

Cites: 9

Cited by:

Related to: 10