EconPapers    
Economics at your fingertips  
 

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

Mohammad Subhi Al-Batah and Mohammed Riyad Al-Eiadeh

International Journal of Mathematics in Operational Research, 2023, vol. 26, issue 2, 143-169

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.

Keywords: 0-1 knapsack problem; discreet Jaya algorithm; mutation operator; opposition-based learning; OBL; transfer functions; binary optimisation problem. (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=134491 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:26:y:2023:i:2:p:143-169

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().

 
Page updated 2025-03-19
Handle: RePEc:ids:ijmore:v:26:y:2023:i:2:p:143-169