Incorporate seagull optimization into ordinal optimization for solving the constrained binary simulation optimization problems

Constrained binary simulation optimization problems (CBSOP) are optimization problems with binary variables and stochastic objective function subject to given constraints. Solving the CBSOP by conventional optimization algorithms becomes highly time-consuming when the problem size is increased. Alth...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	The Journal of supercomputing Ročník 79; číslo 5; s. 5730 - 5758
Hlavní autoři:	Horng, Shih-Cheng, Lin, Shieh-Shing
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.03.2023 Springer Nature B.V
Témata:	Accuracy Algorithms Compilers Computer Science Constraints Emulators Heuristic methods Interpreters Linear programming Manufacturing Optimization Optimization algorithms Optimization techniques Processor Architectures Programming Languages Real time Simulation Spline functions Tensors Ordinal optimization Sorting conveyor system Binary seagull optimization Shortcuts layout Optimal computing budget allocation Tensor product B-splines
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!