Evolution of hyperheuristics for the biobjective 0/1 knapsack problem by multiobjective genetic programming.
Rajeev KumarAshwin H. JoshiKrishna K. BankaPeter I. RockettPublished in: GECCO (2008)
Keyphrases
- bi objective
- knapsack problem
- genetic programming
- multi objective
- evolutionary algorithm
- optimization problems
- multiple objectives
- nsga ii
- combinatorial optimization problems
- set covering problem
- pareto optimal solutions
- evolutionary computation
- fitness function
- minimum cost flow
- dynamic programming
- test problems
- optimal solution
- exact algorithms
- np hard
- multi objective optimization
- genetic algorithm
- pareto local search
- multiobjective optimization
- greedy algorithm
- optimization algorithm
- neural network
- shortest path problem
- efficient solutions
- traveling salesman problem
- particle swarm optimization
- pareto optimal
- differential evolution
- metaheuristic
- worst case