Knapsack Cipher-based metaheuristic optimization algorithms for cryptanalysis in blockchain-enabled internet of things systems

This research study aims to introduce chaos theory into the Manta Ray Foraging Optimization (MRFO) Algorithm and optimize a real-world design problem through the chaos-enhanced versions of this method. Manta Ray Foraging Optimization algorithm is a bio-inspired swarm intelligence-based metaheuristic algorithm simulating the distinctive food search behaviors of the manta rays. However, MRFO suffers from some intrinsic algorithmic inefficiencies such as slow and premature convergence and unexpected entrapment to the local optimum points in the search domain like most of the metaheuristic algorithms in the literature. Recently, random numbers generated by chaos theory have been incorporated into the metaheuristic algorithms to solve these problems. More than twenty chaotic maps are applied to the base algorithm and ten best performing methods are considered for performance evaluation on high-dimensional optimization test problems. Forty test problems comprising unimodal and multimodal functions have been solved by chaotic variants of MRFO and extensive statistical analysis is performed. Furthermore, thermo-economic design optimization of an air-fin cooler is maintained by the chaotic MRFO variants to assess their optimization capabilities over complex engineering design problems. Ten decisive design variables of an air fin cooler are optimized in terms of total annual cost rates and optimum solutions obtained by five best chaotic MRFO algorithms are compared to the preliminary design. A significant improvement is observed in the objective function values when MRFO with chaotic operators is applied to this considered thermal design problem.

Sizing and shape optimization of truss employing a hybrid constraint-handling technique and manta ray foraging optimization

Large-scale photovoltaic system (PV) installation can affect power system operation, stability, and reliability because of the non-linear characteristic of the PV system installation. DC/AC and DC/DC converters are the major devices use in connecting PV into the grid. These converters are liable to power quality problem if the proper control mechanism is not adopted. This study presents an optimal control technique to improve dynamic operation of PV grid-connected system. An optimal control method with use of Manta ray foraging optimization (MRFO), is implemented as a control strategy for tuning the proportional-integral (PI) controllers of DC/DC and DC/AC converters for the integration of the PV system into the grid. The MRFO is chosen because of its ease of implementation and requirement of less adjusting parameters. The effectiveness of the proposed technique is studied under irradiance variation. The obtained results demonstrate the superior performance of the MRFO over five other metaheuristic algorithms (i.e., grey wolf optimization, whale optimization, grasshopper optimization, atom search optimization, and salp swarm algorithm) in terms of convergence rate and optimal global solution capture. The entire simulation model is established using MATLAB editor and Simulink. The acquired transient result shows the functionality and viability of the MRFO approach.

An efficient ECG arrhythmia classification method based on Manta ray foraging optimization

In this paper, an accurate model of proton exchange membrane fuel cell (PEMFC) for optimal identification of PEMFC parameters has been developed. The optimization methodology is based on the modified version of Manta Ray Foraging Optimization (MMRFO) technique for minimizing the sum of squared errors (SSE) between the Experimentally measured stack voltage and the estimated voltage produced by the optimized model. In the modified methodology, the sine-cosine method has been utilized to enhance the global searching capability in the exploration phase and the local searching capability in the exploitation phase of the MRFO algorithm. In order to validate the effectiveness of the suggested methodology, four different case studies comprising standard benchmark 250 W PEMFC, BCS-500 W PEMFC, SR-12 500 W FC, and 1 kW Temasek stacks were utilized, and the attainments have been compared with the measured polarization characteristics. The attainments have been intensively compared with several metaheuristic algorithms (MA) including Tree growth Algorithm (TGA), Grey wolf optimizer (GWO), Whale optimization algorithm (WOA), Salp swarm algorithm (SSA), and original Manta Ray Foraging Optimization (MRFO), to confirm the superiority of the MMRFO against the compared techniques. The obtained results give a satisfactory agreement between the MMRFO-based model and the experimentally measured data. Finally, the achievements confirmed the effectiveness of the MMRFO over the basic MRFO algorithm and other novel metaheuristic algorithms in identifying PEMFC parameters.

In this study, an application of Manta Ray Foraging Optimization (MRFO) algorithm is demonstrated for PV parameter extraction. The MRFO is utilized to extract the parameters of both single diode and double diode model R.T.C. France silicon solar cell. The algorithm is easy to implement with less computational time. The MRFO optimizer is compared to Artificial Bee Optimization (ABO) and Flower Pollination Algorithms (FPA) algorithms. The results demonstrated the ability of MRFO for parameter extraction.

With the advance of the communication technology and the massive flow of information across the internet, it is becoming urgent to keep the confidentiality of the transmitted information. Using the internet has been extended to several fields such as e-mail, e-commerce, e-learning, health and medicine, shopping, and so on. Cryptography is the study of different techniques for securing the communication between the sender and the receiver. One of the most known cryptosystems is Merkle–Hellman Knapsack Cryptosystem (MHKC). It is one of the earliest Public Key Cryptosystem (PKC) that is used to secure the messages between the sender and the receiver. Developing a powerful cryptosystem comes after studying the fragility points of the current cryptosystems. The Whale Optimization Algorithm (WOA) is one of the most recent nature-inspired meta-heuristic optimization algorithms, which simulates the social behavior of humpback whales. WOA has validated excellent performance in solving the continuous problems and the engineering optimization problems. This paper introduces a novel Modified version of WOA (MWOA) for cryptanalysis of MHKC. The sigmoid function is used to map the continuous values into discrete one. A penalty function is added to the evaluation function to deal with the infeasible solutions. The mutation operation is employed for improving the solutions. The results show that MWOA is more effective and robust than other algorithms in the literature.

