Search results

The purpose of this paper is to propose an enhanced elephant herding optimization (EEHO) algorithm by improving the exploration phase to overcome the fast-unjustified convergence toward the origin of the native EHO. The exploration and exploitation of the proposed EEHO are achieved by updating both clan and separation operators.

The original EHO shows fast unjustified convergence toward the origin specifically, a constant function is used as a benchmark for inspecting the biased convergence of evolutionary algorithms. Furthermore, the star discrepancy measure is adopted to quantify the quality of the exploration phase of evolutionary algorithms in general.

In experiments, EEHO has shown a better performance of convergence rate compared with the original EHO. Reasons behind this performance are: EEHO proposes a more exploitative search method than the one used in EHO and the balanced control of exploration and exploitation based on fixing clan updating operator and separating operator. Operator γ is added to EEHO assists to escape from local optima, which commonly exist in the search space. The proposed EEHO controls the convergence rate and the random walk independently. Eventually, the quantitative and qualitative results revealed that the proposed EEHO outperforms the original EHO.

Therefore, the pros and cons are reported as follows: pros of EEHO compared to EHO – 1) unbiased exploration of the whole search space thanks to the proposed update operator that fixed the unjustified convergence of the EHO toward the origin and the proposed separating operator that fixed the tendency of EHO to introduce new elephants at the boundary of the search space; and 2) the ability to control exploration–exploitation trade-off by independently controverting the convergence rate and the random walk using different parameters – cons EEHO compared to EHO: 1) suitable values for three parameters (rather than two only) have to be found to use EEHO.

As the original EHO shows fast unjustified convergence toward the origin specifically, the search method adopted in EEHO is more exploitative than the one used in EHO because of the balanced control of exploration and exploitation based on fixing clan updating operator and separating operator. Further, the star discrepancy measure is adopted to quantify the quality of exploration phase of evolutionary algorithms in general. Operator γ that added EEHO allows the successive local and global searching (exploration and exploitation) and helps escaping from local minima that commonly exist in the search space.

In modern technology, the wireless sensor networks (WSNs) are generally most promising solutions for better reliability, object tracking, remote monitoring and more, which is directly related to the sensor nodes. Received signal strength indication (RSSI) is main challenges in sensor networks, which is fully depends on distance measurement. The learning algorithm based traditional models are involved in error correction, distance measurement and improve the accuracy of effectiveness. But, most of the existing models are not able to protect the user’s data from the unknown or malicious data during the signal transmission. The simulation outcomes indicate that proposed methodology may reach more constant and accurate position states of the unknown nodes and the target node in WSNs domain than the existing methods.

This paper present a deep convolutional neural network (DCNN) from the adaptation of machine learning to identify the problems on deep ranging sensor networks and overthrow the problems of unknown sensor nodes localization in WSN networks by using instance parameters of elephant herding optimization (EHO) technique and which is used to optimize the localization problem.

In this proposed method, the signal propagation properties can be extracted automatically because of this image data and RSSI data values. Rest of this manuscript shows that the ECO can find the better performance analysis of distance estimation accuracy, localized nodes and its transmission range than those traditional algorithms. ECO has been proposed as one of the main tools to promote a transformation from unsustainable development to one of sustainable development. It will reduce the material intensity of goods and services.

The proposed technique is compared to existing systems to show the proposed method efficiency. The simulation results indicate that this proposed methodology can achieve more constant and accurate position states of the unknown nodes and the target node in WSNs domain than the existing methods.

In a wireless sensor network (WSN), the sensor nodes are distributed in the network, and in general, they are linked through wireless intermediate to assemble physical data. The nodes drop their energy after a specific duration because they are battery-powered, which also reduces network lifetime. In addition, the routing process and cluster head (CH) selection process is the most significant one in WSN. Enhancing network lifetime through balancing path reliability is more challenging in WSN. This paper aims to devise a multihop routing technique with developed IIWEHO technique.

In this method, WSN nodes are simulated originally, and it is fed to the clustering process. Meanwhile, the CH is selected with low energy-based adaptive clustering model with hierarchy (LEACH) model. After CH selection, multipath routing is performed by developed improved invasive weed-based elephant herd optimization (IIWEHO) algorithm. In addition, the multipath routing is selected based on certain fitness functions like delay, energy, link quality and distance. However, the developed IIWEHO technique is the combination of IIWO method and EHO algorithm.

The performance of developed optimization method is estimated with different metrics, like distance, energy, delay and throughput and achieved improved performance for the proposed method.

This paper presents an effectual multihop routing method, named IIWEHO technique in WSN. The developed IIWEHO algorithm is newly devised by incorporating EHO and IIWO approaches. The fitness measures, which include intra- and inter-distance, delay, link quality, delay and consumption of energy, are considered in this model. The proposed model simulates the WSN nodes, and CH selection is done by the LEACH protocol. The suitable CH is chosen for transmitting data through base station from the source to destination. Here, the routing system is devised by a developed optimization technique. The selection of multipath routing is carried out using the developed IIWEHO technique. The developed optimization approach selects the multipath depending on various multi-objective functions.

