An Efficient Differential Evolution Algorithm for Solving 0–1 Knapsack Problems

Ali, Ismail; Essam, Daryl; Kasmarik, Kathryn

doi:10.1109/cec.2018.8477916

Cited by 15 publications

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The knapsack problem is an example of a mathematic combinatorial optimization problem. This is a problem that has been studied for more than a century, when, there is a need of finite and optimized solution, where an exhaustive search is not possible [9]. The problem can be found in real-world scenarios as resource allocation in financial constraints or even in selecting investments and portfolios [10].…”

Section: Knapsack Methods and How To Fit The Code In The Load Allocation Problemmentioning

confidence: 99%

Optimized LV loads allocation for MEA electrical power systems

Spagnolo

Madonna

Sumsurooah

et al. 2019

AIAA Propulsion and Energy 2019 Forum

View full text Add to dashboard Cite

this paper proposes a smart controller design for an automated power load allocation for the more electric aircraft application. As the aircraft manufacturers are moving towards more electrified solutions, power management and optimization are becoming more important design considerations. With the evolution of control techniques, and newly available intelligent tools and powerful hardware, it is now possible to find smart solutions to the distribution and load allocation problem. In this paper a mathematical solution is proposed to reconfigure the connected loads on each single bus based on the value of the available power and the level of priority of each load with the aim to optimize the allocation of the loads. Simulations performed within Simulink environment are used to verify the results.

show abstract

Section: Knapsack Methods and How To Fit The Code In The Load Allocation Problemmentioning

confidence: 99%

Optimized LV loads allocation for MEA electrical power systems

Spagnolo

Madonna

Sumsurooah

et al. 2019

AIAA Propulsion and Energy 2019 Forum

View full text Add to dashboard Cite

show abstract

“…In another study (Rizk-Allah and Hassanien, 2018), Binary Bat Algorithm (BBA) was established based on the V-shaped and S-shaped transfer functions and used to cope with 0-1 KP. The Differential Evolution Algorithm was designed to apply to binary problems and the binary version was tested on the 0-1 KPs (Ismail M. Ali, 2018). A binary variant of Flower Pollination Algorithm (BFPA) with sigmoid transfer function was introduced, and repair operator and penalty function were employed to improve the solution quality (Abdel-Basset, El-Shahat and El-Henawy, 2019).…”

Section: Introductionmentioning

confidence: 99%

Binary Honey Badger Algorithm for 0-1 Knapsack Problem

Büyüköz

Haklı

2023

jista

View full text Add to dashboard Cite

Honey Badger Algorithm (HBA) is one of the recently proposed optimization techniques inspired by the foraging behavior of honey badger. Although it has been successfully applied in solving continuous problems, the algorithm cannot be implemented directly in binary problems. A binary version of HBA is proposed in this study for the 0-1 Knapsack Problem (0-1 KP). To adapt the binary version of HBA, V- Shaped, S-Shaped, U-Shaped, T-Shaped, Tangent Sigmoid, O-Shaped, and Z-Shaped transfer functions are used. Each transfer function was tested by computational experiments over 25 instances of 0-1 KP and compared results. According to the results obtained, it was observed that O1 was the best TF among 25 TFs. In addition, the proposed algorithm was compared with three different binary variants, such as BPSO, MBPSO, and NGHS. Experimental results and comparison show that the proposed method is a promising and alternative algorithm for 0-1 KP problems.

show abstract

Binary Mother Tree Optimization Algorithm for 0/1 Knapsack Problem

Korani

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

An Efficient Differential Evolution Algorithm for Solving 0–1 Knapsack Problems

Cited by 15 publications

References 18 publications

Optimized LV loads allocation for MEA electrical power systems

Optimized LV loads allocation for MEA electrical power systems

Binary Honey Badger Algorithm for 0-1 Knapsack Problem

Binary Mother Tree Optimization Algorithm for 0/1 Knapsack Problem

Contact Info

Product

Resources

About