ABSTRACTThe optimal design and installation of hybrid photovoltaic (PV), wind turbine (WT) distributed generation (DG), and battery energy storage system (BESS) in radial distribution network (RDN) using dynamic arithmetic optimization algorithm (DAOA) is the main purpose of this work. The DAOA algorithm is the improved version of arithmetic optimization algorithm (AOA) which is widely used in the field of Electrical Engineering to solve the different optimization tasks. The simultaneous minimization of active power loss and voltage deviation is taken as the objectives to improve the efficiency of the distribution network using hybrid PV/WT/BESS system. To establish the efficacy of the suggested DAOA method, it is examined on two very well‐known test systems (33‐bus and 69‐bus). The uncertainty of power generation from PV‐ and WT‐based DG due to solar irradiance and wind speed variation also is taken into consideration. The cost analysis of the hybrid PV/WT/BESS system as well as active power loss cost are also assessed in this study. The result comparison shows that the DAOA algorithm gives supreme result in case of active power losses, voltage deviation, and benefits in active power lost cost. This algorithm has good speed of response and solution quality when hybrid PV/WT/BESS system allocation problem of the distribution network with simultaneous power loss reduction and voltage deviation minimization is executed in RDN. The placement of hybrid PV/WT/BESS system in 33‐bus reduces the active power loss by 44.27%, 41.47%, 46.23% using DAOA and 44.26%, 39.87%, 45.18% using AOA for normal loading, 15% increased loading, and 10% decreased loading, respectively. Similar results are also observed for 69‐bus test system. Moreover, if the performance of the DAOA, AOA, immune clone selection algorithm (ICSA), clone selection algorithm (CSA), manta ray foraging optimization (MRFO), and particle swarm optimization (PSO) for PV, WT, BESS‐ based 33‐bus system are observed, it can be noticed that DAOA gives annual savings of 10$, 496$, 505$, 669$, and 554$ as compared to AOA, ICSA, CSA, MRFO, and PSO, respectively. Similarly for PV, WT, BESS‐based 69‐bus system, it is observed that DAOA gives annual savings of 29$, 3147$, 3154$, 3342$, and 3158$ as compared to AOA, ICSA, CSA, MRFO, and PSO, respectively. In case of solution quality, the DAOA method grants its superiority over several optimization methods found in the literature.

Pathfinder algorithm (PFA) for finding the best food area or prey based on the leadership of collective action in animal groups is a new metaheuristic algorithm for solving optimization problems with different structures. PFA is divided into two stages to search: pathfinder stage and follower stage. They represent the exploration phase and mining phase of PFA respectively. However, the original algorithm also has the problem of falling into a local optimum. In order to solve this problem, the teaching phase in the teaching and learning algorithm is added to the pathfinder stage in the text. In order to balance the exploration and mining capabilities of the algorithm, the learning phase of the teaching and learning algorithm is added to the follower phase in the article. In order to further enhance the depth search ability of the algorithm and increase the convergence speed, the exponential step is given to the followers. Therefore, a teaching-learning-based pathfinder algorithm (TLPFA) is proposed. 19 benchmark functions of four different types and six engineering design problems are used to test of the TLPFA exploration and exploiting capabilities. The experimental results show that the proposed TLPFA algorithm is superior to the state-of-the-art metaheuristic algorithms in terms of the performance measures.

Snake Robots (SR) have been successfully deployed and proved to attain bio-inspired solutions owing to its capability to move in harsh environments, a characteristic not found in other kinds of robots (like wheeled or legged robots). Underwater Snake Robots (USR) establish a bioinspired solution in the domain of underwater robotics. It is a key challenge to increase the motion efficiency in underwater robots, with respect to forwarding speed, by enhancing the locomotion method. At the same time, energy efficiency is also considered as a crucial issue for long-term automation of the systems. In this aspect, the current research paper concentrates on the design of effectual Locomotion of Bioinspired Underwater Snake Robots using Metaheuristic Algorithm (LBIUSR-MA). The proposed LBIUSR-MA technique derives a bi-objective optimization problem to maximize the Forward Velocity (FV) and minimize the Average Power Consumption (APC). LBIUSR-MA technique involves the design of Manta Ray Foraging Optimization (MRFO) technique and derives two objective functions to resolve the optimization issue. In addition to these, effective weighted sum technique is also used for the integration of two objective functions. Moreover, the objective functions are required to be assessed for varying gait variables so as to inspect the performance of locomotion. A detailed set of simulation analyses was conducted and the experimental results demonstrate that the developed LBIUSR-MA method achieved a low Average Power Consumption (APC) value of 80. under δ value of 50. The proposed model accomplished the minimum PAC and maximum FV of USR in an effective manner.

