<abstract xml:lang="en" xmlns="http://www.w3.org/1999/xhtml"><p>This paper presents a new approach to solve the short-term unit commitment problem using An Evolutionary Programming Based tabu search method with cooling and banking constraints. Numerical results are shown comparing the cost solutions and computation time obtained by using the evolutionary programming method and other conventional methods like dynamic programming, lagrangian relaxation.</p></abstract>

This paper presents a new approach to solve the short-term unit commitment problem using An Evolutionary Programming Based tabu search method with cooling and banking constraints. Numerical results are shown comparing the cost solutions and computation time obtained by using the evolutionary programming method and other conventional methods like dynamic programming, lagrangian relaxation.

An Evolutionary Programming Based Tabu Search Method for Unit Commitment Problem with Cooling-Banking Constraints

Department of EEE Pondicherry Engineering, College Pondicherry, 605014 India

Journal of Electrical Engineering

This paper presents a new approach to solve the short-term unit commitment problem using An Evolutionary Programming Based tabu search method with cooling and...

An Evolutionary Programming Based Tabu Search Method for Unit Commitment Problem with Cooling-Banking Constraints

Data publikacji: 07 cze 2011

Zakres stron: 11 - 18

DOI: https://doi.org/10.2478/v10187-011-0002-6

Słowa kluczowe
unit commitment problem, tabu search, evolutionary programming

This content is open access.

An Evolutionary Programming Based Tabu Search Method for Unit Commitment Problem with Cooling-Banking Constraints

Data publikacji: 07 cze 2011

Zakres stron: 11 - 18

DOI: https://doi.org/10.2478/v10187-011-0002-6

Słowa kluczoweunit commitment problem, tabu search, evolutionary programming

This content is open access.

Słowa kluczowe
unit commitment problem, tabu search, evolutionary programming