A Modified Binary Firefly Algorithm to Solve Hardware/Software Partitioning Problem

Khetatba, Mourad; Boudour, Rachid

doi:10.31449/inf.v45i7.3408

Cited by 5 publications

(1 citation statement)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed equation by Dhiman and Kumar [15] to calculate the distance (𝐷) is presented in equation (10). The calculations of the two collision vectors 𝐴 ⃗ and 𝐶 ⃗ are shown in equations ( 11) and (12), respectively. The 𝑃 𝑔𝑟𝑖𝑑 variable found in equation ( 13) is the absolute value of the difference between the position of the best emperor penguin and the current penguin 𝑖, where the equation of the 𝑃 𝑔𝑟𝑖𝑑 is equation (13).…”

Section: Determining the Distance Between The Emperor Penguinsmentioning

confidence: 99%

A Modified Emperor Penguin Optimizer Algorithm for Solving Fixed-Charged Transshipment Problem

Eltoukhy,

Zakaraia

2024

IJCAI

View full text Add to dashboard Cite

This paper introduces a novel optimization problem termed the Fixed Charged Transshipment Problem (FCTP), which incorporates fixed charges for selected routes. A new formulation for this problem is presented, aiming to address the combinatorial nature of the challenge. The study further introduces a Modified Emperor Penguin Optimizer (EPO) algorithm designed to enhance the solution approach. To evaluate the performance of the Modified EPO, a comparative analysis is conducted against the classical EPO and Particle Swarm Optimization (PSO) algorithms. 19 problems, including various multi-modal test optimization functions, serve as the testing ground. Results demonstrate the efficacy of the Modified EPO, establishing its superiority over the classical EPO and PSO. Additionally, a heuristic procedure is proposed for solving the combinatorial aspect of the FCTP. This heuristic is hybridized with both the Modified EPO and PSO algorithms. 30 FCTP problems are generated using a code available at https://github.com/MZakaraia/EPO_Transshipment/. Taguchi's orthogonal arrays are employed to optimize parameter levels for both algorithms. The study concludes with the comparison of the Modified Hybrid EPO and Hybrid PSO in solving the 30 generated FCTP problems. Remarkably, the Modified Hybrid EPO algorithm outperforms the Hybrid PSO, showing its effectiveness in addressing the Fixed Charged Transshipment Problem in terms of means and robustness.Povzetek: Članek predstavlja spremenjeni algoritem cesarskega pingvina za reševanje problema s fiksnimi stroški prenosa, ki kaže premoč nad klasičnimi metodami z robustnostjo in učinkovitostjo rešitev.

show abstract

Section: Determining the Distance Between The Emperor Penguinsmentioning

confidence: 99%

A Modified Emperor Penguin Optimizer Algorithm for Solving Fixed-Charged Transshipment Problem

Eltoukhy,

Zakaraia

2024

IJCAI

View full text Add to dashboard Cite

show abstract

A hovering swarm particle swarm optimization algorithm based on node resource attributes for hardware/software partitioning

Deng,

Xiao,

Deng

et al. 2023

J Supercomput

View full text Add to dashboard Cite

Hardware/software (HW/SW) partitioning is a vital aspect of HW/SW co-design. With the development of the design complexity in heterogeneous computing systems, existing partitioning algorithms have demonstrated inadequate performance in addressing problems relating to large-scale task nodes. This paper presents a novel HW/SW partitioning algorithm based on node resource attributes hovering swarm particle swarm optimization (HSPSO). First, the system task graph is initialized via the node resource urgency partitioning algorithm; then, the iterative solution produced by HSPSO algorithm yields the partitioning result. We present new initialization by combining node resource attribute information and introduce two improvements to the learning strategy of HSPSO algorithm. For the main swarm, a directed sample set and the addition of perturbation particles are designed to direct the main swarm’s particle search process. For the secondary swarm, a dynamic particle update equation is formulated. Iterative updates are performed based on previous rounds’ prior information using adaptive inertia weight. The experimental results illustrate that, in large-scale systems task graph partitioning with more than 400 nodes, when compared with mainstream partitioning algorithms, the proposed algorithm improves partitioning performance by no less than 10% for compute-intensive task graphs and no <5% for communication-intensive task graphs, with higher solution stability.

show abstract

Intelligent decision-making for binary coverage: Unveiling the potential of the multi-armed bandit selector

Becerra-Rozas,

Lemus-Romani,

Crawford

et al. 2024

Expert Systems with Applications

View full text Add to dashboard Cite

A Modified Binary Firefly Algorithm to Solve Hardware/Software Partitioning Problem

Cited by 5 publications

References 46 publications

A Modified Emperor Penguin Optimizer Algorithm for Solving Fixed-Charged Transshipment Problem

A Modified Emperor Penguin Optimizer Algorithm for Solving Fixed-Charged Transshipment Problem

A hovering swarm particle swarm optimization algorithm based on node resource attributes for hardware/software partitioning

Intelligent decision-making for binary coverage: Unveiling the potential of the multi-armed bandit selector

Contact Info

Product

Resources

About