Improved Pruning of Non-Dominated Solutions Based on Crowding Distance for Bi-Objective Optimization Problems.
Saku KukkonenKalyanmoy DebPublished in: IEEE Congress on Evolutionary Computation (2006)
Keyphrases
- bi objective
- optimization problems
- efficient solutions
- multi objective
- knapsack problem
- evolutionary algorithm
- nsga ii
- multi objective optimization
- ant colony optimization
- multiple objectives
- network design
- set covering problem
- metaheuristic
- pareto optimal solutions
- pareto frontier
- shortest path problem
- traveling salesman problem
- cost function
- test problems
- objective function
- combinatorial optimization problems
- benchmark problems
- differential evolution
- optimization algorithm
- multi objective evolutionary algorithms
- hybrid algorithms
- routing problem
- network architecture
- neural network
- search space
- artificial neural networks
- optimal solution
- social networks