Abstract: 0-1 knapsack problem is one of the most common combinational optimisation problems, which intends toward maximising the profits of a selected subset of items with considering not to exceed a certain capacity. This paper proposes an improved discreet Jaya (IDJaya) algorithm to solve 0-1 knapsack problems. IDJaya includes opposition-based learning (OBL), Jaya algorithm, transfer functions, mutation operator, repair method, and fitness function. OBL used to improve the initial population diversity, and mutation used to improve the search capabilities to overcome the problem of local optima. Transfer functions used to convert the continuous version of Jaya to a binary one. Repair method used to fix the infeasible solutions. Fitness function used to evaluate each solution. The performance of IDJaya is evaluated over a set of benchmark knapsack problems, and the results showed that IDJaya can be an efficient alternative approach for solving various 0-1 knapsack problems.

Keywords: 0-1 knapsack problem; discreet Jaya algorithm; mutation operator; opposition-based learning; OBL; transfer functions; binary optimisation problem.

Paper title: An improved discreet Jaya optimisation algorithm with mutation operator and opposition-based learning to solve the 0-1 knapsack problem.

Paper DOI: 10.1504/IJMOR.2023.134491

Paper link: https://www.inderscience.com/info/inarticle.php?artid=134491

Send email to mraleiad@iu.edu or maleiade@purude.edu for full text.