1995
DOI: 10.1016/0196-8904(94)00075-b
|View full text |Cite
|
Sign up to set email alerts
|

An expert system approach to the unit commitment problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2007
2007
2020
2020

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 17 publications
(5 citation statements)
references
References 4 publications
0
5
0
Order By: Relevance
“…This operator [22] generates distorted vectors X i by disturbing a randomly chosen vector 'X a ' and dissimilarity randomly chosen vectors 'X b ' and 'X c ' as per the following equation:…”
Section: • Mutationmentioning
confidence: 99%
“…This operator [22] generates distorted vectors X i by disturbing a randomly chosen vector 'X a ' and dissimilarity randomly chosen vectors 'X b ' and 'X c ' as per the following equation:…”
Section: • Mutationmentioning
confidence: 99%
“…The unit commitment problem is also solved by many heuristic techniques. Kothari and Ahmad [35] proposed a method which combines dynamic programming with expert system and a rule-based system for solving the unit commitment problem and named this method as hybrid approach.…”
Section: Advantages and Disadvantagesmentioning
confidence: 99%
“…As unit commitment is a wide-ranging, combinational and mixed integer nonlinear programming problem [16][17][18][19]. Several optimization methods have been used to solve this type of problem including priority listing [20,21], mixed integer programming [22][23][24][25], dynamic programming [26][27][28][29][30][31][32][33], hierarchical optimization [34][35][36][37][38][39], lagrange relaxation method [40][41][42][43][44][45], tabu search [46][47][48], non-linear programming problem [49,50] and branch and bound method [51]. There are two families of unit commitment, one is deterministic unit commitment problem and the other is stochastic unit commitment problem.…”
Section: Introductionmentioning
confidence: 99%
“…There are key difficulties, to resolve the UC problems, by incorporating these classical approaches like deprived convergence, computation intricacy to handle multi-objective functions with many constraints, to achieve efficient results. Nontraditional artificial intelligence based optimization approaches like Network Programming (NP) [80], Tabu Search (TS) [81], Hybrid fuzzy based TS [82], Heuristic search techniques [83]- [85], Simulated Annealing (SA) [86]- [89], Twofold SA [90], [91], Adaptive SA [92], Enhanced SA [93], [94], Stochastic SA [95], [96], Ant Colony Optimization (ACO) [97], [98], ACO with Random Perturbation [99], Memory Bounded ACO [100], Nodal ACO [101], Hybrid Taguchi ACO [102], Fuzzy Logic [103]- [107], Fuzzy based SA [108], [109], Fuzzy DP [110], Fuzzy Hierarchical Bi-Level Modelling [111], Artificial Neural Network (ANN) [112]- [119], Hybrid ANN [120]- [122], Hopfield ANN [123]- [127], Expert System [128]- [131] and Quasi-Oppositional Teaching Learning Algorithm [132], could cope with the convergence properties, intricacy of computational operation and give innovative solutions against conservative methods. Every traditional and non-traditional technique has diverse properties, merits and demerits.…”
Section: Introductionmentioning
confidence: 99%