A binary bat algorithm with improved crossover operators and Cauchy mutation for unit commitment problem

Power system operators are faced with the problem of unit commitment belonging to mixed integer programming, which becomes very complicated, as units become large-scale and highly constrained. Because unit commitment problem is a binary problem with commitment and de-commitment, a discrete/binary op...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	The Journal of supercomputing Ročník 80; číslo 8; s. 11261 - 11292
Hlavní autoři:	Pang, Aokang, Liang, Huijun, Lin, Chenhao, Yao, Lei
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.05.2024 Springer Nature B.V
Témata:	Algorithms Compilers Computer Science Constraints Cost control Crossovers Genetic algorithms Heuristic Integer programming Interpreters Iterative methods Linear programming Mixed integer Mutation Operators (mathematics) Optimization Optimization algorithms Power dispatch Processor Architectures Programming Languages Scheduling Unit commitment Local mutation Bat algorithm Unit commitment problem Crossover operator Binary algorithm
ISSN:	0920-8542, 1573-0484
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!