Search

With the expansion of the scale of electric power, high-quality electrical energy remains a crucial aspect of power system management and operation. The generation of reactive power is the primary cause of the decline in electrical energy quality. Therefore, optimization of reactive power in the power system becomes particularly important. The primary objective of this article is to create a multi-objective reactive power optimization (MORPO) model for distribution networks. The model aims to minimize reactive power loss, reduce the overall compensation required for reactive power devices, and minimize the total sum of node voltage deviations. To tackle the MORPO problems for distribution networks, the improved sparrow search algorithm–particle swarm optimization (ISSA-PSO) algorithm is proposed. Specifically, two improvements are proposed in this paper. The first is to introduce a chaotic mapping mechanism to enhance the diversity of the population during initialization. The second is to introduce a three-stage differential evolution mechanism to improve the global exploration capability of the algorithm. The proposed algorithm is tested on the IEEE 33-node system and the practical 22-node system. The results indicate a reduction of 32.71% in network losses for the IEEE 33-node system after optimization, and the average voltage of the circuit increases from 0.9485 p.u. to 0.9748 p.u. At the same time, optimization results in a reduction of 44.07% in network losses for the practical 22-node system, and the average voltage of the circuit increases from 0.9838 p.u. to 0.9921 p.u. Therefore, the proposed method exhibits better performance for reducing network losses and enhancing voltage levels. [ABSTRACT FROM AUTHOR]

Abstract—In this work addresses the surge in greenhouse gas emissions and fuel costs resulting from heightened energy demand, especially in developing nations. To counter these challenges, the focus is on optimizing renewable energy sources, which, though advantageous, are weather-dependent and require intricate management. The study introduces the Enhanced Self-Adaptive Differential Evolution (SADE) algorithm, encompassing solar, battery, and thermal sources, to maximize profitability. Real-time (RT) load profiles are used for performance analysis, comparing the proposed algorithm with existing techniques like PSO, Differential Evolution (DE) algorithm, and SADE algorithm. Improved energy storage technologies complement the increased utilization of renewable energy, enabling electricity storage during off-peak hours and release during peak demand, providing promising solutions for the energy industry. [ABSTRACT FROM AUTHOR]

To overcome the disadvantages of premature convergence and easy trapping into local optimum solutions, this paper proposes an improved particle swarm optimization algorithm (named NDWPSO algorithm) based on multiple hybrid strategies. Firstly, the elite opposition-based learning method is utilized to initialize the particle position matrix. Secondly, the dynamic inertial weight parameters are given to improve the global search speed in the early iterative phase. Thirdly, a new local optimal jump-out strategy is proposed to overcome the "premature" problem. Finally, the algorithm applies the spiral shrinkage search strategy from the whale optimization algorithm (WOA) and the Differential Evolution (DE) mutation strategy in the later iteration to accelerate the convergence speed. The NDWPSO is further compared with other 8 well-known nature-inspired algorithms (3 PSO variants and 5 other intelligent algorithms) on 23 benchmark test functions and three practical engineering problems. Simulation results prove that the NDWPSO algorithm obtains better results for all 49 sets of data than the other 3 PSO variants. Compared with 5 other intelligent algorithms, the NDWPSO obtains 69.2%, 84.6%, and 84.6% of the best results for the benchmark function ( f 1 - f 13 ) with 3 kinds of dimensional spaces (Dim = 30,50,100) and 80% of the best optimal solutions for 10 fixed-multimodal benchmark functions. Also, the best design solutions are obtained by NDWPSO for all 3 classical practical engineering problems. [ABSTRACT FROM AUTHOR]

To overcome the disadvantages of premature convergence and easy trapping into local optimum solutions, this paper proposes an improved particle swarm optimization algorithm (named NDWPSO algorithm) based on multiple hybrid strategies. Firstly, the elite opposition-based learning method is utilized to initialize the particle position matrix. Secondly, the dynamic inertial weight parameters are given to improve the global search speed in the early iterative phase. Thirdly, a new local optimal jump-out strategy is proposed to overcome the "premature" problem. Finally, the algorithm applies the spiral shrinkage search strategy from the whale optimization algorithm (WOA) and the Differential Evolution (DE) mutation strategy in the later iteration to accelerate the convergence speed. The NDWPSO is further compared with other 8 well-known nature-inspired algorithms (3 PSO variants and 5 other intelligent algorithms) on 23 benchmark test functions and three practical engineering problems. Simulation results prove that the NDWPSO algorithm obtains better results for all 49 sets of data than the other 3 PSO variants. Compared with 5 other intelligent algorithms, the NDWPSO obtains 69.2%, 84.6%, and 84.6% of the best results for the benchmark function ( f 1 - f 13 ) with 3 kinds of dimensional spaces (Dim = 30,50,100) and 80% of the best optimal solutions for 10 fixed-multimodal benchmark functions. Also, the best design solutions are obtained by NDWPSO for all 3 classical practical engineering problems. [ABSTRACT FROM AUTHOR]

Quasi-Affine Transformation Evolutionary (QUATRE) algorithm is a kind of swarm-based collaborative optimization algorithm that solves the problem of a position deviation in a DE search by using the co-evolution matrix M instead of the cross-control parameter CR in the differential evolution algorithm (DE). However, QUATRE shares some of the same weaknesses as DE, such as premature convergence and search stagnation. Inspired by the artificial bee colony algorithm (ABC), we propose a new QUATRE algorithm to improve these problems that ranks all the individuals and evolves only the poorer half of the population. In an evolving population, individuals of different levels intersect with dimensions of different sizes to improve search efficiency and accuracy. In addition, we establish a better selection framework for the parent generation individuals and select more excellent parent individuals to complete the evolution for the individuals trapped in search stagnation. To verify the performance of the new QUATRE algorithm, we divide the comparison algorithm into three groups, including ABC variant group, DE variant group, and QUATRE variant group, and the CEC2014 test suite is used for the comparison. The experimental results show the new QUATRE algorithm performance is competitive. We also successfully apply the new QUATRE algorithm on the 3D path planning of UAV, and compared with the other famous algorithm performance it is still outstanding, which verifies the algorithm's practicability. [ABSTRACT FROM AUTHOR]

This paper presents classification and analysis of the mathematical models of the spread of COVID-19 in different groups of population such as family, school, office (3–100 people), town (100–5000 people), city, region (0.5–15 million people), country, continent, and the world. The classification covers major types of models (time-series, differential, imitation ones, neural networks models and their combinations). The time-series models are based on analysis of time series using filtration, regression and network methods. The differential models are those derived from systems of ordinary and stochastic differential equations as well as partial differential equations. The imitation models include cellular automata and agent-based models. The fourth group in the classification consists of combinations of nonlinear Markov chains and optimal control theory, derived by methods of the mean-field game theory. COVID-19 is a novel and complicated disease, and the parameters of most models are, as a rule, unknown and estimated by solving inverse problems. The paper contains an analysis of major algorithms of solving inverse problems: stochastic optimization, nature-inspired algorithms (genetic, differential evolution, particle swarm, etc.), assimilation methods, big-data analysis, and machine learning. [ABSTRACT FROM AUTHOR]

