Hybrid Metaheuristics based on MOEA/D for 0/1 multiobjective knapsack problems: A comparative study.
Ahmed KafafyAhmed BounekkarStéphane BonnevayPublished in: IEEE Congress on Evolutionary Computation (2012)
Keyphrases
- multi objective
- knapsack problem
- nsga ii
- optimization problems
- evolutionary algorithm
- particle swarm optimization
- optimal solution
- uniform design
- objective function
- multiobjective evolutionary algorithm
- combinatorial optimization problems
- test problems
- multiobjective optimization
- multi objective optimization
- optimization algorithm
- metaheuristic
- genetic algorithm
- multiple objectives
- pareto fronts
- pareto optimal
- multi objective evolutionary algorithms
- dynamic programming
- combinatorial optimization
- exact algorithms
- bi objective
- greedy algorithm
- linear programming relaxation
- crossover operator
- vehicle routing problem
- differential evolution
- cost function
- traveling salesman problem
- pareto optimal solutions
- np hard
- simulated annealing
- tabu search
- evolutionary computation
- multi objective problems
- benchmark problems
- multi criteria
- cutting plane
- fitness function
- ant colony optimization
- test instances
- pareto dominance
- search space
- maximum profit