A high-level and adaptive metaheuristic selection algorithm for solving high dimensional bound-constrained continuous optimization problems.
Osman GökalpAybars UgurPublished in: Turkish J. Electr. Eng. Comput. Sci. (2020)
Keyphrases
- continuous optimization problems
- metaheuristic
- selection algorithm
- combinatorial optimization problems
- optimization problems
- high dimensional
- continuous optimization
- combinatorial optimization
- ant colony optimization
- simulated annealing
- tabu search
- evolutionary algorithm
- genetic algorithm
- search space
- aco algorithms
- objective function
- scatter search
- optimal solution
- feature subset selection
- search algorithm
- benchmark instances
- traveling salesman problem
- vehicle routing problem
- particle swarm optimization
- upper bound
- feature subset
- cost function
- knapsack problem
- feature space
- optimization method
- variable selection
- job shop scheduling problem
- lower bound
- mip solver
- neural network
- worst case
- quadratic assignment problem
- initial solution
- benchmark problems
- multi objective
- swarm intelligence
- optimization methods