2022
DOI: 10.14483/23448393.19310
|View full text |Cite
|
Sign up to set email alerts
|

Notes on the Dimension of the Solution Space in Typical Electrical Engineering Optimization Problems

Abstract: Nowadays, optimization methodologies based on combinatorial strategies (i.e., metaheuristic methods) and exact methods can be easily found through-out the scientific literature in all areas of engineering, including electrical, mechanical, chemical, computational, and food engineering, among others. The common denominator in these areas of research corresponds to the complexity of the optimization models, as well as to the large dimensions of the solution space where these models are defined [1]. In addition, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 8 publications
(2 citation statements)
references
References 11 publications
0
2
0
Order By: Relevance
“…To solve the MINLP model in Equations ( 1)- (11) in the current literature, the predominant alternative corresponds to the usage of embedded combinatorial optimization methods due to the large dimensions of the solution spaces in these MINLP models [26,27]. These methods allow dealing with the nonlinearities and non-convexities of the model via sequential programming [14].…”
Section: Mathematical Optimization Modelmentioning
confidence: 99%
“…To solve the MINLP model in Equations ( 1)- (11) in the current literature, the predominant alternative corresponds to the usage of embedded combinatorial optimization methods due to the large dimensions of the solution spaces in these MINLP models [26,27]. These methods allow dealing with the nonlinearities and non-convexities of the model via sequential programming [14].…”
Section: Mathematical Optimization Modelmentioning
confidence: 99%
“…Owing to its nature, several metaheuristic techniques have been applied to solve the ORPD problem. The main advantage of these approaches is that they are able to deal with nonconvex optimization problems involving discrete and continuous variables [11,12]. Furthermore, they do not require differentiability of the objective function or constraints, overcoming the disadvantages of classic optimization algorithms.…”
Section: Introductionmentioning
confidence: 99%