2014
DOI: 10.1016/j.ijepes.2014.07.004
|View full text |Cite|
|
Sign up to set email alerts
|

Inducing-objective-function-based method for long-term SCUC with energy constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
7

Relationship

2
5

Authors

Journals

citations
Cited by 15 publications
(9 citation statements)
references
References 24 publications
0
9
0
Order By: Relevance
“…Wang et al [37] presents a fast bounding technique to improve the traditional branch-and-cut algorithm. Based on the work in Wang et al [37], an inducing-objective-function-based method is proposed in Bai et al [38]. In addition, a study by Chen et al [39] based on the stochastic method was proposed, and Voorspools and D'haeseleer [40] generated operation plan patterns for each power generation system, designated priority for the patterns, and conducted probabilistic scenario analysis on them.…”
Section: Generation System Operation Planningmentioning
confidence: 99%
“…Wang et al [37] presents a fast bounding technique to improve the traditional branch-and-cut algorithm. Based on the work in Wang et al [37], an inducing-objective-function-based method is proposed in Bai et al [38]. In addition, a study by Chen et al [39] based on the stochastic method was proposed, and Voorspools and D'haeseleer [40] generated operation plan patterns for each power generation system, designated priority for the patterns, and conducted probabilistic scenario analysis on them.…”
Section: Generation System Operation Planningmentioning
confidence: 99%
“…MIP solvers commonly use rounding and diving heuristics. In particular, adjusting the coefficient of the variables to be "rounded" in the objective function ("soft bounding") has been proven to be effective in solving MIP models [22] and has been applied to the SCUC problem [23], [24] and to optimal transmission switching [25]. It has been shown that the soft bounding methods significantly improve the computational efficiency, in some cases, the computational efficiency can be improved by more than an order of magnitude [23]- [25].…”
Section: B Relaxation Induced Algorithm For the Master Problem 1) Fomentioning
confidence: 99%
“…Thus, the real calculation error is defined as (24) Since is the feasible solution of , then , thus (25) While cannot usually be obtained in an acceptable time, the auxiliary calculation error is defined as (26) where is the objective function value of . Obviously, , thus…”
Section: B Relaxation Induced Algorithm For the Master Problem 1) Fomentioning
confidence: 99%
“…However, the method has feasibility drawbacks. Based on the work in [24], an inducing-objective-function-based method is proposed in [25].…”
Section: Research Articlementioning
confidence: 99%
“…It is such differentiation among the objective coefficient of integer decision variables that can reduce the computational burden of the branch-and-cut process, which may contribute to improving the computational speed [38]. The similar thought is defined as 'soft bounding' in [38] and it has been applied to solve the MIP problem [24,25,39]. The modified MIP problem Prob cp that incorporates constraints (22)-(24) is abbreviated as follows…”
Section: Decision Variables Associated With the Unit Commitment Statementioning
confidence: 99%