The principal intention behind the activity is to regulate the speed, current and commutation of the brushless DC (BLDC) motor. Thereby, the authors can control the torque.

In order to regulate the current and speed of the motor, the Multi-resolution PID (MRPID) controller is proposed. The altered Landsman converter is utilized in this proposed suppression circuit, and the obligation cycle is acclimated to acquire the ideal DC-bus voltage dependent on the speed of the BLDC motor. The adaptive neuro-fuzzy inference system-elephant herding optimization (ANFIS-EHO) calculation mirrors the conduct of the procreant framework in families.

Brushless DC motor's dynamic properties are created, noticed and examined by MATLAB/Simulink model. The performance will be compared with existing genetic algorithms.

The presented approach and performance will be compared with existing genetic algorithms and optimization of different structure of BLDC motor.

This paper aims to design three low-power and area-efficient serial input parallel output (SIPO) register designs, namely, transistor count reduction technique shift register (TCRSR), series stacking in TCR shift register (S-TCRSR) and forced stacking of transistor in TCR shift register (FST in TCRSR). Shift registers (SR) are the basic building blocks of all types of digital applications. The performance of all the designs has been improved through one of the metaheuristic algorithms named elephant herding optimization (EHO) algorithm and hence suited for low-power very large scale integration (VLSI) applications. It is for the first time that the EHO algorithm is implemented in memory elements.

The registers together with clock network consume 18-36 percentage of the total power consumption of a microprocessor. The proposed designs are implemented using low-power and high-performance double edge-triggered D flip-flops with least count of clocked transistors involving transmission gate. The second and third register designs are developed from the modified version of the first one employing series and forced stacking, thereby reducing static power because of sub-threshold leakage current. The performance parameters such as power-delay-product (PDP) and leakage power are further optimized using the EHO algorithm. A greater reduction in power is achieved in all the designs by utilizing the EHO algorithm.

All the designs are simulated at a supply voltage of 1 V/500 MHz when the input switching activity is 25 percentage in Cadence Virtuoso using 45 nm CMOS technology. Nine recently proposed SR designs are simulated in the same conditions, and the performance has been compared with the proposed ones. The simulated results prove the excellence of proposed designs in different performance parameters like leakage power, energy-delay-product (EDP), PDP, layout area compared with the recent designs. The PDPdq value has a reduction of 95.9per cent (TCRSR), 96.6per cent (S-TCRSR) and 97per cent (FST in TCRSR) with that of a conventional shift register (TGSR).

The performance of proposed low-power SR designs is enhanced using EHO algorithm. The optimized performance results have been compared with a few optimization algorithms. It is for the first time that EHO algorithm is implemented in memory elements.

The solar photovoltaic (PV) system is one of the outstanding, clean and green energy options available for electrical power generation. The varying meteorological operating conditions impose various challenges in extracting maximum available power from the solar PV system. The drawbacks of conventional and evolutionary algorithms-based maximum power point tracking (MPPT) approaches are its inability to extract maximum power during partial shading conditions and quickly changing irradiations. Hence, the purpose of this paper is to propose a modified elephant herding optimization (MEHO) based MPPT approach to track global maximum power point (GMPP) proficiently during dynamic and steady state operations within less time.

A MEHO-based MPPT approach is proposed in this paper by incorporating Gaussian mutation (GM) in the original elephant herding optimization (EHO) to enhance the optimizing capability of determining the optimal value of DC–DC converter’s duty cycle (D) to operate at GMPP.

The effectiveness of the proposed system is compared with EHO based MPPT, Firefly Algorithm (FA) MPPT and particle swarm optimization (PSO) MPPT during uniform irradiation condition (UIC) and partial shading situation (PSS) using simulation results. An experimental setup has been designed and implemented. Simulation results obtained are validated through experimental results which prove the viability of the proposed technique for an efficient green energy solution.

With the proposed MEHO MPPT, it has been noted that the settling period is lowered by 3.1 times in comparison of FA MPPT, 1.86 times when compared to PSO based MPPT and 1.29 times when compared to EHO based MPPT with augmented efficiency of 99.27%.

Association rule mining generates the patterns and correlations from the database, which requires large scanning time, and the cost of computation associated with the generation of the rules is quite high. On the other hand, the candidate rules generated using the traditional association rules mining face a huge challenge in terms of time and space, and the process is lengthy. In order to tackle the issues of the existing methods and to render the privacy rules, the paper proposes the grid-based privacy association rule mining.

The primary intention of the research is to design and develop a distributed elephant herding optimization (EHO) for grid-based privacy association rule mining from the database. The proposed method of rule generation is processed as two steps: in the first step, the rules are generated using apriori algorithm, which is the effective association rule mining algorithm. In general, the extraction of the association rules from the input database is based on confidence and support that is replaced with new terms, such as probability-based confidence and holo-entropy. Thus, in the proposed model, the extraction of the association rules is based on probability-based confidence and holo-entropy. In the second step, the generated rules are given to the grid-based privacy rule mining, which produces privacy-dependent rules based on a novel optimization algorithm and grid-based fitness. The novel optimization algorithm is developed by integrating the distributed concept in EHO algorithm.

