Search

This paper deals with the challenging problem of scheduling users' tasks, while taking into consideration users' quality of service (QoS) requirements, with the objective of reducing the energy consumption of physical machines. This paper presents a model to analyze the current state of the running tasks according to the results of the QoS prediction assigned by an ARIMA prediction model optimized with Kalman filter. Then, we calculate a scheduling policy with a combined particle swarm optimization (PSO) and gravitational search algorithm (GSA) algorithms according to the QoS status analysis. Experimental results show that the proposed HPSO algorithm reduces resources consumption 16.51% more than the original hybrid algorithm, and the violation of service-level agreement (SLA) is 0.053% less when the optimized prediction model is used. [ABSTRACT FROM AUTHOR]

BeiDou-3 satellites have short-message communication capabilities, which are not available in other navigation systems. However, the information transmission capacities of BeiDou-3 satellites are limited, which means that the string length of a single transmission is restricted. To improve transmission performance, this paper proposes a lossy data compression algorithm to transmit ship data. First, due to the large amount of measurement noise in the ship data and the difficulty of adaptively adjusting the compression threshold of the swinging door trend, a dynamic threshold adjustment strategy based on model-free adaptive control is designed. Furthermore, because the performance of the strategy depends on the initial value, chaos multilayer particle swarm optimization is employed to optimize the strategy and achieve better generalization and convergence performance. In addition, this paper introduces an experimental system and uses real ship motor vibration and electromagnetic radiation data to verify the compression algorithm. The experimental results indicate that the proposed algorithm displays reasonable performance. Presently, the system designed in this paper has been operating stably for more than six months. [ABSTRACT FROM AUTHOR]

Dynamic vibration absorbers (DVAs) are widely used in engineering practice because of their good vibration control performance. Structural design or parameter optimization could improve its control efficiency. In this paper, the viscoelastic Maxwell-type DVA model with an inerter and multiple stiffness springs is investigated with the combination of the traditional theory and an intelligent algorithm. Firstly, the expressions and approximate optimal values of the system parameters are obtained using the fixed-point theory to deal with the H ∞ optimization problem, which can provide help with the range of parameters in the algorithm. Secondly, we innovatively introduce the particle swarm optimization (PSO) algorithm to prove that the algorithm could adjust the value of the approximate solution to minimize the maximum amplitude by analyzing and optimizing the single variable and four variables. Furthermore, the validity of the parameters is further verified by simulation between the numerical solution and the analytical solution using the fourth-order Runge–Kutta method. Finally, the DVA demonstrated in this paper is compared with typical DVAs under random excitation. The timing sequence and variances, as well as the decreased ratios of the displacements, show that the presented DVA has a more satisfactory control performance. The inerter and negative stiffness spring can indeed bring beneficial effects to the vibration absorber. Remarkably, the intelligent algorithm can make the resonance peaks equal in the parameter optimization of the vibration absorber, which is quite difficult to achieve with theoretical methods at present. The results may provide a theoretical and computational basis for the optimization design of DVA. [ABSTRACT FROM AUTHOR]

Fuzzy neural network (FNN) is the product of the combination of fuzzy theory and neural network. It combines the advantages of neural network and fuzzy theory, which has achieved great success in various fields. However, on the one hand, when the practical input is intricate and high dimensional data, the existing FNN can't achieve a good modeling effect in the speed of convergence, the accuracy of modeling and generalization ability. On the other hand, the number of rules in FNN is fixed, which will also lead to the above problems in nonlinear system modeling. In this paper, a self-organizing fuzzy neural network based on Particle Swarm Optimization with improved Levenberg-Marquardt learning algorithm (SOFNN-PSO-ILM) is proposed for nonlinear system modeling. First, SOFNN based on PSO-ILM is built online by a method of constantly learning parameters and structures. In the process of structures learning, the number of fuzzy rules that have been set can be self-designed with the growing and pruning algorithm, which is based on the size of the singular value. In the process of parameters learning, PSO algorithm combined with ILM algorithm is used to update parameters. Then, the convergence and stability of SOFNN based on PSO-ILM are analyzed. Finally, the proposed method is used to model in the nonlinear system by three examples. The modeling results demonstrate that the proposed SOFNN based on PSO-ILM can model in nonlinear systems effectively. [ABSTRACT FROM AUTHOR]

The Equilibrium Optimizer (EO) algorithm is a new meta-heuristic algorithm that uses an equilibrium pool and candidates to update particles (solutions). EO algorithm not only has strong exploitation and exploration capabilities but also avoids falling into the local optimum. The reason why EO has these advantages is because of the existence of "generation rate". This paper proposes an Enhanced Equilibrium Optimizer (EEO) Algorithm based on three communication strategies to solve the Job Shop Scheduling Problem (JSSP). To prove the accuracy of the algorithm, this paper uses 28 benchmark functions for testing. At the same time, the Enhanced Equilibrium Optimizer (EEO1, EEO2, EEO3) Algorithms are compared with the existing optimization methods, including Grey Wolf Optimizer (GWO), Multi-Version Optimizer (MVO), Differential Evolution (DE), Whale Optimization Algorithm (WOA). Experiments show that the EO algorithm is significantly better than GWO, MVO, DE, WOA. EO algorithm is mainly used to optimize continuous problems, but JSSP is a discrete application, so the standard equilibrium optimizer algorithm needs to be discretized. This paper extends the enhanced equilibrium optimizer algorithm and adds discretization processing to JSSP. The algorithm is also applied for the job shop scheduling problem by discretization and is compared with the three improvement methods of EEO. Experimental results prove that the algorithm has made significant improvements in solving JSSP. [ABSTRACT FROM AUTHOR]

Copyright of Fishery Modernization is the property of Fishery Modernization Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The marine predators algorithm (MPA) is a metaheuristic algorithm for solving optimization problems. MPA divides the whole optimization process into three phases evenly, and each phase corresponds to a different search agent update strategy. Such a setup makes MPA inflexible when facing different optimization problems, which affects the optimization performance. In this paper, we propose a novel modified MPA hybridizing by Q-learning (QMPA), which applies reinforcement learning to the selection of update strategy, and selects the most appropriate position update strategy for search agents in different iteration stages and states. It can effectively compensate for the deficiency of MPA's adaptive ability when facing different optimization problems. The performance of QMPA is tested on classical benchmark functions, the CEC2014 test suite, and engineering problems. In the classical benchmark functions test, QMPA is compared with MPA in 10, 30, and 50 dimensions. QMPA performs better than MPA for seven of the ten functions when the dimension is 10 and 30. The results of dimension 50 show that QMPA outperforms MPA in 5 functions and is close to it in 4 functions. Then, comparing QMPA with algorithms such as grey wolf optimizer, particle swarm optimization, slime mould algorithm, sine cosine algorithm, reptile search algorithm, and aquila optimizer, the results show that QMPA has the best performance on 22 of the total 30 functions in the CEC2014 test suite. Finally, QMPA is tested on two commonly used real-world engineering problems and gives the most optimal results. In general, the adaptive update strategy proposed in this paper improves the optimization performance of the MPA algorithm in terms of convergence and stability. [ABSTRACT FROM AUTHOR]

