On the performance of multiple-objective genetic local search on the 0/1 knapsack problem - a comparative experiment.
Andrzej JaszkiewiczPublished in: IEEE Trans. Evol. Comput. (2002)
Keyphrases
- multiple objectives
- knapsack problem
- genetic local search
- multi objective
- traveling salesman problem
- optimization problems
- beam search
- evolutionary algorithm
- combinatorial optimization problems
- dynamic programming
- optimal solution
- test problems
- multi objective optimization
- multidimensional knapsack problem
- shortest path problem
- exact algorithms
- np hard
- decision variables
- greedy algorithm
- linear programming relaxation
- greedy heuristic
- continuous relaxation
- linear programming problems
- objective function
- bi objective
- genetic algorithm
- nsga ii
- ant colony optimization