The experimentation of the method using the databases taken from the Frequent Itemset Mining Dataset Repository to prove the effectiveness of the distributed grid-based privacy association rule mining includes the retail, chess, T10I4D100K and T40I10D100K databases. The proposed method outperformed the existing methods through offering a higher degree of privacy and utility, and moreover, it is noted that the distributed nature of the association rule mining facilitates the parallel processing and generates the privacy rules without much computational burden. The rate of hiding capacity, the rate of information preservation and rate of the false rules generated for the proposed method are found to be 0.4468, 0.4488 and 0.0654, respectively, which is better compared with the existing rule mining methods.

Data mining is performed in a distributed manner through the grids that subdivide the input data, and the rules are framed using the apriori-based association mining, which is the modification of the standard apriori with the holo-entropy and probability-based confidence replacing the support and confidence in the standard apriori algorithm. The mined rules do not assure the privacy, and hence, the grid-based privacy rules are employed that utilize the adaptive elephant herding optimization (AEHO) for generating the privacy rules. The AEHO inherits the adaptive nature in the standard EHO, which renders the global optimal solution.

Adsorption parameters (e.g. Langmuir constant, mass transfer coefficient and Thomas rate constant) are involved in the design of aqueous-media adsorption treatment units. However, the classic approach to estimating such parameters is perceived to be imprecise. Herein, the essential features and performances of the ant colony, bee colony and elephant herd optimisation approaches are introduced to the experimental chemist and chemical engineer engaged in adsorption research for aqueous systems. Key research and development directions, believed to harness these algorithms for real-scale water treatment (which falls within the wide-ranging coverage of the Sustainable Development Goal 6 (SDG 6) ‘Clean Water and Sanitation for All’), are also proposed. The ant colony, bee colony and elephant herd optimisations have higher precision and accuracy, and are particularly efficient in finding the global optimum solution. It is hoped that the discussions can stimulate both the experimental chemist and chemical engineer to delineate the progress achieved so far and collaborate further to devise strategies for integrating these intelligent optimisations in the design and operation of real multicomponent multi-complexity adsorption systems for water purification.

The advancements in the cloud computing has gained the attention of several researchers to provide on-demand network access to users with shared resources. Cloud computing is important a research direction that can provide platforms and softwares to clients using internet. However, handling huge number of tasks in cloud infrastructure is a complicated task. Thus, it needs a load balancing (LB) method for allocating tasks to virtual machines (VMs) without influencing system performance. This paper aims to develop a technique for LB in cloud using optimization algorithms.

This paper proposes a hybrid optimization technique, named elephant herding-based grey wolf optimizer (EHGWO), in the cloud computing model for LB by determining the optimal VMs for executing the reallocated tasks. The proposed EHGWO is derived by incorporating elephant herding optimization (EHO) in grey wolf optimizer (GWO) such that the tasks are allocated to the VM by eliminating the tasks from overloaded VM by maintaining the system performance. Here, the load of physical machine (PM), capacity and load of VM is computed for deciding whether the LB has to be done or not. Moreover, two pick factors, namely, task pick factor (TPF) and VM pick factor (VPF), are considered for choosing the tasks for reallocating them from overloaded VM to underloaded VM. The proposed EHGWO decides the task to be allocated in the VM based on the newly derived fitness functions.

The minimum load and makespan obtained in the existing methods, constraint measure based LB (CMLB), fractional dragonfly based LB algorithm (FDLA), EHO, GWO and proposed EHGWO for the maximum number of VMs is illustrated. The proposed EHGWO attained minimum makespan with value 814,264 ns and minimum load with value 0.0221, respectively. Meanwhile, the makespan values attained by existing CMLB, FDLA, EHO, GWO, are 318,6896 ns, 230,9140 ns, 1,804,851 ns and 1,073,863 ns, respectively. The minimum load values computed by existing methods, CMLB, FDLA, EHO, GWO, are 0.0587, 0.026, 0.0248 and 0.0234. On the other hand, the proposed EHGWO with minimum load value is 0.0221. Hence, the proposed EHGWO attains maximum performance as compared to the existing technique.

This paper illustrates the proposed LB algorithm using EHGWO in a cloud computing model using two pitch factors, named TPF and VPF. For initiating LB, the tasks assigned to the overloaded VM are reallocated to under loaded VMs. Here, the proposed LB algorithm adapts capacity and loads for the reallocation. Based on TPF and VPF, the tasks are reallocated from VMs using the proposed EHGWO. The proposed EHGWO is developed by integrating EHO and GWO algorithm using a new fitness function formulated by load of VM, migration cost, load of VM, capacity of VM and makespan. The proposed EHGWO is analyzed based on load and makespan.