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...

Full description

Saved in:

Bibliographic Details
Published in:	The Journal of supercomputing Vol. 79; no. 5; pp. 5730 - 5758
Main Authors:	Horng, Shih-Cheng, Lin, Shieh-Shing
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.03.2023 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!