This paper investigates the dynamic access point (AP) clustering and precoding problem in the downlink of user-centric virtual cell networks. The goal is to maximize the weighted sum spectral efficiency (SE) while satisfying the power constraints and AP clustering constraints in adjacent time slots (TSs). By adopting the random walk mobility to model the mobile user equipments’ movement behaviors, we consider dynamic and time-varying channel conditions. Therefore, the weighted sum SE maximization programming takes the form of discrete-time sequence of mixed-integer non-convex optimization problems. In this paper, we propose to solve this sequential problem in two stages. In the first stage, a dynamic AP clustering approach based on discrete particle swarm optimization is developed. This approach takes the advantage of the channel correlation by exploiting the relationship between AP clustering solutions in adjacent TSs to improve the SE performance and reduce complexity. In the second stage, given the AP clustering solution obtained in the first stage, a distributed precoding algorithm is devised via applying the weighted minimum mean square error method. By combining these two stages, we propose a novel dynamic AP clustering and precoding algorithm (DAPC-Pre). The effectiveness of the proposed DAPC-Pre algorithm is verified by the simulation results. In particular, the proposed algorithm converges fast and significantly outperforms benchmark algorithms in terms of sum SE under different dynamic environments. [ABSTRACT FROM AUTHOR]

Bat algorithm is an effective swarm intelligence optimization algorithm which is widely used to solve continuous optimization problems. But it still has some limitations in search process and can't solve discrete optimization problems directly. Therefore, this paper introduces an unordered pair and proposes an unordered pair bat algorithm (UPBA) to make it more suitable for solving symmetric discrete traveling salesman problems. To verify the effectiveness of this method, the algorithm has been tested on 23 symmetric benchmarks and compared its performance with other algorithms. The results have shown that the proposed UPBA outperforms all the other alternatives significantly in most cases. [ABSTRACT FROM AUTHOR]

The paper proposed a new algorithm to solve the Multiskill Resource-Constrained Project Scheduling Problem (MS-RCPSP), a combinational optimization problem proved in NP-Hard classification, so it cannot get an optimal solution in polynomial time. The NP-Hard problems can be solved using metaheuristic methods to evolve the population over many generations, thereby finding approximate solutions. However, most metaheuristics have a weakness that can be dropping into local extreme after a number of evolution generations. The new algorithm proposed in this paper will resolve that by detecting local extremes and escaping that by moving the population to new space. That is executed using the Migration technique combined with the Particle Swarm Optimization (PSO) method. The new algorithm is called M-PSO. The experiments were conducted with the iMOPSE benchmark dataset and showed that the M-PSO was more practical than the early algorithms. [ABSTRACT FROM AUTHOR]

This paper reviews recent studies on the Particle Swarm Optimization (PSO) algorithm. The review has been focused on high impact recent articles that have analyzed and/or modified PSO algorithms. This paper also presents some potential areas for future study. [ABSTRACT FROM AUTHOR]

Salp swarm algorithm (SSA) is an excellent meta‐heuristic algorithm, which has been widely used in the engineering field. However, there is still room for improvement in terms of convergence rate and solution accuracy. Therefore, this paper proposes an enhanced parallel salp swarm algorithm based on the Taguchi method (PTSSA). The parallel trick is to split the initial population uniformly into several subgroups and then exchange information among the subgroups after a fixed number of iterations, which speeds up the convergence. Communication strategies are an important component of parallelism techniques. The Taguchi method is widely used in the industry for optimizing product and process conditions. In this paper, the Taguchi method is adopted into the parallelization technique as a novel communication strategy, which improves the robustness and accuracy of the solution. The proposed algorithm was also tested under the CEC2013 test suite. Experimental results show that PTSSA is more competitive than some common algorithms. In addition, PTSSA is applied to optimize the operation of a heatless combined cooling‐power system. Simulation results show that the optimized operation provided by PTSSA is more stable and efficient in terms of operating cost reduction. [ABSTRACT FROM AUTHOR]

Accurate localization of partial discharge in GIS equipment remains a key focus of daily maintenance for substations, which can be achieved through advanced detection and location techniques, as well as regular maintenance and testing of the equipment. However, there is currently an issue with low accuracy in the localization algorithm. Aiming at the problems of low precision and local optimization of the swarm intelligence algorithm in partial discharge localization system of GIS equipment, this paper proposes a 3D localization algorithm based on a time difference of arrival (TDOA) model of the improved artificial fish swarm algorithm (IAFSA). By introducing the investigation behaviour of the artificial bee colony(ABC) algorithm into the artificial fish swarms algorithm (AFSA), this algorithm is more efficient to jump out of the local extremum, enhance the optimization performance, improve the global search ability and overcome the premature convergence. Furthermore, more precise positioning can be achieved with dynamic parameters. The results of the testing function show that IAFSA is significantly superior to AFSA and particle swarm optimization (PSO) in terms of positioning accuracy and stability. When applied to partial discharge localization experiments, the maximum relative positioning error is less than 2.5%. This validates that the proposed method in this paper can achieve high-precision partial discharge localization, has good engineering application value, and provides strong support for the safe operation of GIS equipment. [ABSTRACT FROM AUTHOR]