Cleft lip and/or cleft palate (CL/P) are the common birth defects that result when facial structures developing in an unborn baby do not close completely. To design for treatment schedule, some constraints including hospital eligibility constraints, capacity limitations, treatment age limitations, multi-hospital assignment, and multidisciplinary care team assignment should be determined. However, efficient treatment scheduling is difficult owing to the complicated conditions of specific treatment. This paper presents a multi-objective mathematical model of the CL/P patient treatment scheduling problem in order to minimize the makespan, travel distance, and total least preference assignment score. Since the problem is NP-hard, a solution method is developed based on differential evolution (DE) with particular encoding and decoding schemes for solving the CL/P patient treatment scheduling problem. The performance of DE is evaluated and compared the results with those obtained from the modified particle swarm optimization. The results show that DE is capable of finding high-quality solutions with fast convergence. To apply the proposed approach for a case study, the CL/P patient treatment scheduling program is formulated. The program can be a decision support system in helping the administrators to schedule the patients in order to identify a list of selected treatments, assign each operation of patients to the selected hospital, and intelligently identify the period of the selected treatments. [ABSTRACT FROM AUTHOR]

This paper addresses optimization problems subject to an objective function's evaluation‐number constraint arbitrarily given in advance. These problems are practical for black‐box objective functions which cost much money and/or time per evaluation because money and/or time constraints are typically applicable in real‐world projects. This paper suggests a new solution strategy that can be used to adapt metaheuristics to evaluation‐number constraints arbitrarily given in advance. The proposed strategy updates the setting parameters of a target metaheuristic algorithm for every generation by solving a fixed small‐size optimization problem related to the evaluation‐number constraint. It has the advantage of being insensitive to the effects of dimensionality increases in principle. The effectiveness of the proposed strategy is confirmed by numerical experiments with two well‐known metaheuristics, i.e., the particle swarm optimization algorithm and the differential evolution algorithm. © 2024 Institute of Electrical Engineer of Japan and Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

Substantial deterioration of surface water quality, mainly caused by human activities and climate change, makes the assessment of water quality a global priority. Thus, in this study, four metaheuristic algorithms, namely the particle swarm optimization (PSO), differential evolution (DE), ant colony optimization algorithm (ACOR), and genetic algorithm (GA), were employed to improve the performance of the adaptive neuro-fuzzy inference system (ANFIS) in the evaluation of surface water total dissolved solids (TDS). Monthly and annual TDS were considered as target variables in the analysis. In order to evaluate and compare the authenticity of the models, an economic factor (convergence time) and statistical indices of the coefficient of determination (R2), Kling Gupta efficiency (KGE), root mean squared error (RMSE), mean absolute error (MAE), and Nash-Sutcliff efficiency (NSE) were utilized. The results revealed that the hybrid methods used in this study could enhance the classical ANFIS performance in the analysis of the monthly and annual TDS of both stations. For more clarification, the models were ranked using the TOPSIS approach by simultaneously applying the effects of statistical parameters, temporal and spatial change factors, and convergence time. This approach significantly facilitated decision-making in ranking models. The ANFIS-ACOR annual model considering discharge had the best performance in the Vanyar Station; Furthermore, the ANFIS-ACOR monthly model ignoring discharge was outstanding in the Gotvand Station. In total, after utilizing two defined and proposed temporal and spatial change factors, the ANFIS-ACOR and ANFIS-DE hybrid models had the best and worst performance in TDS prediction, respectively. [ABSTRACT FROM AUTHOR]

The calibration of cameras plays a critical role in close-range photogrammetry because the precision of calibration has a direct effect on the quality of results. When handling image capture using a camera, traditional swarm intelligence algorithms such as genetic algorithms and particle swarm optimization, in conjunction with Zhang's calibration method, frequently face difficulties regarding local optima and sluggish convergence. This study presents an enhanced hybrid optimization approach utilizing both the principles of differential evolution and particle swarm optimization, which is then employed in the context of camera calibration. Initially, we establish a measurement model specific to the camera in close-range photogrammetry and determine its interior orientation parameters. Subsequently, employing these parameters as initial values, we perform global optimization and iteration using the improved hybrid optimization algorithm. The effectiveness of the proposed approach is subsequently validated through simulation and comparative experiments. Compared to alternative approaches, the proposed algorithm enhances both the accuracy of camera calibration and the convergence speed. It effectively addresses the issue of other algorithms getting trapped in local optima due to image distortion. These research findings provide theoretical support for practical engineering applications in the field of control theory and optimization to a certain extent. [ABSTRACT FROM AUTHOR]

Leaf abnormalities pose a significant threat to agricultural productivity, particularly in medicinal plants such as Centella asiatica (Linn.) Urban (CAU), where they can severely impact both the yield and the quality of leaf-derived substances. In this study, we focus on the early detection of such leaf diseases in CAU, a critical intervention for minimizing crop damage and ensuring plant health. We propose a novel parallel-Variable Neighborhood Strategy Adaptive Search (parallel-VaNSAS) ensemble deep learning method specifically designed for this purpose. Our approach is distinguished by a two-stage ensemble model, which combines the strengths of advanced image segmentation and Convolutional Neural Networks (CNNs) to detect leaf diseases with high accuracy and efficiency. In the first stage, we employ U-net, Mask-R-CNN, and DeepNetV3++ for the precise image segmentation of leaf abnormalities. This step is crucial for accurately identifying diseased regions, thereby facilitating a focused and effective analysis in the subsequent stage. The second stage utilizes ShuffleNetV2, SqueezeNetV2, and MobileNetV3, which are robust CNN architectures, to classify the segmented images into different categories of leaf diseases. This two-stage methodology significantly improves the quality of disease detection over traditional methods. By employing a combination of ensemble segmentation and diverse CNN models, we achieve a comprehensive and nuanced analysis of leaf diseases. Our model's efficacy is further enhanced through the integration of four decision fusion strategies: unweighted average (UWA), differential evolution (DE), particle swarm optimization (PSO), and Variable Neighborhood Strategy Adaptive Search (VaNSAS). Through extensive evaluations of the ABL-1 and ABL-2 datasets, which include a total of 14,860 images encompassing eight types of leaf abnormalities, our model demonstrates its superiority. The ensemble segmentation method outperforms single-method approaches by 7.34%, and our heterogeneous ensemble model excels by 8.43% and 14.59% compared to the homogeneous ensemble and single models, respectively. Additionally, image augmentation contributes to a 5.37% improvement in model performance, and the VaNSAS strategy enhances solution quality significantly over other decision fusion methods. Overall, our novel parallel-VaNSAS ensemble deep learning method represents a significant advancement in the detection of leaf diseases in CAU, promising a more effective approach to maintaining crop health and productivity. [ABSTRACT FROM AUTHOR]

Multi-objective optimization algorithms are widely employed in the optimization of Dividing-Wall Column (DWC). However, due to the inherent complexity of DWC design problems, the choice of different optimization algorithms significantly influences the results. This study aims to investigate the applicability of various multi-objective optimization algorithms in the design of ternary DWCs. Three multi-objective algorithms including multi-objective genetic algorithm (MOGA), multi-objective differential evolution with tabu list algorithm (MODE-TL), and multi-objective particle swarm algorithm (MOPSO) are used to solve the optimization problem of six configurations of dividing-wall columns including direct dividing-wall column, indirect dividing-wall column, Petlyuk dividing-wall column, and three configurations of liquid-only transfer dividing-wall column (LTS), and the optimization results are compared and analyzed. The results show that MOPSO has the worst performance and is relatively less applicable to dividing-wall columns. The MOGA has great global exploration ability but is sensitive to structure complicity. The MODE-TL algorithm can make balance between exploration and exploitation and is less sensitive to structure complicity and the number of variables. Finally, according to the comprehensive performance of the three algorithms, we conclude that MODE-TL has the highest applicability in ternary dividing-wall column optimization. [Display omitted] • Six alternative ternary DWCs, including liquid-only transfer DWCs, are designed and optimized. • The performance of three improved optimization algorithms in six configurations is compared and the reasons are analyzed. • The most applicable multi-objective algorithm for ternary DWCs' optimal design is discussed. [ABSTRACT FROM AUTHOR]

