An improved discreet Jaya optimisation algorithm with mutation operator and opposition-based learning to solve the 0-1 knapsack problem
by Mohammad Subhi Al-Batah; Mohammed Riyad Al-Eiadeh
International Journal of Mathematics in Operational Research (IJMOR), Vol. 26, No. 2, 2023

Abstract: The 0-1 knapsack problem, a prevalent combinatorial optimisation problem, aims to maximise the benefits of a chosen subset of items while ensuring the total capacity is not exceeded. 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 is used to improve the diversity of the initial population, while the mutation operator is used to enhance the search capabilities to bypass local optima issues. Transfer functions are used to convert the Jaya algorithm from a continuous to a binary version. The repair method is used to handle infeasible solutions, and the fitness function is used to assess each solution. IDJaya's performance had been tested on a range of benchmark knapsack problems, demonstrating that IDJaya could be an effective alternative solution for various 0-1 knapsack problems.

Online publication date: Tue, 24-Oct-2023

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com