Virtualization is a transformative technology that enables multiple virtual machines to operate concurrently on a single physical host, thereby rationalizing resource utilization in cloud data centers. These data centers consist of multiple servers and consume a significant amount of energy, which requires cloud providers to have mechanisms that optimize the placement of virtual machines in these servers. An optimal placement allows for a decrease in the energy consumed and an increase in the resource usage rate. In this paper, we introduce a novel algorithm based on a recent bio-inspired metaheuristic called Manta Ray Foraging Optimization (MRFO) to solve the virtual machine placement problem. Although MRFO was recently proposed in order to solve optimization problems for engineering applications, to the best of our knowledge, it has never been used to solve the virtual machines placement problem in the cloud. Accordingly, this paper investigates for the first time an enhanced version of the MRFO algorithm to solve the virtual machine placement problem. The proposed algorithm is evaluated with CloudSim toolkit under various performance metrics, including energy consumption, resource utilization, and number of active servers. Simulation results show that our approach outperforms five well-known metaheuristics widely adopted in this field, namely Simulated Annealing (SA), Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Salp Swarm Algorithm (SSA), and Whale Optimization Algorithm (WOA).

An automated metaheuristic-optimized approach for diagnosing and classifying brain tumors based on a convolutional neural network

Several optimization problems from various types of applications have been efficiently resolved using available meta-heuristic algorithms such as Particle Swarm Optimization and Genetic Algorithm. Recently, many meta-heuristic optimization techniques have been extensively reported in the literature. Nevertheless, there is still room for new optimization techniques and strategies since, according to the literature, there is no meta-heuristic optimization algorithm that may be considered as the best choice to cope with all modern optimization problems. This paper introduces a novel meta-heuristic optimization algorithm named Dynamic Group-based Optimization Algorithm (DGCO). The proposed algorithm is inspired by the cooperative behavior adopted by swarm individuals to achieve their global goals. DGCO has been validated and tested against twenty-three mathematical optimization problems, and the results have been verified by a comparative study with respect to state-of-the-art optimization algorithms that are already available. The results have shown the high exploration capabilities of DGCO as well as its ability to avoid local optima. Moreover, the performance of DGCO has also been verified against five constrained engineering design problems. The results demonstrate the competitive performance and capabilities of DGCO with respect to well-known state-of-the-art meta-heuristic optimization algorithms. Finally, a sensitivity analysis is performed to study the effect of different parameters on the performance of the DGCO algorithm.

This paper introduces a hybrid mutualism based pathfinder algorithm (mPFA) for solving the bid-based dynamic economic load dispatch (BBDED) problem by taking into consideration of various bidding strategies in a deregulated environment. In a deregulated environment BBDED problem is evolved to achieve different goals, such as resource scheduling, maximize social profits, and simultaneously to intend power system security. The IEEE-30 bus test system is considered, which contains 6-power generators and 2-consumers who are supposed to bid in two separate trading periods under various bidding strategies in a day-ahead electricity market. The market co-ordinator known as independent system operator (ISO) matches different bids received from supply and demand side participants and tries to maximize the social profit. In this work, a novel hybrid meta-heuristic algorithm, namely mPFA is proposed, which combines the Pathfinder algorithm (PFA) and the mutualism phase of the Symbiotic Organisms Search (SOS) algorithm. The proposed mPFA scheme avoids the slow and premature convergence of original PFA by exploration with PFA and exploitation with the mutualism phase of SOS. The proposed hybrid scheme was compared to different meta-heuristic algorithms, including Pathfinder algorithm (PFA), Differential Evolution (DE) algorithm, particle swarm optimizer (PSO), and Salp Swarm Algorithm (SSA). The simulation results show that mPFA has the capability and adequacy to solve BBDED.

Software defined network (SDN) has shown significant advantages in numerous real-life aspects with separating the control plane from the data plane that provides programmable management for networks. However, with the increase in the network size, a single controller of SDN imposes considerable limitations on various features. Therefore, in networks with immense scalability, multiple controllers are essential. Specifying the optimal number of controllers and their deployment place is known as the controller placement problem (CPP), which affects the network's performance. In the present paper, a novel controller placement algorithm has been introduced using the advantages of nature-inspired optimization algorithms and network portioning. Firstly, the Manta Ray Foraging Optimization (MRFO) and Salp Swarm Algorithm (SSA) have been discretized to solve CPP. Three new operators comprising a two-point swap, random insert, and half points crossover operators were introduced to discretized the algorithms. Afterward, the resulting discrete MRFO and SSA algorithms were hybridized in a promoting manner. Next, the proposed discrete algorithm has been evaluated on six well-known software-defined networks with a different number of controllers. In addition, the networks have been chosen from various sizes to evaluate the scalability of the proposed algorithm. The proposed algorithm has been compared with several other state-of-the-art algorithms regarding network propagation delay and convergence rate in experiments. The findings indicated the effectiveness of the contributions and the superiority of the proposed algorithm over the competitor algorithms.