The Whale Optimisation Algorithm (WOA) is a meta-heuristic model inspired by the hunting behaviours of humpback whales. Similar to many other meta-heuristic models, e.g., Particle Swarm Optimisation (PSO), Artificial Bee Colony (ABC), and Ant Colony Optimisation (ACO), the WOA is susceptible to the issues of slow convergence and local optima. In this study, we address these short comings by first proposing an Enhanced WOA (EWOA) model for tackling single-objective optimisation. Specifically, EWOA integrates the WOA and Differential Evolution (DE). DE is a population-based algorithm that generates new candidate solutions by combining the existing ones, employing a simple yet robust formula. This amalgamation aids in generating diverse solutions during the exploration stage by utilising a non-linear coefficient vector, adaptive weight, and sub-population strategies. Furthermore, fast non-dominated sorting and crowding distance techniques from the Non-dominated Sorting Genetic Algorithm II (NSGA-II) are incorporated into EWOA, resulting in a multi-objective EWOA (MOEWOA) model. We evaluate both EWOA and MOEWOA with a broad spectrum of benchmark functions. The results from 51 single-objective optimisation problems indicate the usefulness of EWOA in terms of a fast convergence rate and with increased performance. On the other hand, MOEWOA demonstrates a better convergence rate and an effective balance between convergence and diversity in 12 multi-objective optimisation problems. In addition, MOEWOA successfully solves 21 complex multi-objective constrained mechanical design problems, outperforming other compared algorithms at the 95% confidence level. The empirical outcomes of our study indicate the potential of EWOA and MOEWOA for undertaking complex, real-world optimisation problems. [ABSTRACT FROM AUTHOR]

In the real market, the item's demand is substantially affected by the item's selling price and frequency of advertising. This study focuses on an optimal ordering policy followed by advertising, pricing, and preservation policies. The present study incorporates the quantity-dependent ordering cost and time-dependent holding cost. A partial prepayment scheme is developed for inventory purchase decisions. The spoilage impact can be effectively reduced by an optimal investment in refrigeration. The optimal decision policy has been proposed by using three metaheuristic algorithms, namely particle swarm optimization, real-coded genetic algorithm, and differential evolution algorithm. A comparison is made for these metaheuristic schemes based on the numerical illustrations. The parameter sensitivity is performed to get insights of the variability in the indicators of the inventory model. [ABSTRACT FROM AUTHOR]

Vortex search (VS) algorithm is a recently proposed swarm intelligence or evolutionary algorithm for solving continuous optimization problems inspired by the behavior of whirlpool. In this study, an approach based on VS algorithm is proposed to deal with uncapacitated facility location problem (UFLP) which is a pure problem in binary domain. The update mechanism of VS algorithm is not sufficiently useful for solving the binary optimization problems; therefore, a binary form of VS method called modified binary vortex search (for short MBVS) is proposed for solving UFLPs. Three important changes have been carried out on basic VS algorithm such as (1) converting continuous values to binary values; (2) using genetic mutation operators for enhancing the exploration ability and (3) a local search mechanism for extending the exploitation ability. Based on these changes, MBVS has been tested on fifteen different UFLP instances. The UFLPs dealt with in this study is one of the famous binary optimization problems. It is widely used for comparing the performance of superior algorithms. Once an analysis of 10 different transfer functions, a genetic mutation operator, a local search parameter and population size have been made on proposed method; then, it has been compared with some binary metaheuristic methods and their variants: genetic algorithm (GA)-based approaches such as GA-SP, GA-TP and GA-UP; binary particle swarm optimization algorithm (BPSO); binary versions of artificial bee colony (ABC) algorithm such as binABC, DisABC and ABCbin; binary versions of differential evolution (DE) algorithm such as DisDe/rand and binDE and binary variants of the artificial algae algorithm (AAA) such as AAA-Tanh, AAA-Sig and binAAA methods. The experimental results and comparisons reveal that MBVS algorithm is highly competitive and robust optimizer for the problem addressed in this study. [ABSTRACT FROM AUTHOR]

An accurate method is proposed to measure the electrical parameters describing the experimental charge‐discharge curves of Li‐ion batteries and a pack through an equivalent electric dynamic model based on heuristic optimization algorithms (eg, differential evolution approach). The accuracy of these parameters is critical for on‐board state of charge and Health (SOH) estimations of numerous applications and devices. The procedure is constructed, based on the simple Thévenin electrical model. Charge‐discharge experimental curves collected for different chemistry and capacity batteries are described with the model, revealing better estimation results with respect to other algorithms such as impedance‐based methodologies (decreasing the error until 64.19%) and particle swarm optimization based approaches (decreasing the error until 94.02%). The proposal was assessed with different chemistries, capacities and with a 28 battery pack (LiFeMnPO4, 100 Ah) used in an electric vehicle. [ABSTRACT FROM AUTHOR]

As a typical intelligent device, magnetorheological (MR) dampers have been widely applied in vibration control and mitigation. However, the inherent hysteresis characteristics of magnetic materials can cause significant time delays and fluctuations, affecting the controllability and damping performance of MR dampers. Most existing mathematical models have not considered the adverse effects of magnetic hysteresis characteristics, and this study aims to consider such effects in MR damper models. Based on the magnetic circuit analysis of MR dampers, the Jiles–Atherton (J-A) model is adopted to characterize the magnetic hysteresis properties. Then, a weight adaptive particle swarm optimization algorithm (PSO) is introduced to the J-A model for efficient parameter identifications of this model, in which the differential evolution and the Cauchy variation are combined to improve the diversity of the population and the ability to jump out of the local optimal solution. The results obtained from the improved J-A model are compared with the experimental data under different working conditions, and it shows that the proposed J-A model can accurately predict the damping performance of MR dampers with magnetic hysteresis characteristics. [ABSTRACT FROM AUTHOR]

The Whale Optimization Algorithm (WOA) is an efficient meta-heuristic algorithm inspired by the feeding behavior of whales. Although it has successfully solved many optimization problems, it still suffers from premature convergence and poor accuracy when solving complex problems. To address these issues, this paper proposes an improved whale optimization algorithm called EIWOA to improve the search efficiency and accuracy. First, we introduce a new global search mechanism and encircling prey strategy in EIWOA, which utilizes differential evolution, and sine-cosine search strategy to improve the global search efficiency and avoid premature convergence. Second, we use a lévy flight-based spiral update position strategy to improve the local search efficiency of the algorithm, thus improving the convergence speed and accuracy. Again, we introduce a balancing factor with fluctuating decay properties into EIWOA to better balance exploration and exploitation. Finally, we introduce a dynamic opposite learning-based whale-fall strategy in EIWOA to equip the algorithm with the ability to jump out of the local optimum. The qualitative analysis of the algorithm shows that the EIWOA algorithm converges quickly, is highly accurate, and has the ability to jump out of the local optimum. In order to validate the performance of the proposed EIWOA algorithm, we evaluated the algorithm on CEC2017 benchmark function and four real world engineering problems. We also conduct a comparative study of the EIWOA algorithm with EWOA, an excellent variant of WOA, as well as some excellent meta-heuristics developed recently. The results of numerical experiments demonstrate the superiority of the proposed EIWOA, which is further confirmed statistically by the results of Friedman's test and Wilcoxon signed rank test. The proposed EIWOA algorithm is significantly better than WOA and other competing algorithms in terms of convergence speed, accuracy and optimization ability in dealing with complex optimization problems. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) edge is an emerging technology of sensors and devices that communicate real-time data to a network. IoT edge computing was introduced to handle the latency concerns related to cloud computing data management, as the data are processed closer to their point of origin. Clustering and scheduling tasks on IoT edge computing are considered a challenging problem due to the diverse nature of task and resource characteristics. Metaheuristics and optimization methods are widely used in IoT edge task clustering and scheduling. This paper introduced a new task clustering and scheduling mechanism using differential evolution optimization on IoT edge computing. The proposed mechanism aims to optimize task clustering and scheduling to find optimal execution times for submitted tasks. The proposed mechanism for task clustering is based on the degree of similarity of task characteristics. The proposed mechanisms use an evolutionary mechanism to distribute system tasks across suitable IoT edge resources. The clustering tasks process categorizes tasks with similar requirements and then maps them to appropriate resources. To evaluate the proposed differential evolution mechanism for IoT edge task clustering and scheduling, this study conducted several simulation experiments against two established mechanisms: the Firefly Algorithm (FA) and Particle Swarm Optimization (PSO). The simulation configuration was carefully created to mimic real-world IoT edge computing settings to ensure the proposed mechanism's applicability and the simulation results' relevance. In the heavyweight workload scenario, the proposed DE mechanism started with an execution time of 916.61 milliseconds, compared to FA's 1092 milliseconds and PSO's 1026.09 milliseconds. By the 50th iteration, the proposed DE mechanism had reduced its execution time significantly to around 821.27 milliseconds, whereas FA and PSO showed lesser improvements, with FA at approximately 1053.06 milliseconds and PSO stabilizing at 956.12 milliseconds. The simulation results revealed that the proposed differential evolution mechanism for edge task clustering and scheduling outperforms FA and PSO regarding system efficiency and stability, significantly reducing execution time and having minimal variation across simulation iterations. [ABSTRACT FROM AUTHOR]

