NSGAII With Local Search Based Heavy Perturbation for Bi-Objective Weighted Clique Problem.
Dunbo CaiYuhui GaoMinghao YinPublished in: IEEE Access (2018)
Keyphrases
- bi objective
- pareto local search
- multi objective
- efficient solutions
- multi objective optimization
- maximum weight
- multiple objectives
- ant colony optimization
- network design
- genetic algorithm
- minimum cost flow
- set covering problem
- hybrid algorithms
- search space
- tabu search
- shortest path problem
- knapsack problem
- search algorithm
- memetic algorithm
- evolutionary algorithm
- combinatorial optimization
- neural network
- artificial neural networks
- heuristic methods
- nsga ii
- simulated annealing
- particle swarm optimization
- optimal solution
- optimization algorithm