A comparative study of pre-screening strategies within a surrogate-assisted multi-objective algorithm framework for computationally expensive problems.
Fan LiLiang GaoAkhil GargWeiming ShenShifeng HuangPublished in: Neural Comput. Appl. (2021)
Keyphrases
- computationally expensive
- multi objective
- computationally efficient
- benchmark problems
- detection algorithm
- optimization algorithm
- learning algorithm
- objective function
- preprocessing
- dynamic programming
- multi objective optimization problems
- shortest path problem
- test problems
- particle swarm optimization algorithm
- matching algorithm
- ant colony optimization
- cost function
- particle swarm optimization
- bayesian framework
- iterative algorithms
- search space
- segmentation algorithm
- np complete
- expectation maximization
- optimization problems
- worst case
- constrained optimization
- k means