In the 5G era, the amount of network data has grown explosively. A large number of new computation-intensive applications have created demand for edge computing in mobile networks. Traditional optimization methods are difficult to adapt to the dynamic wireless network environment because they solve the problem online, which is not suitable in edge computing scenarios. Therefore, in order to obtain a mobile network with better performance, we propose a network frame with a resource allocation algorithm based on power consumption, delay and user cooperation. This algorithm can quickly realize the optimization of a network to improve performance. Specifically, compared with heuristic algorithms, such as particle swarm optimization, ant colony algorithm, etc., commonly used to solve such problems, the algorithm proposed in this paper can reduce some aspects of network performance (including delay and user energy consumption) by about 10% in a network dominated by downlink tasks. The performance of the algorithm under certain network conditions was demonstrated through simulations. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Multi-stage disc rotor assembly is an important part of the aero-engine rotor manufacturing process. To solve the problem that excessive unbalance of assembly affects the vibration of the whole machine, this paper presents an optimization method for aero-engine rotor assembly balance based on an improved Harris Hawk algorithm. Firstly, the assembly sequence model of the single-stage disc blade and the phase assembly model of a multi-stage disc of the engine rotor is established. Secondly, by using the initial population generation based on dynamic opposing learning and the escape energy function of the non-linear logarithmic convergence factor, the search mechanism of the whale optimization algorithm is introduced in the global exploration, and the adaptive weight strategy and mutation strategy of the genetic algorithm is introduced in the development to improve the algorithm. Then, the effectiveness of the algorithm is verified by experiments and compared with particle swarm optimization, genetic algorithm, and Harris Hawk algorithm, the unbalance of the optimal blade assembly sequence is reduced by 91.75%, 99.82%, and 83.39%, respectively. The algorithm comparison and analysis are carried out for all disc-blade assembly optimization of the rotor. The optimal unbalance of the improved Harris Hawk optimization algorithm is reduced by 79.71%, 99.48%, and 54.92% on average. The unbalance of the algorithm in this paper is the best. Finally, the improved Harris Hawk algorithm is used to find the best assembly phase, and the optimized unbalanced force and moment are reduced by 84.22% and 98.05%, respectively. The results of this study prove that the improved Harris Hawk algorithm for aero-engine rotor assembly balance optimization can effectively reduce the unbalance of rotor disc blade assembly and rotor unbalance and provide a powerful solution for solving engine vibration. [ABSTRACT FROM AUTHOR]

The main objective of this paper is to present a new 2-stage hybrid optimization algorithm based scheme named PSO-BHA for image enhancement. A parameterized mapping function and a novel objective function are utilized in this paper to achieve the best-enhanced images. The suggested scheme combines the merits of particle swarm optimization (PSO) with the black hole algorithm (BHA) in two sequential stages to find the best parameters for the mapping function with the aid of the proposed objective function. The objective function uses contrast, edge, entropy, and universal quality index (UQI) for measuring contrast, and different improved information in the enhanced image. In the proposed scheme, PSO is applied first to adjust the tunable parameters of the mapping function and as a result, new pixel intensities are produced. Then, in the second stage, the obtained pixel intensities are again passed through the mapping function whose parameters are tuned by the use of the BHA. The suggested framework overcomes the limitations of the traditional histogram equalization (HE) based enhancement techniques in which excessive contrast enhancement and image information loss can occur. The suggested method is evaluated on several test images and compared with different state-of-the-art methods. The results indicate that the proposed framework provides superior performance to all existing methods in terms of various metrics. The proposed scheme also contributes to substantial feature enhancement and contrast boosting in the enhanced image, while retaining the natural feel of the original image. [ABSTRACT FROM AUTHOR]

This paper proposes a new method for predicting rotation error based on improved grey wolf–optimized support vector regression (IGWO-SVR), because the existing rotation error research methods cannot meet the production beat and product quality requirements of enterprises, because of the disadvantages of its being time-consuming and having poor calculation accuracy. First, the grey wolf algorithm is improved based on the optimal Latin hypercube sampling initialization, nonlinear convergence factor, and dynamic weights to improve its accuracy in optimizing the parameters of the support vector regression (SVR) model. Then, the IGWO-SVR prediction model between the manufacturing error of critical parts and the rotation error is established with the RV-40E reducer as a case. The results show that the improved grey wolf algorithm shows better parameter optimization performance, and the IGWO-SVR method shows better prediction performance than the existing back propagation (BP) neural network and BP neural network optimized by the sparrow search algorithm rotation error prediction methods, as well as the SVR models optimized by particle swarm algorithm and grey wolf algorithm. The mean squared error of IGWO-SVR model is 0.026, the running time is 7.843 s, and the maximum relative error is 13.5%, which can meet the requirements of production beat and product quality. Therefore, the IGWO-SVR method can be well applied to the rotate vector (RV) reducer parts-matching model to improve product quality and reduce rework rate and cost. [ABSTRACT FROM AUTHOR]

The purpose of image segmentation is to select the target region from the existing image, which is the core technology for image understanding, description and analysis. When faced with some complicated problems, the image segmentation effect of the traditional method is often unsatisfactory. As a branch of the swarm intelligence optimization algorithm, Particle Swarm Optimization (PSO) provides a new power and direction for the development of image segmentation. However, the algorithm has a large probability of loss of particle diversity in the late stage, which makes the algorithm converge prematurely. Therefore, the purpose of this paper is to improve the problem existing in the PSO algorithm and apply the improved algorithm in image segmentation. In this paper, the whole population of PSO algorithm is divided into multiple sub-populations and co-evolution. The mutation operation from the genetic algorithm is introduced at the same time. The worst sub-population is mutated according to the mutation probability. The larger inertia factor is selected to speed the particles. Update, and then carry out simulation experiments on some classical test functions. Finally, combined with the improved PSO algorithm and fuzzy C-means clustering algorithm (FCM), the fuzzy clustering validity index is introduced, and the blood cell image is segmented by the algorithm. The experimental results show that the algorithm can find a reasonable number of cluster center segmentation categories and efficiently perform adaptive segmentation of images. [ABSTRACT FROM AUTHOR]

Particle Swarm Optimization (PSO) is a popular technique used to solve optimization problems in WSNs due to its simplicity, high quality of solution, fast convergence and insignificant computational burden. However, iterative nature of PSO can prohibit its use for high-speed real-time applications, especially if optimization needs to be carried out frequently. This paper outlines issues in WSNs, introduces PSO and discusses its suitability for WSN applications. It also presents a brief survey of how PSO is tailored to address these issues. The objective of this paper is to give a flavor of PSO to researchers in WSN, and to give a qualitative treatment of optimization problems in WSNs to PSO researchers in order to promote PSO in WSN applications. [ABSTRACT FROM AUTHOR]

In this paper, a cognitive electronic jamming decision-making method based on improved Q -learning is proposed to improve the efficiency of radar jamming decision-making. First, the method adopts the simulated annealing (SA) algorithm's Metropolis criterion to enhance the exploration strategy, balancing the contradictory relationship between exploration and utilization in the algorithm to avoid falling into local optima. At the same time, the idea of stochastic gradient descent with warm restarts (SGDR) is introduced to improve the learning rate of the algorithm, which reduces the oscillation and improves convergence speed at the later stage of the algorithm iteration. Then, a cognitive electronic jamming decision-making model is constructed, and the improved Q -learning algorithm's specific steps are given. The simulation experiment takes a multifunctional radar as an example to analyze the influence of exploration strategy and learning rate on decision-making performance. The results reveal that compared with the traditional Q -learning algorithm, the improved Q -learning algorithm proposed in this paper can fully explore and efficiently utilize and converge the results to a better solution at a faster speed. The number of iterations can be reduced to more than 50%, which proves the feasibility and effectiveness of the method applied to cognitive electronic jamming decision-making. [ABSTRACT FROM AUTHOR]

