An algorithm for approximating the Pareto set of the multiobjective set covering problem.
Lakmali WeerasenaMargaret M. WiecekBanu SoyluPublished in: Ann. Oper. Res. (2017)
Keyphrases
- multi objective
- pareto set
- set covering problem
- optimization algorithm
- bi objective
- np hard
- objective function
- optimal solution
- evolutionary algorithm
- cost function
- particle swarm optimization
- set covering
- multi objective optimization
- computational complexity
- neural network
- simulated annealing
- nsga ii
- solution quality
- dynamic programming
- ant colony optimization
- genetic algorithm