scholarly journals Theoretical Investigation of Combined Use of PSO, Tabu Search and Lagrangian Relaxation methods to solve the Unit Commitment Problem

2018 ◽  
Vol 3 (1) ◽  
pp. 357-365
Author(s):  
Sahbi Marrouchi ◽  
Nesrine Amor ◽  
Moez Ben Hessine ◽  
Souad Chebbi
Keyword(s):  
Tabu Search ◽  
Lagrangian Relaxation ◽  
Theoretical Investigation ◽  
Unit Commitment ◽  
Unit Commitment Problem ◽  
Relaxation Methods ◽  
Combined Use ◽  
Commitment Problem

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

2011 ◽  
Vol 62 (1) ◽  
pp. 11-18 ◽  
Author(s):  
C. Christober ◽  
Asir Rajan
Keyword(s):  
Tabu Search ◽  
Unit Commitment ◽  
Computation Time ◽  
Evolutionary Programming ◽  
Search Method ◽  
Unit Commitment Problem ◽  
New Approach ◽  
Commitment Problem ◽  
Tabu Search Method ◽  
The Cost

An Evolutionary Programming Based Tabu Search Method for Unit Commitment Problem with Cooling-Banking Constraints 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.

Implementation of a Lagrangian Relaxation Based Unit Commitment Problem

1989 ◽  
Vol 9 (11) ◽  
pp. 34-34 ◽  
Author(s):  
Sudhir Virmani ◽  
Eugene C. Adrian ◽  
Karl Imhof ◽  
Shishir Mukherjee
Keyword(s):  
Lagrangian Relaxation ◽  
Unit Commitment ◽  
Unit Commitment Problem ◽  
Commitment Problem
Sign in / Sign up

Export Citation Format

Share Document