In Wireless Rechargeable Sensor Networks (WRSNs), wireless chargers can recharge batteries of sensor nodes so that they can operate sustainably. Since wireless chargers are costly and have limited charging distances and angles, how to apply as few as possible chargers to cover all sensor nodes and satisfy their energy requirements is thus an important and challenging problem. This paper introduces the PSCD (Particle Swarm Charger Deployment) algorithm and the IPSCD (Improved PSCD) algorithm using the Particle Swarm Optimization (PSO) concept to nearly optimize WRSN charger deployment. PSCD and IPSCD estimate charging efficiency according to the distance and angle between chargers and sensor nodes. They then, on the basis of PSO, utilize the local optimum and the global optimum to adjust locations and antenna orientations of chargers to make WRSNs sustainable. We perform experiments using practical wireless chargers to obtain charging efficiency data. Based on the data, PSCD and IPSCD are simulated for obtaining the best parameter setting, and compared with two related greedy algorithms to show their superiority. This paper introduces the PSCD (Particle Swarm Charger Deployment) algorithm and the IPSCD (Improved PSCD) algorithm, which utilize the Particle Swarm Optimization (PSO) concept to deploy as few as possible wireless chargers with adjusted positions and antenna directions to fulfill the energy requirement of sensor nodes of a WRSN (Wireless Rechargeable Sensor Network) inside a cuboid with length L, width W and height H. [ABSTRACT FROM AUTHOR]

In this paper, the hybrid combination of genetic algorithm and particle swarm optimization (GAPSO) is used to optimize the phase distribution (PD) of beam-scanning reflectarray. The GAPSO takes advantage of both conventional algorithms and it could cover their weaknesses. Two novel PDs are proposed in this paper which constant phase elements (CPEs) and ordinary elements (OEs) are two basic kinds of elements used in them. The phases of CPEs are fixed and it is not changed during beam scanning and only OEs' phase could be adjusted to scan the main beam. In this work GAPSO and two novel PDs are applied to array factor's PD of a 30 × 30 reflectarray antenna to displace the main beam electronically in the vertical plane from − 40° to 40°. Also, in these two novel PDs, 28.8% of total elements are selected as CPEs. In the first one with only CPEs, the phase of OEs (71.2% of total elements) could adjust, but in the second novel PD with CPEs and phase symmetry plane 35.5% of the total elements' phase could be changed to scan the beam. Optimization results show that the novel PD and hybrid algorithm have appropriate performance in the electronically beam scanning of reflectarrays. [ABSTRACT FROM AUTHOR]

Summary: Automatic generation control (AGC) plays a crucial role in modern power system to control the frequency with change in power demand. A novel fractional order (FO) hybrid PID‐fuzzy‐PID (FO‐hPID‐FPID) controller is proposed in this paper as the secondary controller for AGC of a three unequal area interconnected nonlinear reheat thermal power system considering generation rate constraint. This paper also deals with the implementation of FO fuzzy PID (FOFPID) and FO PID (FOPID) controllers in addition to the proposed controller along with their counterpart integer order controllers to establish the dominance of FO controllers over integer order controllers. Various parameters of the controllers are optimized by hybridizing two global optimization techniques: particle swarm optimization and modified sine cosine algorithm (MSCA) and the optimization techniques so obtained is called as hybrid PSO‐MSCA (hPSO‐MSCA) technique. A step load perturbation of 0.01 p.u. is injected in area‐1, and the system response is investigated independently with different controllers. It is revealed that the proposed FO‐hPID‐FPID delivers superior performance than the other controllers. Sensitivity analysis for parametric variations is carried out, and random load test is performed to validate the robustness of the proposed controller. Further, it is observed that the controllers deliver result in an ascending order of control performance as PID, FOPID, FPID, FOFPID, hPID‐FPID and FO‐hPID‐FPID controllers with FO‐hPID‐FPID controller delivering the best result and the FO controllers deliver better control performance than their integer order counterparts. [ABSTRACT FROM AUTHOR]

Featured Application: The paper is about black-box attack methods and the generation of adversarial samples. The adversarial samples threaten the effectiveness of machine learning (ML) models and algorithms in many applications. In particular, black-box attack methods are quite close to actual scenarios. Research on black-box attack methods and the generation of adversarial samples is helpful to discover the defects of machine learning models. It can strengthen the robustness of machine learning algorithms models. Such methods require queries frequently, which are less efficient. This paper has made improvements in the initial generation and the search for the most effective adversarial examples. Besides, it is found that some indicators can be used to detect attacks, which is a new foundation compared with our previous studies. Firstly, the paper proposed an algorithm to generate initial adversarial samples with a smaller L2 norm; secondly, a combination between particle swarm optimization (PSO) and biased boundary adversarial attack (BBA) is proposed. It is the PSO-BBA. Experiments are conducted on the ImageNet. The PSO-BBA is compared with the baseline method. Experimental comparison results certificate that: (1) A distributed framework for adversarial attack methods is proposed; (2) The proposed initial point selection method can reduces query numbers effectively; (3) Compared to the original BBA, the proposed PSO-BBA algorithm accelerates the convergence speed and improves the accuracy of attack accuracy; (4) The improved PSO-BBA algorithm has preferable performance on targeted and non-targeted attacks; (5) The mean structural similarity (MSSIM) can be used as the indicators of adversarial attack. [ABSTRACT FROM AUTHOR]

