Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: An algorithm with reoptimization.
Claudio T. BornsteinNelson MaculanMarta PascoalLeizer de Lima PintoPublished in: Comput. Oper. Res. (2012)
Keyphrases
- multi objective
- objective function
- combinatorial optimization problems
- optimal solution
- optimization algorithm
- cost function
- search space
- combinatorial optimization
- knapsack problem
- dynamic programming
- continuous optimization problems
- particle swarm optimization
- optimization problems
- ant colony optimization
- shortest path problem
- learning algorithm
- linear programming
- np hard
- k means
- computational complexity
- exact algorithms
- benchmark problems
- particle swarm optimization algorithm
- bi objective