The growing distributed energy resource (DER) penetration into distribution networks, such as through residential and commercial photovoltaics (PV), has emerged through a transition from passive to active networks, which takes the complexity of planning and operations to the next level. Optimal PV allocation (sizing and location) is challenging because it involves mixed-integer non-linear programming with three-phase non-linear unbalanced power flow equations. Meta-heuristic algorithms have proven their effectiveness in many complex engineering problems. Thus, in this study, we propose to achieve optimal PV allocation by using several basic evolutionary algorithms (EAs), particle swarm optimization (PSO), artificial bee colony (ABC), differential evolution (DE), and their variants, all of which are applied for a study of their performance levels. Two modified unbalanced IEEE test feeders (13 and 37 bus) are developed to evaluate these performance levels, with two objectives: one is to maximize PV penetration, and the other is to minimize the voltage deviation from 1.0 p.u. To handle the computational burden of the sequential power flow and unbalanced network, we adopt an efficient iterative load flow algorithm instead of the commonly used and yet highly simplified forward–backward sweep method. A comparative study of these basic EAs shows their general success in finding a near-optimal solution, except in the case of the DE, which is known for solving continuous optimization problems efficiently. From experiments run 30 times, it is observed that PSO-related algorithms are more efficient and robust in the maximum PV penetration case, while ABC-related algorithms are more efficient and robust in the minimum voltage deviation case. [ABSTRACT FROM AUTHOR]

Socio-cognitive computing is a paradigm developed for the last several years in our research group. It consists of introducing mechanisms inspired by inter-individual learning and cognition into metaheuristics. Different versions of the paradigm have been successfully applied in hybridizing Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO), Genetic Algorithms, Differential Evolution, and Evolutionary Multi-agent System (EMAS) metaheuristics. In this paper, we have followed our previous experiences in order to propose a novel mutation based on socio-cognitive mechanism and test it based on Evolution Strategy (ES). The newly constructed versions were applied to popular benchmarks and compared with their reference versions. [ABSTRACT FROM AUTHOR]

The p-Hub allocation problem is a classic problem in location assignment, which aims to optimize the network by placing Hub devices and allocating each demand node to the corresponding Hub. A mutation Transit search (TS) algorithm with the introduction of the black hole swallowing strategy was proposed to solve the p-Hub allocation problem. Firstly, the mathematical model for the p-Hub allocation problem is established. Six mutation operators specifically designed for p-Hub allocation problem are introduced to enhance the algorithm's ability to escape local optima. Additionally, the black hole swallowing strategy was incorporated into TS algorithm so as to accelerate its convergence rate while ensuring sufficient search in the solution space. The improved TS algorithm was applied to optimize three p-Hub location allocation problems, and the simulation results are compared with those of the basic TS algorithm. Furthermore, the improved TS algorithm is compared with the Honey Badger Algorithm (HBA), Sparrow Search Algorithm (SSA), Harmony Search Algorithm (HS), and Particle Swarm Optimization (PSO) to solve three of p-Hub allocation problems. Finally, the impact of the number of Hubs on the cost of three models was studied, and the simulation results validate the effectiveness of the improved TS algorithm. [ABSTRACT FROM AUTHOR]

The sparse recovery (SR) space-time adaptive processing (STAP) method has excellent clutter suppression performance under the condition of limited observation samples. However, when the cluttering is nonlinear in a spatial-Doppler profile, it will cause an off-grid effect and reduce the sparse recovery performance. A meshless search using a meta-heuristic algorithm (MH) can completely eliminate the off-grid effect in theory. Therefore, genetic algorithm (GA), differential evolution (DE), particle swarm optimization (PSO), and grey wolf optimization (GWO) methods are applied to SR-STAP for selecting exact clutter atoms in this paper. The simulation results show that MH-STAP can estimate the clutter subspace more accurately than the traditional algorithm; PSO-STAP and GWO-STAP showed better clutter suppression performance in four MH-STAP methods. To search for more accurate clutter atoms, PSO and GWO are combined to improve the method's capacity for global optimization. Meanwhile, the fitness function is improved by using prior knowledge of the clutter distribution. The simulation results show that the improved PSO-GWO-STAP algorithm provides excellent clutter suppression performance, which solves the off-grid problem better than does single MH-STAP. [ABSTRACT FROM AUTHOR]

A differential evolution (DE) algorithm with superior-inferior mutation scheme (SIDE) is proposed to solve global optimization problems over continuous space. Firstly, a superior-inferior mutation scheme is introduced based on the superior individual and inferior individual. Secondly, the dynamic adjustment strategy of exploration factor for balancing superior individual and inferior individual is proposed, which indicates how much weight to place on local exploitation and global exploration. They are integrated to DE in different milestones of optimization to balance exploration and exploitation of the search space and can alleviate the premature convergence. In order to verify the performance of SIDE, a set of numerical experiments on 32 benchmark functions are executed for performance comparison with 8 advanced DE variants and 4 non-DE-based algorithms for 30, 50 and 100 variables. The experimental results indicate that SIDE is much better than compared DE algorithms in terms of optimization quality. Furthermore, SIDE has the best adaptability to high dimensional problems. [ABSTRACT FROM AUTHOR]

Under the retailing environment, shelf space-based competition between items with different brands has drawn much attention from practitioners and researchers, the decision for low-temperature stored items on limited shelf spaces are compounding this challenge. This paper discusses the shelf display space partition assignment decision for low-temperature dairy items with two-phase demand in remaining shelf-life to maximize the profit of the shelf. Two-phase demand is assumed for the first time based on the knowledge that consumers' perception on the quality of the dairy item is unequal to its true shelf-life. Moreover, considering shelf partitions in different heights carry different sale gaining potentials, three profit weights are given to the partitions. Herein, a new research model named as SPSPA of shelf profit space partition assignment for the low-temperature stored dairy items is constructed. To effectively solve the proposed SPSPA, a hybrid firefly particle swarm optimization (HFPSO) is developed combing the superiority of particle swarm optimization (PSO) in coarse search and firefly algorithm (FA) in fine search. Numerical experiments have been performed on small- and large-scale cases to verify the performance of the proposed HFPSO algorithm by comparing with genetic algorithm, differential evolution (DE), PSO, and FA based on which management insights are obtained for the shelf space assignment decision. [ABSTRACT FROM AUTHOR]

