An improved discreet Jaya optimisation algorithm with mutation operator and opposition-based learning to solve the 0-1 knapsack problem.
Mohammad Subhi Al-BatahMohammed Riyad Al-EiadehPublished in: Int. J. Math. Oper. Res. (2023)
Keyphrases
- knapsack problem
- mutation operator
- optimisation algorithm
- nsga ii
- evolutionary algorithm
- differential evolution
- optimization problems
- optimisation problems
- ant colony
- initial population
- optimal solution
- genetic algorithm
- premature convergence
- test problems
- evolutionary computation
- combinatorial optimization problems
- biogeography based optimization
- dynamic programming
- crossover operator
- np hard
- evolutionary programming
- convergence rate
- function optimization
- greedy algorithm
- multiple objectives
- genetic operators
- multi objective
- optimization algorithm
- genetic algorithm ga
- population diversity
- optimization method
- standard pso
- multi objective optimization
- worst case
- branch and bound algorithm
- traveling salesman problem