Enhancing solution quality of the biobjective graph coloring problem using hybridization of EA: biobjective graph coloring problem.
Rajeev KumarParesh TolaySiddharth TiwaryPublished in: GECCO (2008)
Keyphrases
- bi objective
- solution quality
- evolutionary algorithm
- multi objective
- simulated annealing
- test problems
- efficient solutions
- nsga ii
- multi objective optimization
- optimal solution
- ant colony optimization
- minimum cost flow
- computational efficiency
- graph coloring
- set covering problem
- aco algorithm
- feasible solution
- multiple objectives
- metaheuristic
- shortest path problem
- hybrid algorithm
- test instances
- knapsack problem
- network design
- benchmark instances
- optimization problems
- search algorithm
- traveling salesman problem
- benchmark problems
- fitness function
- tabu search
- shortest path
- optimization algorithm
- particle swarm optimization
- genetic programming
- np hard