Differential evolution (DE) has been applied to solve various optimization problems due to its simplicity and high search efficiency. However, researchers have confirmed that it still has some shortcomings such as premature convergence and slow convergence, especially when dealing with complex optimization problems. To address these concerning issues, this paper proposes a hybrid particle swarm-differential evolution algorithm (HPSDE). Firstly, to enhance the optimization performance, a modified updating scheme named particle-swarm mutation strategy is designed and an improved control parameters adaption is developed. Then, DE/rand-to-rand/1 mutation strategy is adopted to increase the population diversity and enhance the ability of particles escaping away from local optima. To achieve an improved DE variant with rapid convergence and fine stability, a random mutation framework is designed to combine the two mutation strategies mentioned above. To evaluate the efficiency of HPSDE algorithm, four different experiments have been taken on twenty-nine benchmark functions. The numerical results validate that HPSDE has better overall performance than the other competitors. Additionally, HPSDE is successfully applied to solve five typical engineering optimization problems. [ABSTRACT FROM AUTHOR]

Automatic tooth arrangement and path planning play an essential role in computer-aided orthodontic treatment. However, state-of-the-art methods have some shortcomings: low efficiency, excessive cost of displacements or collisions and insufficient accuracy. To address these issues, this paper proposes an innovative orthodontic path planning method based on the improved gray wolf optimization algorithm, which is called OPP-IGWO. First, the tooth model is preprocessed to obtain initial pose in which each tooth is segmented and built up with an oriented bounding box. Next, the target pose of each tooth is determined through the ideal dental arch curve and the optimal jaw principle. Finally, the path from the initial pose to the target pose of each tooth is planned based on IGWO, which is improved mainly from three aspects: (1) The greedy idea is adopted to initialize the gray wolf population based on dental interpolation. (2) The linear convergence factor in the traditional gray wolf optimization algorithm (GWO) is replaced with a nonlinear convergence factor. (3) We propose a position update strategy based on a dynamic weighting approach, which introduces a learning rate for each gray wolf. The experimental results show that our OPP-IGWO method outperforms the state-of-the-art methods. Compared with improved genetic algorithm, multiparticle improved swarm optimization, normal simplified mean particle swarm optimization algorithm, improved artificial bee colony algorithm, chaotic gray wolf optimization algorithm, hybrid gray wolf optimization algorithm and differential evolution algorithm, random walk gray wolf Optimization algorithm and reinforcement learning gray wolf optimization algorithm, the OPP-IGWO has an improvement on performance by 15.46%, 2.24%, 7.18%, 15.99%, 7.67%, 1.01%, 1.42%, 10.23%, respectively. [ABSTRACT FROM AUTHOR]

When dealing with problems with more than two objectives, sophisticated multi‐objective optimization algorithms might be needed. Pareto optimization, which is based on the concept of dominated and non‐dominated solutions, is the most widely utilized method when comparing solutions within a multi‐objective setting. However, in the context of optimization, where three or more objectives are involved, the effectiveness of Pareto dominance approaches to drive the solutions to convergence is significantly compromised as more and more solutions tend to be non‐dominated by each other. This in turn reduces the selection pressure, especially for algorithms that rely on evolving a population of solutions such as evolutionary algorithms, particle swarm optimization, differential evolution, etc. The size of the non‐dominated set of trade‐off solutions can be quite large, rendering the decision‐making process difficult if not impossible. The size of the non‐dominated solution set increases exponentially with an increase in the number of objectives. This paper aims to expand a framework for coping with many/multi‐objective and multidisciplinary optimization problems through the introduction of a min‐max metric that behaves like a median measure that can locate the center of a data set. We compare this metric to the Chebyshev norm L_∞ metric that behaves like a mean measure in locating the center of a data set. The median metric is introduced in this paper for the first time, and unlike the mean metric is independent of the data normalization method. These metrics advocate balanced, natural, and minimum compromise solutions about all objectives. We also demonstrate and compare the behavior of the two metrics for a Tradespace case study involving more than 1200 CubeSat design alternatives identifying a manageable set of potential solutions for decision‐makers. [ABSTRACT FROM AUTHOR]

AbstractThere is increasing recognition that the order of administration of drugs in drug combination studies can markedly affect the outcome. Similarly, manufactured products are often sequentially produced and the final quality frequently depends on the order of assembly. Order-of-addition designs account for the order of administration of the components, and they are quite prevalent, yet research in this area is quite limited. Because of the large dimension of such optimization problems, analytical approaches are invariably very limited and apply to simple setups only. Numerical approaches are also seriously underdeveloped. To this end, we employ two exemplary nature-inspired metaheuristic algorithms, Differential Evolution (DE) and Particle Swarm Optimization (PSO), to search for efficient order-of-addition designs for two classes of important inferential problems: (a) estimating parameters in an imprecisely specified model, and (b) constructing space-filling designs without specifying a model. We evaluate the capability of DE and PSO to solve the two classes of order-of-addition design problems and compare their performance with other algorithms that have been used to tackle somewhat similar problems. Using different criteria, we demonstrate that DE and PSO clearly outperform current algorithms by a wide margin. Supplementary materials containing codes to generate all results in this article are available online. [ABSTRACT FROM AUTHOR]

This paper proposed an ensemble methodology comprising neural networks, modified differential evolution algorithm and nonlinear autoregressive network with exogenous inputs (NARX) (called neuro-evolutionary NARX or NE-NARX model) for time series forecasting. In NE-NARX, the structure is designed by connecting the neural model and NARX model, and the weight value connection is optimized by a modified differential evolution algorithm. The effectiveness of the proposed NE-NARX model is tested on two well-known benchmark datasets, including the Canadian lynx and the Wolf sunspot. The proposed model is compared to other models, including the classical backpropagation algorithm, particle swarm optimization, differential evolution (DE) and DE variants. Additionally, an ARIMA model is employed as the benchmark for evaluating the capacity of the proposed model. And then, NE-NARX model is used for hourly energy consumption prediction through comparison with other machine learning models including gated recurrent units, convolutional neural networks (CNN), long short-term memory (LSTM), a hybrid CNN-LSTM and sequence-to-sequence learning. Results show convincingly the superiority of the proposed NE-NARX model over other models. [ABSTRACT FROM AUTHOR]

A differential evolution particle swarm optimization (DEPSO) is presented for the design of a high-phase-sensitivity surface plasmon resonance (SPR) gas sensor. The gas sensor is based on a bilayer metal film with a hybrid structure of blue phosphorene (BlueP)/transition metal dichalcogenides (TMDCs) and MXene. Initially, a Ag-BlueP/TMDCs-Ag-MXene heterostructure is designed, and its performance is compared with that of the conventional layer-by-layer method and particle swarm optimization (PSO). The results indicate that optimizing the thickness of the layers in the gas sensor promotes phase sensitivity. Specifically, the phase sensitivity of the DEPSO is significantly higher than that of the PSO and the conventional method, while maintaining a lower reflectivity. The maximum phase sensitivity achieved is 1.866 × 106 deg/RIU with three layers of BlueP/WS2 and a monolayer of MXene. The distribution of the electric field is also illustrated, demonstrating that the optimized configuration allows for better detection of various gases. Due to its highly sensitive characteristics, the proposed design method based on the DEPSO can be applied to SPR gas sensors for environmental monitoring. [ABSTRACT FROM AUTHOR]

