An enhanced multi-operator differential evolution algorithm for tackling knapsack optimization problem

Karam M. Sallam, Amr A. Abohany, Rizk M. Rizk-Allahi

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

The knapsack problem (KP) is a discrete combinatorial optimization problem that has different utilities in many fields. It is described as a non-polynomial time (NP) problem and has several applications in many fields. The differential evolution (DE) algorithm has been successful in solving continuous optimization problems, but it needs further work to solve discrete and binary optimization problems and avoid local optima. According to the literature, no DE search operator or algorithm is optimal for all optimization tasks. As a result, using more than one search operator in a single algorithm architecture, called multi-operator-based algorithms, is a solution to address this problem. These methods outperformed single-based methods for continuous optimization problems. Thus, in this paper, a binary multi-operator differential evolution (BMODE) approach is presented to tackle the 0–1 KP. The presented methodology utilizes multiple differential evolution (DE) mutation strategies with complementary characteristics, with the best mutation operator being asserted utilizing the produced solutions’ quality and the population’s diversity. In BMODE, two types of transfer functions (TFs) (S-shaped and V-shaped) are used to transfer the continuous solutions to binary ones to be able to calculate the fitness function value. To handle the capacity constraints, a feasibility rule is utilized and some of the infeasible solutions are repaired. The performance of BMODE is tested by solving 40 instances with multiple dimensions, i.e., low, medium, and high. Experimental results of the proposed BMODE are compared with well-known state-of-the-art 0–1 knapsack algorithms. Based on Wilcoxon’s nonparametric statistical test (α= 0.05), the proposed BMODE can obtain the best results against the rival algorithms in most cases, and can work well on stability and computational accuracy.

Original languageEnglish
Pages (from-to)13359-13386
Number of pages28
JournalNeural Computing and Applications
Volume35
Issue number18
DOIs
Publication statusPublished - 14 Mar 2023

Fingerprint

Dive into the research topics of 'An enhanced multi-operator differential evolution algorithm for tackling knapsack optimization problem'. Together they form a unique fingerprint.

Cite this