2018
DOI: 10.1016/j.enconman.2018.06.054
|View full text |Cite
|
Sign up to set email alerts
|

Unit commitment considering dual-mode combined heat and power generating units using integrated optimization technique

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
18
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 30 publications
(18 citation statements)
references
References 38 publications
0
18
0
Order By: Relevance
“…Hypercube representing corners in decimal heuristic method based on the priority list. 38 The MUT and MDT constraints are satisfied using Equations (11)(12)(13)(14). The procedure to handle the constraint of the CBUC problem is shown in Figure 5.…”
Section: Commitment Constraints Handlingmentioning
confidence: 99%
“…Hypercube representing corners in decimal heuristic method based on the priority list. 38 The MUT and MDT constraints are satisfied using Equations (11)(12)(13)(14). The procedure to handle the constraint of the CBUC problem is shown in Figure 5.…”
Section: Commitment Constraints Handlingmentioning
confidence: 99%
“…Higher power grid operational flexibility could be achieved by system operation improvement [2][3][4], using fast start resources [5], using emerging flexible resources [6,7], and improving grid infrastructure. Practically, in order to improve system operation, designing new markets, using new models and algorithms in the process of unit commitment [8,9] and modeling the uncertainty of renewable energy sources are the main concerns [10]. In this matter, an active market so-called "flexiramp in California independent system operator (CAISO) has been developed to compensate a partial loss of traditional plants and cheer them to provide flexible ramping products [11].…”
Section: Motivation and Problem Descriptionmentioning
confidence: 99%
“…Thorin [19] et al succeeded obtaining UC for CHP using both MILP and Lagrangian relaxation obtaining solutions within reasonable times by a suitable division of the whole optimization period into overlapping sub-periods. Anand et al [20] considered dual-mode CHPs and found that in this case evolutionary programming was the best to solve the UC problem. Basu et al [21] have in a similar way used genetic algorithms for the UC problem, Takada et al [22] used Particle Swarm Optimization, and Song et al [23] used an Improved Ant Colony Search algorithm.…”
Section: Litterature Reviewmentioning
confidence: 99%