Purpose: The purpose of the study is distributed generation planning in a radial delivery framework to identify an appropriate location with a suitable rating of DG units energized by renewable energy resources to scale back the power loss and to recover the voltage levels. Though several algorithms have already been proposed through the target of power loss reduction and voltage stability enhancement, further optimization of the objectives is improved by using a combination of heuristic algorithms like DE and particle swarm optimization (PSO). Design/methodology/approach: The identification of the candidate buses for the location of DG units and optimal rating of DG units is found by a combined differential evolution (DE) and PSO algorithm. In the combined strategy of DE and PSO, the key merits of both algorithms are combined. The DE algorithm prevents the individuals from getting trapped into the local optimum, thereby providing efficient global optimization. At the same time, PSO provides a fast convergence rate by providing the best particle among the entire iteration to obtain the best fitness value. Findings: The proposed DE-PSO takes advantage of the global optimization of DE and the convergence rate of PSO. The different case studies of multiple DG types are carried out for the suggested procedure for the 33- and 69-bus radial delivery frameworks and a real 16-bus distribution substation in Tamil Nadu to show the effectiveness of the proposed methodology and distribution system performance. From the obtained results, there is a substantial decrease in the power loss and an improvement of voltage levels across all the buses of the system, thereby maintaining the distribution system within the framework of system operation and safety constraints. Originality/value: A comparison of an equivalent system with the DE, PSO algorithm when used separately and other algorithms available in literature shows that the proposed method results in an improved performance in terms of the convergence rate and objective function values. Finally, an economic benefit analysis is performed if a photo-voltaic based DG unit is allocated in the considered test systems. [ABSTRACT FROM AUTHOR]

This paper proposed a parallel deep convolutional neural network optimization algorithm based on Spark and AMPSO (PDCNN-SAMPSO), aiming to address several issues encountered by parallel DCNN algorithms in big data environments, such as excessive redundant parameters, slow convergence speed, easy to fall into local optimal, and low parallel efficiency. Firstly, the algorithm designed a kernel pruning strategy based on importance and similarity (KP-IS) to address the problem of excessive redundant parameters by pruning the redundant convolution kernels in the model. Secondly, it proposed a model parallel training strategy based on adaptive mutation particle swarm optimization algorithm (MPT-AMPSO) to solve the slow convergence speed and easy to fall into local optimal issues of parallel DCNN algorithms by initializing the model parameters using adaptive mutation particle swarm optimization algorithm (AMPSO) . Finally, the algorithm proposed a dynamic load balancing strategy based on node performance (DLBNP) to balance the load of each node in the cluster and improve the parallel efficiency. Experiments show that, when using 8 computing nodes to process the CompCars dataset, the runtime of PDCNN-SAMPSO is 22%, 30%, 37% and 27% lower than that of Dis-CNN, DS-DCNN, CLR-Distributed-CNN and RS-DCNN, respectively, the speedup ratio is higher by 1.707, 1.424, 1.859, and 0.922, respectively, and the top-1 accuracy is higher by 4.01%, 4.89%, 2.42%, 5.94%, indicating that PDCNN-AMPSO has good classification performance in the big data environment and is suitable for parallel training of DCNN models in the big data environment. [ABSTRACT FROM AUTHOR]

Since its original publication in 1978, Lozi's chaotic map has been thoroughly explored and continues to be. Hundreds of publications have analyzed its particular structure and applied its properties in many fields (e.g., improvement of physical devices, electrical components such as memristors, cryptography, optimization, evolutionary algorithms, synchronization, control, secure communications, AI with swarm intelligence, chimeras, solitary states, etc.) through algorithms such as the COLM algorithm (Chaotic Optimization algorithm based on Lozi Map), Particle Swarm Optimization (PSO), and Differential Evolution (DE). In this article, we present a survey based on dozens of articles on the use of this map in algorithms aimed at real applications or applications exploring new directions of dynamical systems such as chimeras and solitary states. [ABSTRACT FROM AUTHOR]

In the last decade, many artificial intelligence (AI) techniques have been used to solve various problems in sustainable energy (SE). Consequently, an increasing volume of research has been devoted to this topic, making it difficult for researchers to keep abreast of its developments. This paper analyzes 18,715 articles—about AI techniques used for SE—indexed in Scopus and published from 2013 to 2022, which were retrieved and selected following a novel iterative methodology. Besides calculating basic bibliometric indicators, we used clustering techniques and a co-occurrence analysis of author keywords to discover and characterize dominant themes in the literature. As a result, we found eight dominant themes in SE (solar energy, smart grids and microgrids, fuel cells, hydrogen, electric vehicles, biofuels, wind energy, and energy planning) and nine dominant techniques in AI (genetic algorithms, support vector machines, particle swarm optimization, differential evolution, classical neural networks, fuzzy logic controllers, reinforcement learning, deep learning, and multi-objective optimization). Each dominant theme is discussed in detail, highlighting the most relevant work and contributions. Finally, we identified the AI techniques most widely used in each SE area to solve its specific problems. [ABSTRACT FROM AUTHOR]

This paper extends our previous algorithm, termed as Particle Swarm Optimization with Distributed Acceleration Constants (PSODAC), which has been introduced for mitigating congestion based on rescheduling in a deregulated environment. The proposed variant adopts a sequential hybridization of the PSODAC principle with Differential Evolution, which is a well-known evolutionary algorithm. The variant in this paper is termed as Sequentially Hybridized Differential Evolution with Particle Swarm Optimization (SH-DEPSO). The experimental investigations are carried out in the IEEE 14 bus system in two scenarios namely, single point congestion and multipoint congestion. Firstly, the performance investigation is carried out on mitigating the congestion using cost analysis, stability analysis, complexity analysis, and strategy analysis. Secondly, the characteristics of the algorithm are observed by performing convergence analysis and investigating the quality of the solution dynamics. The studies demonstrate the competing performance of SH-DEPSO over PSODAC and the traditional PSO. [ABSTRACT FROM AUTHOR]

Differential evolution (DE) stands out as a straightforward yet remarkably powerful evolutionary algorithm employed for real-world problem-solving purposes. In the DE algorithm, few parameters are used, and the population is evolved by applying various operations. It is difficult in evolutionary computation algorithms to maintain population diversity. The main issue is the sub-population of the DE algorithm that helps improve convergence speed and escape from the local optimum. Evolving sub-populations by maintaining diversity is an important issue in the literature that is considered in this research. A solution is proposed that uses sub-populations to promote greater diversity within the population and improve the algorithm performance. DE, heterogeneous distributed differential evolution (HDDE), multi-population ensemble differential evolution (MPEDE), and the proposed improved multi-population ensemble differential evolution (IMPEDE) are implemented using parameter settings; population sizes of 100 NP, 150 NP, and 200 NP; and dimensions of 10D, 30D, and 50D for performance comparison. Different combinations of mutations are used to generate the simulated results. The simulation results are generated using 1000, 3000, and 5000 iterations. Experimental outcomes show the superior results of the proposed IMPEDE over existing algorithms. The non-parametric significance Friedman test confirms that there is a significant difference in the performance of the proposed algorithm and other algorithms used in this study by considering a 0.05 level of significance using six benchmark functions. [ABSTRACT FROM AUTHOR]

The performance of conceptual catchment runoff models may highly depend on the specific choice of calibration methods made by the user. Particle Swarm Optimization (PSO) and Differential Evolution (DE) are two well-known families of Evolutionary Algorithms that are widely used for calibration of hydrological and environmental models. In the present paper, five DE and five PSO optimization algorithms are compared regarding calibration of two conceptual models, namely the Swedish HBV model (Hydrologiska Byrans Vattenavdelning model) and the French GR4J model (modèle du Génie Rural à 4 paramètres Journalier) of the Kamienna catchment runoff. This catchment is located in the middle part of Poland. The main goal of the study was to find out whether DE or PSO algorithms would be better suited for calibration of conceptual rainfall-runoff models. In general, four out of five DE algorithms perform better than four out of five PSO methods, at least for the calibration data. However, one DE algorithm constantly performs very poorly, while one PSO algorithm is among the best optimizers. Large differences are observed between results obtained for calibration and validation data sets. Differences between optimization algorithms are lower for the GR4J than for the HBV model, probably because GR4J has fewer parameters to optimize than HBV. [ABSTRACT FROM AUTHOR]

