A Branch and Bound Algorithm for Transmission Network Expansion Planning Using Nonconvex Mixed-Integer Nonlinear Programming Models

The branch and bound (BB) algorithm is widely used to obtain the global solution of mixed-integer linear programming (MILP) problems. On the other hand, when the traditional BB structure is directly used to solve nonconvex mixed-integer nonlinear programming (MINLP) problems, it becomes ineffective,...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE access Ročník 10; s. 39875 - 39888
Hlavní autoři:	Zoppei, Reinaldo T., Delgado, Marcos A. J., Macedo, Leonardo H., Rider, Marcos J., Romero, Ruben
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Piscataway IEEE 2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithms Biological system modeling Branch and bound algorithm Integer programming Linear programming Metaheuristics Mixed integer mixed-integer nonlinear programming Nonlinear programming Nonlinearity Optimization Planning Programming profession Propagation losses Search problems Solvers transmission network expansion planning
ISSN:	2169-3536, 2169-3536
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!