A novel algorithm for finding non-dominated set in multi objective optimization.
Krishn MishraManoj VermaKrishnavir SinghPublished in: IC-AI (2009)
Keyphrases
- multi objective optimization
- multi objective
- convex hull
- pareto set
- dynamic programming
- search space
- optimization algorithm
- objective function
- multi objective optimization problems
- evolutionary algorithm
- method finds
- worst case
- learning algorithm
- bi objective
- particle swarm optimization
- optimal solution
- solution space
- benchmark problems
- simulated annealing
- representative set
- np hard
- multi objective genetic algorithm
- neural network
- solving multi objective optimization problems