This paper presents an overview of the history and recent efforts in combining chaos theory and evolutionary computation techniques. Various algorithms from the evolutionary computation domain, also known as metaheuristic algorithms, have been successfully enhanced with chaotic components in the past. Numerous ways to incorporate chaos have been examined, and many impressive results have been reported. Implementations of discrete chaotic maps such as Lozi, Hénon, and logistic map as generators of chaotic pseudo-random sequences for controlling evolution operators in metaheuristics have achieved significant popularity. In this survey, we focus on the research field itself and perform a bibliographical analysis to show how broad and active is nowadays the research field of chaos-enhanced metaheuristics and what are some of the most recent works published. [ABSTRACT FROM AUTHOR]

This paper presents the minimization of total harmonic distortion in a seven-level cascaded H-bridge multilevel inverter with resistive load using the teaching–learning-based optimization algorithm. The minimization of Total Harmonic Distortion (THD)is a challenging optimization problem due to the fact that nonlinear equations are involved. Recently, bio-inspired algorithms have become very popular approaches to solving various optimization problems in different areas of engineering. For this reason, the results obtained with the Teaching–Learning-Based Optimization (TLBO)algorithm were compared with three other popular bio-inspired algorithms, the genetic algorithm, differential evolution, and particle swarm optimization. The comparative analysis, conducted by sweeping the modulation index, made it possible to obtain graphs and data on the behavior of the four analyzed algorithms. Finally, it was concluded that the TLBO algorithm is very effective and is able to solve the THD-minimization problem. Its main advantage over the other algorithms is the fact that it does not require control parameters for its correct operation in the solution of the problem. [ABSTRACT FROM AUTHOR]

This paper proposes an improved algorithm applied to path planning for the inspection of unmanned aerial vehicles (UAVs) in urban pipe corridors, which introduces a collaborative game between spherical vector particle swarm optimization (SPSO) and differential evolution (DE) algorithms. Firstly, a high-precision 3D grid map model of urban pipe corridors is constructed based on the actual urban situation. Secondly, the cost function is formulated, and the constraints for ensuring the safe and smooth inspection of UAVs are proposed to transform path planning into an optimization problem. Finally, a hybrid algorithm of SPSO and DE algorithms based on the Nash bargaining theory is proposed by introducing a cooperative game model for optimizing the cost function to plan the optimal path of UAV inspection in complex urban pipe corridors. To evaluate the performance of the proposed algorithm (GSPSODE), the SPSO, DE, genetic algorithm (GA), and ant colony optimization (ACO) are compared with GSPSODE, and the results show that GSPSODE is superior to other methods in UAV inspection path planning. However, the selection of algorithm parameters, the difference in the experimental environment, and the randomness of experimental results may affect the accuracy of experimental results. In addition, a high-precision urban pipe corridors scenario is constructed based on the RflySim platform to dynamically simulate the optimal path planning of UAV inspection in real urban pipe corridors. [ABSTRACT FROM AUTHOR]

Nowadays, the need for electrical energy became crucial in the world. The co-generation plants, which simultaneously produce electrical and heat energies, are one of the alternative solutions to supply people and industry with both energies. The present work addresses the cost minimization of the nonconvex combined heat and power dispatch problem (CHPED). The nonconvex operating region is handled using the binary method, and the optimization problem is solved using two nature-inspired algorithms, namely the flower pollination algorithm (FPA) and the differential evolution (DE). Penalty functions are adopted to handle all the operating constraints, units' limits, and demands. The results obtained compare the algorithms and those of the literature. It is observed that the fuel cost obtained by the flower pollination algorithm (FPA) is less than the one obtained by the differential evolution (DE) and the particle swarm optimization (PSO). [ABSTRACT FROM AUTHOR]

With the rapid development of the geometric modeling industry and computer technology, the design and shape optimization of complex curve shapes have now become a very important research topic in CAGD. In this paper, the Hybrid Artificial Hummingbird Algorithm (HAHA) is used to optimize complex composite shape-adjustable generalized cubic Ball (CSGC–Ball, for short) curves. Firstly, the Artificial Hummingbird algorithm (AHA), as a newly proposed meta-heuristic algorithm, has the advantages of simple structure and easy implementation and can quickly find the global optimal solution. However, there are still limitations, such as low convergence accuracy and the tendency to fall into local optimization. Therefore, this paper proposes the HAHA based on the original AHA, combined with the elite opposition-based learning strategy, PSO, and Cauchy mutation, to increase the population diversity of the original algorithm, avoid falling into local optimization, and thus improve the accuracy and rate of convergence of the original AHA. Twenty-five benchmark test functions and the CEC 2022 test suite are used to evaluate the overall performance of HAHA, and the experimental results are statistically analyzed using Friedman and Wilkerson rank sum tests. The experimental results show that, compared with other advanced algorithms, HAHA has good competitiveness and practicality. Secondly, in order to better realize the modeling of complex curves in engineering, the CSGC–Ball curves with global and local shape parameters are constructed based on SGC–Ball basis functions. By changing the shape parameters, the whole or local shape of the curves can be adjusted more flexibly. Finally, in order to make the constructed curve have a more ideal shape, the CSGC–Ball curve-shape optimization model is established based on the minimum curve energy value, and the proposed HAHA is used to solve the established shape optimization model. Two representative numerical examples comprehensively verify the effectiveness and superiority of HAHA in solving CSGC–Ball curve-shape optimization problems. [ABSTRACT FROM AUTHOR]

The occurrence of nuclear accidents is unpredictable and destructive, and it is necessary to develop a reasonable evacuation plan in advance to evacuate affected people to safe places. Aiming at the optimization of vehicle evacuation path in a nuclear emergency with fuzzy demand, an uncertainty vehicle evacuation model is modeled with the objective of minimizing the cumulative radiation dose, and a fuzzy-improved genetic algorithm (F_IGA) is proposed. To reduce the influence of parameters on the algorithm, the crossover probability is dynamically adjusted according to the fitness value. Step size is also introduced to improve the position update formula of the elephant herding optimization, and an adaptive crossover approach is proposed, which is used to improve the algorithm's local optimization ability. To improve the global search capability of the algorithm, the roulette wheel strategy and large neighborhood search algorithm are introduced to locally adjusted individuals, and a simulated degradation operator is introduced in the mutation operation. Further, to avoid planning paths that exceed vehicle capacity, different vehicle paths are independently adjusted according to the current environment to reduce the radiation harm to people. Finally, public test cases and road network structures are selected to verify the performance of the algorithm. The results demonstrate that F_IGA outperforms the other algorithms in terms of convergence accuracy, and the number of iteration convergence, and it has more obvious advantages with the increase of the evacuation scale. [ABSTRACT FROM AUTHOR]

