2011
DOI: 10.2478/v10187-011-0002-6
|View full text |Cite
|
Sign up to set email alerts
|

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

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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 32 publications
0
4
0
Order By: Relevance
“…While in reality these costs typically depend exponentially on the number of hours since the last shutdown, Christober (2011), in this paper a single start-up cost is assumed…”
Section: Constraintsmentioning
confidence: 99%
“…While in reality these costs typically depend exponentially on the number of hours since the last shutdown, Christober (2011), in this paper a single start-up cost is assumed…”
Section: Constraintsmentioning
confidence: 99%
“…Numerous researchers have examined an assortment of evolutionary optimization techniques, related to UC problem, in diverse dimensions. This paper proposes to present a complete review of the UC problem, integrated with numerous types of evolutionary optimization techniques like UC problem incorporated with GA [133]- [159], UC problem incorporated with PSO [160]- [170], UC problem incorporated with EA [171]- [177], UC problem incorporated with EP [178]- [183], UC problem incorporated with DE [184]- [190], UC problem incorporated with SFLA [191]- [193], UC problem incorporated with FA [194]- [199], UC problem incorporated with other evolutionary optimization techniques like BFA [200], FSA [201], [202] and CSA [203], UC problem incorporated with Hybrid evolutionary optimization techniques [204]- [244], in the subsequent sections. Distinctive features of the references, connected to evolutionary optimization techniques, are captured and showed in Table 4, including the year of the publication.…”
Section: Review Of Uc Problem Dealt With By Evolutionary Optimization...mentioning
confidence: 99%
“…In this approach, the optimal point is found by EP technique and SA is assisted by EP to make quick best point convergence. The same author also presented an EP-TS approach, with cooling and banking constraints, to solve UC problem solution [183].…”
Section: Uc Problem Incorporated With Epmentioning
confidence: 99%
“…This algorithm gave a faster and cheaper result compared to tabu search, dynamic programming, Artificial neural networks, Lagrange programming, LR-GA, TS-GA and EP-TS methods. In addition, C. Asir [26] has developed another strategy which consists in integrating the tabu search with the genetic algorithm. The purpose of this technique is to find the planning of the production.…”
Section: Introductionmentioning
confidence: 99%