Taming the 0/1 knapsack problem with monogamous pairs genetic algorithm.
Ting Yee LimMohammed Azmi Al-BetarAhamad Tajudin KhaderPublished in: Expert Syst. Appl. (2016)
Keyphrases
- knapsack problem
- genetic algorithm
- multidimensional knapsack problem
- optimization problems
- optimal solution
- combinatorial optimization problems
- exact algorithms
- dynamic programming
- test problems
- greedy algorithm
- metaheuristic
- np hard
- evolutionary algorithm
- bicriteria
- fitness function
- np hard problems
- heuristic solution
- linear programming relaxation
- multi objective
- particle swarm optimization
- greedy heuristic
- nsga ii
- simulated annealing
- neural network
- evolutionary computation
- maximum profit
- decision variables
- combinatorial optimization
- genetic algorithm ga
- continuous relaxation
- randomly generated test instances