With the application of machine learning rapidly gaining popularity in computer science and other fields, neural network techniques have successfully simulated the performance of in-service pavements as they are efficient in predicting and solving nonlinear relationships and in dealing with uncertain large-area pavement problems. In this paper, we address the problem of the optimal timing of preventive maintenance of asphalt pavements to accurately predict the condition index (pavement condition index, PCI) of highway asphalt pavements and develop a highly accurate, long-period, multifactor prediction model with the suitability of preventive maintenance at its core. The prediction model is called differential evolution particle swarm optimization back propagation (DEPSO-BP) neural network, and the input dimension of the prediction model is determined by gray correlation analysis (GCA), and DEPSO is used to improve the search efficiency of BP neural network and the asphalt pavement usage performance with parameter continuity prediction model. Finally, the Qinglan Highway (G22) PCI of Gansu Province, China, is selected for example validation, and the prediction results are compared with those of the four models. The results show that the multifactor prediction model based on DEPSO-BP neural network has good generalization ability. This model is important for improving the economic efficiency of road maintenance, and can be used in the long-cycle process to provide model reference and scientific basis for the subsequent road maintenance budget application and decision-making scheme. [ABSTRACT FROM AUTHOR]

Objectives: Landslide disaster has become the first geological disaster in China. In the process of landslide movement instability, its surface will show certain deformation information, and this deformation information is an important external manifestation of landslide internal change instability, which can be used as an important reference information for landslide prediction and early warning. Therefore, the high-precision prediction of landslide displacement has important reference value for landslide disaster prediction and early warning. Methods: Considering the advantages of the intelligent optimization and machine learning algorithms, a landslide displacement combined prediction model is established. First, the multilayer perceptron (MLP) method is used to preliminary prediction of landslide displacement. Then, the artificial fish swarm algorithm (AFSA) improved based on differential evolution (DE) algorithm is further constructed, and combined with the support vector regression (SVR) to established an optimal combination SVR (OPS⁃ VR) to modify the prediction results calculated by MLP. Results: The two typical landslides monitored by BeiDou show that: (1) For HF08, the single SVR prediction model had a root mean square error (RMSE) of 23.8 mm between the prediction and the true values on the test set, and RMSE for MLP, genetic algorithm-SVR (GA-SVR), particle swarm optimization-SVR (PSO-SVR) and OPSVR prediction models are 19.9 mm, 10.9 mm, 8.3 mm and 8.3 mm, respectively. Compared with the SVR, MLP, GA-SVR, PSO-SVR and OPSVR prediction models, the prediction accuracy of MLP-OPSVR prediction model is improved by 6.2 times, 5.0 times, 2.3 times, 1.5 times and 1.5 times, respectively. The RMSE of MLP-OPSVR prediction model is only 3.3 mm. (2) For HF05, the single SVR prediction model had a RMSE of 26.5 mm between the prediction and the true values on the test set, and RMSE for MLP, GA-SVR, PSO-SVR and OPSVR prediction models are 32.8 mm, 15.4 mm, 15.6 mm and 15.5 mm, respectively. However, the RMSE of MLP-OPSVR prediction model is only 7.0 mm. Compared with the SVR, MLP, GA-SVR, PSO-SVR and OPSVR prediction models, the prediction accuracy of MLP-OPSVR prediction model is improved by 2.8 times, 3.7 times, 1.2 times, 1.2 times and 1.2 times, respectively. Conclusions: The DE algorithm can effectively overcome the outstanding problem that most artificial fish individuals are in random motion in the later stage of AFSA operation and cannot search for the global optimal solution, and improves its optimization performance. Further combined with SVR, it can more reasonably determine the super parameters of SVR and improve its prediction accuracy. Compared with a single MLP and SVR prediction model, as well as combined prediction models of conventional intelligent optimization algorithm (genetic algorithm, particle swarm optimization algorithm) and improved AFSA with SVR, the MLP-OPSVR combined prediction model has higher precision prediction results, and has a good value for popularization and application in landslide warning research. [ABSTRACT FROM AUTHOR]

Aiming at the shortcoming of salp swarm optimization algorithm such as low accuracy, slow convergence speed and easy to fall into local optimum, this paper proposed an adaptive t-distribution and dynamic weight salp swarm optimization algorithm. Firstly, the leader position update introduced the global search stage formula of butterfly optimization algorithm to enhance the global exploration ability. Secondly, the follower location update introduced an adaptive dynamic weighting factor to strengthen the guiding role of elite individuals, so as to enhance the local development ability. Finally, the adaptive t-distribution mutation strategy mutated the optimal individual in order to avoid the algorithm falling into local optimum. By solving 12 benchmark test functions, and according to comparison results of the mean value, standard deviation, solving success rate, Wilcoxon test and convergence curve, the proposed algorithm was superior to standard salp swarm algorithm, the compared other improved salp swarm algorithm and the compared other swarm intelligence algorithms. The results also show that it has a significant improvement in the optimization accuracy and convergence speed, and has the ability to jump out of local optimum. The experimental results verify the effectiveness of the proposed algorithm by applying it to find the lowest point of denitrification inlet concentration. [ABSTRACT FROM AUTHOR]

The Industrial Internet is based on the network, the platform is the core, and the security is the guarantee. The Industrial Internet connects all industry elements and the entire industry chain through the large-scale network infrastructure, collects and analyzes industry data in real time, and forms a new application model for a new generation of information communication. With the rapid development of industrial Internet technology, the scale of industrial Internet data will become larger and larger, and the data dimension will become higher and higher. How to efficiently use cluster analysis for industrial Internet big data mining is an urgent problem that needs to be solved. This paper proposes an improved differential evolution particle swarm algorithm for industrial Internet big data clustering analysis. Differential Evolution (DE) strategy can improve the problem that the particle swarm optimization (PSO) algorithm tends to fall into local optimum in the later stage as the number of iterations increases. Considering the influence of the randomness of the arrangement order of the cluster center vectors among the individuals on the learning and updating among individuals, this paper designs a method of adaptively adjusting the arrangement order of the cluster center vectors to optimize the cluster center vector with maximum similarity among individuals. In order to effectively evaluate our method, both industrial and non-industrial datasets are selected. The experimental results verify the feasibility and effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In order to improve the global optimization of particle swarm optimization (PSO), enhance the performance of PSO in dealing with these complex, high‐dimensional, multimodal optimization problems, and furthermore, promote the optimization effect in reliability optimization applications, a direct position updating‐based trying‐mutation PSO (DTPSO) was proposed. In this algorithm, the direct position updating strategy and trying‐mutation strategy were designed, which could effectively maintain the population diversity, balance the exploitation and exploration, and increase the probability of obtaining global optimal solution. After being verified and compared by nine complex test functions, the rationality of algorithm design and the excellent global optimization performances were proved. In the reliability optimization, the reliability redundancy allocation and reliability allocation were optimized by different advanced improved algorithms, the comparison results proved the stability and optimization performance of DTPSO. Due to its stable and efficient global optimization performance, it was concluded the proposed DTPSO could provide effective technical support for practical applications such as reliability optimization. [ABSTRACT FROM AUTHOR]

To handle the challenges attributed to the distributed generators, the protection system of distribution networks needs to be evolved. Recent protection schemes modify the standard characteristics of overcurrent relays, called non‐standard characteristics. These non‐standard characteristics are mostly case‐dependent and have limitations in solving the variety of protection challenges attributed to distributed generators. This paper analyses the performance of six voltage‐based non‐standard characteristics on photovoltaic distributed generators (PVDG) penetrated 3‐bus, 8‐bus, and IEEE 30‐bus distribution grid, as well as the 9‐bus Canadian radial distribution grid with synchronous distributed generator, wind turbine generator, and PVDG penetrations. Besides that, the optimum coordination of these non‐standard characteristics‐based overcurrent relays is a complex problem due to the involvement of additional controlling parameters. To find the best suitable method, a comparative analysis of the genetic algorithm, differential evolution, artificial bee colony, harmony search algorithm, firefly algorithm, cuckoo search algorithm and particle swarm optimization are performed for optimum relay coordination. The outcomes of the paper are thoroughly discussed for future research on non‐standard characteristics development. [ABSTRACT FROM AUTHOR]