Effective anytime algorithm for multiobjective combinatorial optimization problems.
Miguel Ángel Domínguez-RíosFrancisco ChicanoEnrique AlbaPublished in: Inf. Sci. (2021)
Keyphrases
- combinatorial optimization problems
- knapsack problem
- multi objective
- objective function
- optimization algorithm
- continuous optimization problems
- combinatorial optimization
- ant colony optimization
- optimal solution
- shortest path problem
- optimization problems
- learning algorithm
- search space
- metaheuristic
- test problems
- min cost
- special case
- k means
- particle swarm optimization
- simulated annealing
- dynamic programming
- search strategy
- discrete optimization
- exact algorithms
- multiobjective genetic algorithm
- computational complexity
- particle swarm optimization algorithm
- lower bound
- upper bound
- np hard