The penetration of distributed generation (DG) in the distribution network has become a necessity and a significant solution to improve power grid quality, and solve power losses issue. To reach these targets, integrating these DGs in an optimal placement with an optimal sizing should be investigated and taken into consideration. This paper focuses on obtaining the optimal allocation and size of a photovoltaic (PV) distributed generation (PVDG) in order to reduce the total power losses and enhance voltage and frequency profiles of a modified IEEE 14 node distribution network (Hooshmand in J Appl Sci 8(16):2788–2800, 2008, https://doi.org/10.3923/jas.2008.2788.2800). An objective function is used in this paper aims to reduce grid power losses, and two optimization algorithms are applied to solve this function which are the particle swarm optimization (PSO) and the genetic algorithm (GA). Added to that, two scenarios are discussed in this paper in order to analyze the effects of variable PV penetration level, hourly load consumption profile variation and atmospheric condition change on the sizing optimization resolution. The obtained simulation results prove that the PSO algorithm has better performance compared to the GA in terms of speed convergence, power loss reduction and grid quality improvement (voltage and frequency profiles). Then, it shows that variable load consumption curve and weather condition change can affect not only the determination of the PVDG optimal position and capacity but also grid security. [ABSTRACT FROM AUTHOR]

Photovoltaic (PV) systems utilize maximum power point tracking (MPPT) controllers to optimize power output amidst varying environmental conditions. However, the presence of multiple peaks resulting from partial shading poses a challenge to the tracking operation. Under partial shade conditions, the global maximum power point (GMPP) may be missed by most traditional maximum power point tracker. The flower pollination algorithm (FPA) and particle swarm optimization (PSO) are two examples of metaheuristic techniques that can be used to solve the issue of failing to track the GMPP. This paper discusses and resolves all issues associated with using the standard FPA method as the MPPT for PV systems. The first issue is that the initial values of pollen are determined randomly at first, which can lead to premature convergence. To minimize the convergence time and enhance the possibility of detecting the GMPP, the initial pollen values were modified so that they were near the expected peak positions. Secondly, in the modified FPA, population fitness and switch probability values both influence swapping between two-mode optimization, which may improve the flower pollination algorithm's tracking speed. The performance of the modified flower pollination algorithm (MFPA) is assessed through a comparison with the perturb and observe (P&O) method and the standard FPA method. The simulation results reveal that under different partial shading conditions, the tracking time for MFPA is 0.24, 0.24, 0.22, and 0.23 s, while for FPA, it is 0.4, 0.35, 0.45, and 0.37 s. Additionally, the simulation results demonstrate that MFPA achieves higher MPPT efficiency in the same four partial shading conditions, with values of 99.98%, 99.90%, 99.93%, and 99.26%, compared to FPA with MPPT efficiencies of 99.93%, 99.88%, 99.91%, and 99.18%. Based on the findings from simulations, the proposed method effectively and accurately tracks the GMPP across a diverse set of environmental conditions. [ABSTRACT FROM AUTHOR]

Metaheuristics are widely used in science and industry because it as a high-level heuristic technique can provide robust or advanced solutions compared to classical search algorithms. Flow Regime Algorithm is a novel physics-based optimization approach recently proposed, and it is one of the candidate algorithms for solving complex optimization problems because of its few parameter configurations, simple coding, and good performance. However, the population that initialized randomly may have poor diversity issues, resulting in insufficient global search, and premature convergence to local optimum. To solve this problem, in this paper, a novel enhanced Flow Regime Algorithm based on opposition learning scheme is proposed. The proposed algorithm introduces the opposition-based learning strategy into the generation of some populations to enhance the global search performance while maintaining a fast convergence rate. In order to verify the performance of the proposed algorithm, 23 benchmark numerical optimization functions were studied experimentally in detail and compared with six well-known algorithms. Experimental results show that the proposed algorithm outperforms all other metaheuristic algorithms in all unimodal functions with higher accuracy, and can obtain competitive results on more multimodal cases. A statistical comparison shows that the proposed algorithm has superiority. Finally, that the proposed algorithm can achieve higher quality alignment compared to most other metaheuristic-based systems and OAEI ontology alignment systems. [ABSTRACT FROM AUTHOR]

The salp swarm algorithm (SSA) is a well-known optimization algorithm that is increasingly being utilized to solve many sorts of optimization problems. However, SSA may converge to sub-optimal solutions when it is applied to discrete problems such as the feature selection (FS) problem. This paper presents the enhanced opposition-based learning salp swarm algorithm (EOSSA), which is an improved SSA algorithm for solving the FS problem in intrusion detection systems (IDS). EOSSA incorporates four improvements into the original SSA algorithm. Firstly, the opposition-based learning (OBL) method is used in the initialization step of SSA to boost its population diversity. Secondly, the Elite opposition-based learning (EOBL) is used in the improvement loop of SSA to improve its exploration ability. Third, a variable neighborhood search (VNS) method is used in the improvement loop of SSA to improve its exploration mechanism to improve the local search space. Lastly, the Sigmoid binary transform function is used to convert the continuous candidate solutions produced by SSA into discrete binary solutions. EOSSA was evaluated against eighteen popular optimization algorithms (e.g., improved salp swarm algorithm based on opposition-based learning (ISSA), SSA, particle swarm algorithm (PSO), cuckoo search (CS), bat algorithm (BA), and Harris Hawk Optimization (HHO)) using eleven popular intrusion detection datasets (CICIDS2017, CSE-CIC-IDS2018, CICDDOS2019, CIRA-CIC-DoH, Intrusion detection 2018, UNSW-NB15, NSL-KDD, Phishing Legitimate, Malmem2022, IoT, and LUFlow Network) to Detect IoT Botnet Attacks. Moreover, EOSSA was compared with four machine learning algorithms (Decision Tree (DT), logistic regression (LR), Naive Bayes (NB), and K-Nearest Neighborhood (KNN)). The overall simulation results suggested that the proposed method is superior to the other algorithms in terms of the accuracy and number of selected features. The statistical analysis of the simulation results using the Friedman and Wilcoxon signed-rank test confirms the superiority of the proposed method. [ABSTRACT FROM AUTHOR]

Software as a service (SaaS) provider hires resources from an Infrastructure as a Service (IaaS) provider and provides these sharable resources to user's applications on lease. However, it is becoming a more challenging issue for SaaS providers to meet user's Quality of Service (QoS) Parameter and maximize profit from cloud infrastructure. This proposed work satisfies both the user and the service provider by fulfilling service level agreement (SLA), user's QoS requirement, and increasing profit with efficient resources utilization. This paper proposes an Improved Quantum Salp Swarm Algorithm (IQSSA), which improves the Salp Swarm algorithm by incorporating the principles of Quantum computing to increase the convergence rate. Further, Quantum-inspired Salp Swarm Grey Wolf Algorithm (QSSGWA) embeds SSA with Grey Wolf Optimizer (GWO) to improve the global optimum solution, and quantum operator is used to initializing population. Proposed algorithms execute tasks under the user-defined deadline and budget constraints. Furthermore, the penalty cost is formulated and applied in the case of a deadline violation. IQSSA and QSSGWA are tested on 19 global benchmark functions, and results prove their superior performance compared to SSA, GWO, BAT, and Particle Swarm Optimization (PSO) algorithm. Furthermore, these algorithms are simulated on CloudSim, and performance matrices such as service provider's profit, makespan, SLA violation rate, task rejection rate, throughput, resource utilization, and response time are compared. The comparison analysis demonstrates that the proposed algorithms offer better performance and more efficient scheduling than existing metaheuristics. Furthermore, simulation results clearly show that QSSGWA gives the best results for all performance matrices. This proposed approach can be applied in many scientific domains, where distributed processing of data or large scale data analysis is required such as distributed and federated machine learning, serverless computing, medical applications, etc. [ABSTRACT FROM AUTHOR]

The permanent magnet eddy current coupler (PMEC) solves the problem of flexible connection and speed regulation between the motor and the load and is widely used in electrical transmission systems. It provides torque to the load and generates heat and losses, reducing its energy transfer efficiency. This issue has become an obstacle for PMEC to develop toward a higher power. This paper aims to improve the overall performance of PMEC through multi-objective optimization methods. Firstly, a PMEC modeling method based on the Levenberg-Marquardt back propagation (LMBP) neural network is proposed, aiming at the characteristics of the complex input-output relationship and the strong nonlinearity of PMEC. Then, a novel competition mechanism-based multi-objective particle swarm optimization algorithm (NCMOPSO) is proposed to find the optimal structural parameters of PMEC. Chaotic search and mutation strategies are used to improve the original algorithm, which improves the shortcomings of multi-objective particle swarm optimization (MOPSO), which is too fast to converge into a global optimum, and balances the convergence and diversity of the algorithm. In order to verify the superiority and applicability of the proposed algorithm, it is compared with several popular multi-objective optimization algorithms. Applying them to the optimization model of PMEC, the results show that the proposed algorithm has better comprehensive performance. Finally, a finite element simulation model is established using the optimal structural parameters obtained by the proposed algorithm to verify the optimization results. Compared with the prototype, the optimized PMEC has reduced eddy current losses by 1.7812 kW, increased output torque by 658.5 N·m, and decreased costs by 13%, improving energy transfer efficiency. [ABSTRACT FROM AUTHOR]

Anomaly in geoacoustic emission is an important earthquake precursor. Current geoacoustic anomaly detection methods are limited by their low signal-to-noise ratio, low intensity, sample imbalance, and low accuracy. Therefore, this paper proposes a clone selection algorithm optimized one-class support vector machine method (CSA-OCSVM) for geoacoustic anomaly detection. First, the interquartile range (IQR), cubic spline interpolation, and time window are designed to amplify the geoacoustic signal intensity and energy change rules to reduce the interference of geoacoustic signal noise and intensity. Secondly, to address the imbalance of positive and negative samples in geoacoustic anomaly detection, a one-class support vector machine is introduced for anomaly detection. Meanwhile, in view of the optimization capabilities of the clone selection algorithm, it is adopted to optimize the hyperparameters of OCSVM to improve its detection accuracy. Finally, the proposed model is applied to geoacoustic data anomaly detection in nine different datasets, which are derived from our self-developed acoustic electromagnetic to AI (AETA) system, to verify its effectiveness. By designing comparative experiments with IQR, genetic algorithm OCSVM (GA-OCSVM), particle swarm optimization OCSVM (PSO-OCSVM), and evaluating the performance of the true positive rate (TPR) and false positive rate (FPR), the experimental results depict that the proposed model is superior to the existing state-of-the-art geoacoustic anomaly detection approaches. [ABSTRACT FROM AUTHOR]

In response to the problem that it is easy to fall into local optimum when using the traditional clustering algorithm to divide the modules, this paper improves the initialisation strategy of the NSGA2 algorithm and combines it with the FCM algorithm to propose an improved NSGA2-FCM algorithm for clustering analysis. Firstly, the FBS mapping is used to model the functional structure of the product system and identify the relationship between the product functional structures. Secondly, a correlation synthesis matrix is constructed based on the relationships between the module division drivers. Finally, the improved NSGA2-FCM algorithm is applied to cluster analysis of the product to derive the best module division scheme. The algorithm avoids falling into local optima by optimising the initialisation strategy of the NSGA2 algorithm, while using the FCM algorithm to improve the accuracy of the clustering. This allows the algorithm to explore the solution space more effectively when finding the best module partitioning solution. Finally, the effectiveness of the algorithm for module classification of light industrial equipment is verified using beer fermenters as a case study. [ABSTRACT FROM AUTHOR]

The performance of transformers directly determines the reliability, stability, and economy of the power system. The methodologies of minimizing the transformer manufacturing cost under the premise of ensuring performance is of great significance. This paper presented an innovative multi-objective optimization model to analyze the relationship between design parameters and transformer indicators. In addition, the sensitive analysis is conducted to exploit the interaction relationships between design parameters and targets. The reliability of the model was demonstrated in 50 MVA/110 kV and 63 MVA/110 kV prototypes, compared with the actual material usage, short-circuit impedance, and load loss, and the maximum error is less than 7%. Due to this problem having many optimization objectives and the high dimension of variables, a two-stage algorithm called MOPSO-NSGA3 (multi-objective particle swarm optimization and non-dominated sorting genetic algorithm-3) is presented. MOPSO is used to find non-domain solutions within the search space in the first stage, and the solution will be used as prior knowledge to initialize the population in NSGA3. The result shows that this algorithm can be effectively used in multi-objective optimization tasks and best meets the requirements of transformer designs that minimize the short-circuit deviation, operating loss, and manufacturing costs. [ABSTRACT FROM AUTHOR]

This paper presents a groundbreaking power distribution technique that focuses on the loss rate of individual wind turbines. Distinct from conventional methods, our strategy prioritizes seamless integration and adaptability within wind farm management systems. By evaluating power losses in specific branches of a wind farm, our approach enhances overall performance by strategically allocating reactive power to reduce cumulative losses. When compared to traditional uniform distribution and Particle Swarm Optimization (PSO) methods, our innovative approach stands out for its superior efficiency and adaptability. Comprehensive simulations underline the strengths and weaknesses of prevailing methods and underscore the superior efficacy of our proposed technique. [ABSTRACT FROM AUTHOR]

Nodes localization has been a critical subject in wireless sensor network (WSN) field. As far as existing localization algorithms are concerned, distance vector hop (DV-Hop) has the advantages of no extra hardware and implementation simplicity, however its localization accuracy cannot meet some specific requirements. In order to enhance the accuracy of WSN nodes localization, a DV-Hop based localization algorithm based on nodes negotiation and multi communication radii (NNMCR DV-Hop) is proposed in this paper. Firstly, the hop counts between WSN nodes is modified from an integer to a decimal by changing communication radius of anchor nodes through nodes negotiation. By refining the hop counts, the accuracy of the estimated distance from the unknown to the anchor nodes is improved. Secondly, the calculation of the average hop size of the anchor node is abstracted into a combinatorial optimization problem which is solved by using binary particle swarm optimization (BPSO) to improve the accuracy of the estimated distance which is between the anchor and the unknown node. Finally, when calculating the coordinates of unknown nodes, only the anchor nodes with smaller hop counts are selected to participate in the calculation. Simulation experiments show that compared with the original DV-Hop as well as other improved algorithms based on DV-Hop, NNMCR DV-Hop greatly improves the localization accuracy of unknown nodes without additional hardware. [ABSTRACT FROM AUTHOR]

This paper presents a circular recycling system for end-of-life tires (ELTs) under extended producer responsibility (EPR) by integrating Individual Producer Responsibility (IPR) and Industrial Symbiosis (IS). The system aims for sustainability and circularity in the tire industry, avoiding the detrimental effects of landfilling. It focuses on emission-free recyclers to create IS for ensuring environmental sustainability. Additionally, the system uses a "dynamic pricing strategy" to take-back ELTs from consumers. This paper also presents a "multi-period scenario-based nonlinear mixed integer programming" model to investigate the economic sustainability of the proposed system under uncertainty. Three different evolutionary metaheuristic algorithms, "genetic algorithm (GA)-based simulated annealing", "GA" and a new variant of "particle swarm optimization" are used to obtain the solution of the model. Through a case study, it is found that the proposed system is economically sustainable and has the potential to aid in the successful implementation of EPR in the tire industry. [ABSTRACT FROM AUTHOR]

Numerous studies on project scheduling only consider a single factor, which fails to reflect the actual environment of project operations. In light of this issue, the article synthesizes multiple perspectives and proposes a multi-skill resource-based multi-modal project scheduling problem (MRCMPSP). This problem is described, modeled, and solved using the resource capability matrix and other constraints to minimize the project duration. To effectively solve MRCMPSP and enrich scheduling algorithms, the paper selects the hybrid quantum algorithm (HQPSO) based on the quantum particle swarm algorithm (QPSO). The HQPSO introduces various improvements such as the JAYA optimization search to improve the algorithm's performance. In order to verify the generality, superiority, and effectiveness of the algorithm, independent operation comparison experiments and practical application experiments of the algorithm are designed based on different case sizes and resource quantities. The experimental results demonstrate that the proposed algorithm has superior convergence performance and solution accuracy and can provide an effective scheduling solution for real cases. Additionally, the article provides targeted management suggestions based on the research findings. Overall, this study contributes a novel mathematical model, solution algorithm, optimization strategies, and managerial insights, advancing the field of project management research. [ABSTRACT FROM AUTHOR]

This paper presents a path-planning strategy for unmanned aerial vehicles (UAVs) in urban environments with a ground risk map. The aim is to generate a UAV path that minimizes the ground risk as well as the flying cost, enforcing safety and efficiency over inhabited areas. A quantitative model is proposed to evaluate the ground risk, which is then used as a risk constraint for UAV path optimization. Subsequently, beetle swarm optimization (BSO) is proposed based on a beetle antennae search (BAS) that considers turning angles and path length. In this proposed BSO, an adaptive step size for every beetle and a random proportionality coefficient mechanism are designed to improve the deficiencies of the local optimum and slow convergence. Furthermore, a global optimum attraction operator is established to share the social information in a swarm to lead to the global best position in the search space. Experiments were performed and compared with particle swarm optimization (PSO), genetic algorithm (GA), firefly algorithm (FA), and BAS. This case study shows that the proposed BSO works well with different swarm sizes, beetle dimensions, and iterations. It outperforms the aforementioned methods not only in terms of efficiency but also in terms of accuracy. The simulation results confirm the suitability of the proposed BSO approach. [ABSTRACT FROM AUTHOR]

This paper describes the design and optimization of a cooling strategy based on a battery cooling system with indirect liquid-cooled plate heat exchange. The performance of the battery cooling system was analyzed using single-factor thermal simulation analysis. A cosimulation platform was built, and the rule-based multiparameter control strategy was used to design the heat dissipation logic, which was verified in the cosimulation platform. To improve the heat dissipation performance further, an orthogonal test (OT) was used to analyze the effects of different control parameters on each performance index during the battery discharge process, and the optimal combination of control parameters under a balanced multiobjective strategy was obtained. The results of the particle swarm optimization (PSO) algorithm with different weight coefficients were introduced for comparison. It was found that the OT and PSO can keep the temperature difference within the safe range. The maximum temperature was reduced by 3.57 and 4.10 K, respectively, and the average output power was increased by 11% and 9%, respectively, which indicates that the OT maintained good performance despite the significant workload reduction. The feasibility and reliability of the battery thermal management system control strategy optimized using OT were verified. [ABSTRACT FROM AUTHOR]

Photovoltaic (PV) generation systems that are partially shaded have a non-linear operating curve that is highly dependent on temperature and irradiance conditions. Shading from surrounding objects like clouds, trees, and buildings creates partial shading conditions (PSC) that can cause hot spot formation on PV panels. To prevent this, bypass diodes are installed in parallel across each panel, resulting in a global maximum power point (GMPP) and multiple local maximum power points (LMPPs) on the power-voltage (P-V) curve. Traditional methods for maximum power point tracking (MPPT), such as perturb and observe (P&O) and incremental conductance (INC), converge for LMPPs on the P-V curve, but metaheuristic algorithms can track the GMPP effectively. This paper proposes a new, efficient, and robust GMPP tracking technique based on a nature-inspired algorithm called Ali Baba and the Forty Thieves (AFT). Utilizing the AFT algorithm for MPPT in PV systems has several novel features and advantages, including its adaptability, exploration-exploitation balance, simplicity, efficiency, and innovative approach. These characteristics make AFT a promising choice for enhancing the efficiency of PV systems under varied circumstances. The performance of the proposed method in tracking the GMPP is evaluated using a simulation model under MATLAB/Simulink environment, the achieved simulation results are compared to particle swarm optimization (PSO). The proposed method is also tested in real-time using the Hardware-in-the-loop (HIL) emulator to validate the achieved simulation results. The findings indicate that the proposed AFT-based GMPP tracking method performs better under complex partial irradiance conditions than PSO. [ABSTRACT FROM AUTHOR]

In the field of data exchange, the security of information is the critical aspect. This void in the security helped the evolution of steganography to address the problem of security, especially when highly critical information exchange is the priority. Better and advanced level of security has been attained using the techniques of steganography with cryptography. However, it has been observed that steganographic techniques principled on computationally intelligent or inspired by nature algorithms are gaining much attention. The paper proposes a method for image steganography in transform domain using hybridization of two computationally intelligent algorithms, i.e., firefly optimization algorithm and ant colony optimization algorithm with Huffman encoding to address the gap of high payload. Comparative analysis of the proposed steganographic tool with other existing methods and analysis of the values obtained against some key performance terms like PSNR (peak signal to noise ratio), MSE (mean square error), BER (bit error rate) and SSI (structural similarity index) determines the proposed algorithm as a powerful method. The proposed tool achieves the PSNR of 68.06 dB and the embedding capacity of 985,682 bits. [ABSTRACT FROM AUTHOR]

Reliability-based design is related to the performance analysis of engineering systems. The redundancy allocation problem is one of the most common problems in the reliability-based design approach. The redundancy allocation problem determines the redundancy level of components in a system to maximize system reliability, subject to several constraints. In recent years, obtaining solutions to reliability-related redundancy allocation problems by means of evolving meta-heuristic algorithms has appealed to researchers due to the several drawbacks of classical mathematical methods. Meta-heuristics have shown the potential of obtaining precise solution in optimization problems and many techniques have been applied in the literature for optimal redundancy allocation. In this paper, a recently developed Jaya optimization algorithm is proposed to be applied for redundancy allocation to maximize system reliability. The Jaya algorithm is a simple, population-based intelligent meta-heuristic algorithm consisting of a single phase and an algorithm-specific parameter-less algorithm. This paper aims to present an application of the Jaya algorithm for searching the optimal solution of two redundancy allocation problems from the literature with nonlinear constraints so that system reliability is maximized. The first problem is the over speed protection system for a gas turbine, whose control system is modelled as a four-stage series system. The objective is to determine the optimal level of redundancy of the valves of the protection system under cost and weight constraints. The second one is the redundancy allocation problem of a five-stage series system with volume, weight, and cost constraints. The results are validated by comparing them with two other meta-heuristics. [ABSTRACT FROM AUTHOR]

In the face of fire in buildings, people need to quickly plan their escape routes. Intelligent optimization algorithms can achieve this goal, including the sparrow search algorithm (SSA). Despite the powerful search ability of the SSA, there are still some areas that need improvements. Aiming at the problem that the sparrow search algorithm reduces population diversity and is easy to fall into local optimum when solving the optimal solution of the objective function, a hybrid improved sparrow search algorithm is proposed. First, logistic-tent mapping is used to initialize the population and enhance diversity in the population. Also, an adaptive period factor is introduced into the producer's update position equation. Then, the Lévy flight is introduced to the position of the participant to improve the optimization ability of the algorithm. Finally, the adaptive disturbance strategy is adopted for excellent individuals to strengthen the ability of the algorithm to jump out of the local optimum in the later stage. In order to prove the improvement of the optimization ability of the improved algorithm, the improved sparrow algorithm is applied to five kinds of maps for evacuation path planning and compared with the simulation results of other intelligent algorithms. The ultimate simulation results show that the optimization algorithm proposed in this paper has better performance in path length, path smoothness, and algorithm convergence, showing better optimization performance. [ABSTRACT FROM AUTHOR]

The usage of productive baseband receivers are portrayed by reasonable computational load is an urgent point in the advancement of transmission frameworks misusing assorted qualities in various spaces.Several research works have been published in the literature ofspace-time block codes multi-carrier code-division multiple-access (STBC MC-CDMA)Systems based on minimum conditional bit error rate Criterion. As like, in our previous paper, an efficient STBC communication system was performed using oppositional krill herd algorithm (OKHA). To overcome the drawbacks in the previous work, in this work we proposed a hybrid Particle swarm optimization (PSO) and group search optimization (GSO), called PSGSO based Multi-User Detection in STBC MC-CDMA Systems. In this paper, we use the Alamouti's STBC encoder for transmitting sequence and the channel estimation matrix is optimally evaluated using PSGSO algorithm. The simulation results show that the proposed algorithm is properly reducing the bit error rate (BER), symbol error rate (SER) and properly increase the spectral efficiency value compare to other techniques. [ABSTRACT FROM AUTHOR]

Summary: This paper presents an optimal parameter identification strategy of the lithium‐ion (Li‐ion) battery model applying a recent metaheuristic artificial ecosystem‐based optimization (AEO) algorithm, which proves its ability in terms of both convergence speed and complexity. The key idea is to update the battery model parameters using the optimizer outputs. In the current paper, the battery model is based on the Shepherd model. To demonstrate the superiority of the suggested method of identification, the test results are compared in terms of efficiency, convergence speed, and accuracy of identification with those obtained by the salp swarm algorithm, the political optimizer, the equilibrium optimizer, and particle swarm optimization. Through the optimization procedure, the undetermined parameters of the battery model are employed as decision variables, but the root‐mean‐square error between estimated data and battery data is assigned to be an objective function must be minimal. The results showed the superior identification ability of the AEO compared to the other optimizers. This optimizer achieved 99.9% identification efficiency, which makes it an ideal solution for battery identification. Besides its identification efficiency, the AEO is much faster than the other optimizers, as the results show. [ABSTRACT FROM AUTHOR]

Particle swarm optimization (PSO) is a widely used method that can provide good parameters for the motion controller of mobile robots. In this paper, an improved PSO algorithm that optimize the control PID parameters of a specific robot have been proposed. This paper first presents a brief review of recently proposed PSO methods, and then presents a detailed analysis of the PID optimization algorithm, which uses H∞ theory to reduce the search space and fuses the information entropy to ensure the diversity of particles. Simulations in Matlab show that the algorithm can improve the convergence speed and get a better global optimization ability than the standard PSO algorithm. Experimental results present a sound effects for the control of the negative pressure adsorption motor in the power grid pipeline robot during its adsorption along the circular movements, which verifies the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

A key area of wireless communications is visible light communication which uses solid-state light-emitting-diode. This paper shows, a comparative study to optimize the received signal strength indication (RSSI) in the optical wireless link between two optimization algorithms. The optimization algorithm we used in the paper is a genetic algorithm (GA) and a particle swarm optimization (PSO) algorithm. To, compute the maximum RSSI over the non-line-of-sight (NLOS) link, within an indoor environment, and to find the optimum NLOS route through distinct angles to achieve better communication quality, we have used those algorithms. Simulations were performed at matlab to check the feasibility of the scheme proposed. Also, we have compared the efficiency of the both system. In addition, GA and PSO detect the maximum RSSI of the receiver (Rx) in a specific direction instead of calculating RSSI at any random angle. The simulation result shows that the proposed system precisely detects the direction that provides an optimal RSSI for the Rx. This paper concludes that the GA is computationally effective while compared with PSO. After several iterations, the result estimates that the average elapsed time of the GA is 0.21 ms and the PSO is 30 ms, respectively. In the case of user positions 1 and 2, the percentage enhancement for GA as compared to PSO is almost 4.2% and 12.5% respectively. [ABSTRACT FROM AUTHOR]