Search

The COVID-19 epidemic has required countries to implement different containment strategies to limit its spread, like strict or weakened national lockdown rules and the application of age-stratified vaccine prioritization strategies. These interventions have in turn modified the age-dependent patterns of social contacts. In our recent paper, starting from the available age-structured real data at the national level, we identified, for the Italian case, specific virulence parameters for a two-age-structured COVID-19 epidemic compartmental model (under 60, and 60 years and over) in six different diseases transmission scenarios under concurrently adopted feedback interventions. An interpretation of how each external scenario modifies the age-dependent patterns of social contacts and the spread of COVID-19 disease has been accordingly provided. In this paper, which can be viewed as a sequel to the previous one, we mainly apply the same general methodology therein (involving the same dynamic model) to new data covering the three subsequent additional scenarios: (i) a mitigated coordinated intermittent regional action in conjunction with the II vaccination phase; (ii) a super-attenuated coordinated intermittent regional action in conjunction with the II vaccination phase; and (iii) a last step towards normality in conjunction with the start of the III vaccination phase. As a new contribution, we show how meaningful updated information can be drawn out, once the identification of virulence parameters, characterizing the two age groups within the latest three different phases, is successfully carried out. Nevertheless, differently from our previous paper, the global optimization procedure is carried out here with the number of susceptible individuals in each scenario being left free to change, to account for reinfection and immunity due to vaccination. Not only do the slightly different estimates we obtain for the previous scenarios not impact any of the previous considerations (and thus illustrate the robustness of the procedure), but also, and mainly, the new results provide a meaningful picture of the evolution of social behaviors, along with the goodness of strategic interventions. [ABSTRACT FROM AUTHOR]

Based on the principles of biomimicry, evolutionary algorithms (EAs) have been widely applied across diverse domains to tackle practical challenges. However, the inherent limitations of these algorithms call for further refinement to strike a delicate balance between global exploration and local exploitation. Thus, this paper introduces a novel multi-strategy enhanced hybrid algorithm called MHWACO, which integrates a Whale Optimization Algorithm (WOA) and Ant Colony Optimization (ACO). Initially, MHWACO employs Gaussian perturbation optimization for individual initialization. Subsequently, individuals selectively undertake either localized exploration based on the refined WOA or global prospecting anchored in the Golden Sine Algorithm (Golden-SA), determined by transition probabilities. Inspired by the collaborative behavior of ant colonies, a Flight Ant (FA) strategy is proposed to guide unoptimized individuals toward potential global optimal solutions. Finally, the Gaussian scatter search (GSS) strategy is activated during low population activity, striking a balance between global exploration and local exploitation capabilities. Moreover, the efficacy of Support Vector Regression (SVR) and random forest (RF) as regression models heavily depends on parameter selection. In response, we have devised the MHWACO-SVM and MHWACO-RF models to refine the selection of parameters, applying them to various real-world problems such as stock prediction, housing estimation, disease forecasting, fire prediction, and air quality monitoring. Experimental comparisons against 9 newly proposed intelligent optimization algorithms and 9 enhanced algorithms across 34 benchmark test functions and the CEC2022 benchmark suite, highlight the notable superiority and efficacy of MSWOA in addressing global optimization problems. Finally, the proposed MHWACO-SVM and MHWACO-RF models outperform other regression models across key metrics such as the Mean Bias Error (MBE), Coefficient of Determination ( R 2 ), Mean Absolute Error (MAE), Explained Variance Score (EVS), and Median Absolute Error (MEAE). [ABSTRACT FROM AUTHOR]

The widespread application of mobile robots holds significant importance for advancing social intelligence. However, as the complexity of the environment increases, existing Obstacle Avoidance Path Planning (OAPP) methods tend to fall into local optimal paths, compromising reliability and practicality. Therefore, based on the Spider-Wasp Optimizer (SWO), this paper proposes an improved OAPP method called the LMBSWO to address these challenges. Firstly, the learning strategy is introduced to enhance the diversity of the algorithm population, thereby improving its global optimization performance. Secondly, the dual-median-point guidance strategy is incorporated to enhance the algorithm's exploitation capability and increase its path searchability. Lastly, a better guidance strategy is introduced to enhance the algorithm's ability to escape local optimal paths. Subsequently, the LMBSWO is employed for OAPP in five different map environments. The experimental results show that the LMBSWO achieves an advantage in collision-free path length, with 100% probability, across five maps of different complexity, while obtaining 80% fault tolerance across different maps, compared to nine existing novel OAPP methods with efficient performance. The LMBSWO ranks first in the trade-off between planning time and path length. With these results, the LMBSWO can be considered as a robust OAPP method with efficient solving performance, along with high robustness. [ABSTRACT FROM AUTHOR]

Differential evolution algorithm is a very powerful and recently proposed evolutionary algorithm. Generally, only a mutation operator and predefined parameter values of differential evolution algorithm are utilized to solve various optimization problems, which limits the performance of the algorithm. In this paper, six commonly used mutation operators are divided into three categories according to their own features. A mutation pool is established based on the three categories. A parameter pool with three predefined values is designed. During evolution, three mutation operators are randomly chosen from the three categories, and three parameter values are also randomly selected from the parameter pool. The three groups of mutation operators and parameter values are employed to produce trial vectors. The proposed algorithm makes good use of different mutation operators. Three recently proposed differential evolution variants and three non-differential evolution algorithms are used to make comparisons on the 29 testing functions from CEC. The experimental results have demonstrated that the proposed algorithm is very competitive. The proposed algorithm is utilized to solve three real applications, and the results are superior. [ABSTRACT FROM AUTHOR]

Flow Direction Algorithm (FDA) has better searching performance than some traditional optimization algorithms. To give the basic Flow Direction Algorithm more effective searching ability and avoid multiple local minima under the searching space, and enable it to obtain better search results, an improved FDA based on the Lévy flight strategy and the self-renewable method (LSRFDA) was proposed in this paper. The Lévy flight strategy and the self-renewable approach were added to the basic Flow Direction Algorithm. Random parameters generated by the Lévy flight strategy can increase the algorithm's diversity of feasible solutions in a short calculation time and greatly enhance the operational efficiency of the algorithm. The self-renewable method lets the algorithm quickly obtain a better possible solution and jump to the local solution space. Then, this paper tested different mathematical testing functions, including low-dimensional and high-dimensional functions, and the test results were compared with those of different algorithms. This paper includes iterative figures, box plots, and search paths to show the different performances of the LSRFDA. Finally, this paper calculated different engineering optimization problems. The test results show that the proposed algorithm in this paper has better searching ability and quicker searching speed than the basic Flow Direction Algorithm. [ABSTRACT FROM AUTHOR]

This paper introduces a novel formulation of the clustering problem, namely, the minimum sum-of-squares clustering of infinitely tall data (MSSC-ITD), and presents HPClust, an innovative set of hybrid parallel approaches for its effective solution. By utilizing modern high-performance computing techniques, HPClust enhances key clustering metrics: effectiveness, computational efficiency, and scalability. In contrast to vanilla data parallelism, which only accelerates processing time through the MapReduce framework, our approach unlocks superior performance by leveraging the multi-strategy competitive–cooperative parallelism and intricate properties of the objective function landscape. Unlike other available algorithms that struggle to scale, our algorithm is inherently parallel in nature, improving solution quality through increased scalability and parallelism and outperforming even advanced algorithms designed for small- and medium-sized datasets. Our evaluation of HPClust, featuring four parallel strategies, demonstrates its superiority over traditional and cutting-edge methods by offering better performance in the key metrics. These results also show that parallel processing not only enhances the clustering efficiency, but the accuracy as well. Additionally, we explore the balance between computational efficiency and clustering quality, providing insights into optimal parallel strategies based on dataset specifics and resource availability. This research advances our understanding of parallelism in clustering algorithms, demonstrating that a judicious hybridization of advanced parallel approaches yields optimal results for MSSC-ITD. Experiments on the synthetic data further confirm HPClust's exceptional scalability and robustness to noise. [ABSTRACT FROM AUTHOR]

The vehicle routing problem with time windows (VRPTW) remains a formidable challenge, due to the intricate constraints of vehicle capacity and time windows. As a result, an algorithm tailored for this problem must demonstrate robust search capabilities and profound exploration abilities. Traditional methods often struggle to balance global search capabilities with computational efficiency, thus limiting their practical applicability. To address these limitations, this paper introduces a novel hybrid algorithm known as large neighborhood search with modified rat swarm optimization (LNS-MRSO). Modified rat swarm optimization (MRSO) is inspired by the foraging behavior of rat swarms and simulates the search process for optimization problems. Meanwhile, large neighborhood search (LNS) generates potential new solutions by removing and reinserting operators, incorporating a mechanism to embrace suboptimal solutions and strengthening the algorithm's prowess in global optimization. Initial solutions are greedily generated, and five operators are devised to mimic the position updates of the rat swarm, providing rich population feedback to LNS and further enhancing algorithm performance. To validate the effectiveness of LNS-MRSO, experiments were conducted using the Solomon VRPTW benchmark test set. The results unequivocally demonstrate that LNS-MRSO achieves optimal solutions for all 39 test instances, particularly excelling on the R2 and RC2 datasets with percentage deviations improved by 5.1% and 8.8%, respectively, when compared to the best-known solutions (BKSs). Furthermore, when compared to state-of-the-art algorithms, LNS-MRSO exhibits remarkable advantages in addressing VRPTW problems with high loading capacities and lenient time windows. Additionally, applying LNS-MRSO to an unmanned concrete-mixing station further validates its practical utility and scalability. [ABSTRACT FROM AUTHOR]

This paper presents a novel variant of the teaching–learning-based optimization algorithm, termed BLTLBO, which draws inspiration from the blended learning model, specifically designed to tackle high-dimensional multimodal complex optimization problems. Firstly, the perturbation conditions in the "teaching" and "learning" stages of the original TLBO algorithm are interpreted geometrically, based on which the search capability of the TLBO is enhanced by adjusting the range of values of random numbers. Second, a strategic restructuring has been ingeniously implemented, dividing the algorithm into three distinct phases: pre-course self-study, classroom blended learning, and post-course consolidation; this structural reorganization and the random crossover strategy in the self-learning phase effectively enhance the global optimization capability of TLBO. To evaluate its performance, the BLTLBO algorithm was tested alongside seven distinguished variants of the TLBO algorithm on thirteen multimodal functions from the CEC2014 suite. Furthermore, two excellent high-dimensional optimization algorithms were added to the comparison algorithm and tested in high-dimensional mode on five scalable multimodal functions from the CEC2008 suite. The empirical results illustrate the BLTLBO algorithm's superior efficacy in handling high-dimensional multimodal challenges. Finally, a high-dimensional portfolio optimization problem was successfully addressed using the BLTLBO algorithm, thereby validating the practicality and effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

In this paper, attention is focused on the analysis and optimization of energy flows in networked systems via a fluid-dynamic approach. Considering the real case of an energy hub, the proposed model deals with conservation laws on arcs and linear programming problems at nodes. Optimization of the energy flows is accomplished by considering a cost functional, which estimates a term proportional to the kinetic energy of the overall system in consideration. As the real optimization issue deals with an integral formulation for which precise solutions have to be studied through variational methods, a decentralized approach is considered. First, the functional is optimized for a simple network having a unique node, with an incoming arc and two outgoing ones. The optimization deals with distribution coefficients, and explicit solutions are found. Then, global optimization is obtained via the local optimal parameters at the various nodes of the real system. The obtained results prove the correctness of the proposed approach and show the evident advantages of optimization procedures dealing with variational approaches. [ABSTRACT FROM AUTHOR]

Particle Swarm Optimization (PSO) is facing more challenges in solving high-dimensional global optimization problems. In order to overcome this difficulty, this paper proposes a novel PSO variant of the hybrid Sine Cosine Algorithm (SCA) strategy, named Velocity Four Sine Cosine Particle Swarm Optimization (VFSCPSO). The introduction of the SCA strategy in the velocity formulation ensures that the global optimal solution is found accurately. It increases the flexibility of PSO. A series of experiments are conducted on the CEC2005 test suite with compositional algorithms, algorithmic variants, and good intelligent algorithms. The experimental results show that the algorithm effectively improves the overall performance of compositional algorithms; the Friedman test proves that the algorithm has good competitiveness. The algorithm also performs better in PID parameter tuning. Therefore, the VFSCPSO is able to solve the high-dimensional global optimization problems in a better way. [ABSTRACT FROM AUTHOR]

The Whale Optimization Algorithm (WOA) is a swarm intelligence algorithm based on natural heuristics, which has gained considerable attention from researchers and engineers. However, WOA still has some limitations, including limited global search efficiency and a slow convergence rate. To address these issues, this paper presents an improved whale optimization algorithm with multiple strategies, called Dynamic Gain-Sharing Whale Optimization Algorithm (DGSWOA). Specifically, a Sine–Tent–Cosine map is first adopted to more effectively initialize the population, ensuring a more uniform distribution of individuals across the search space. Then, a gaining–sharing knowledge based algorithm is used to enhance global search capability and avoid falling into a local optimum. Finally, to increase the diversity of solutions, Dynamic Opposition-Based Learning is incorporated for population updating. The effectiveness of our approach is evaluated through comparative experiments on blackbox optimization benchmarking and two engineering application problems. The experimental results suggest that the proposed method is competitive in terms of solution quality and convergence speed in most cases. [ABSTRACT FROM AUTHOR]

The Harris Hawks Optimization algorithm (HHO) is a sophisticated metaheuristic technique that draws inspiration from the hunting process of Harris hawks, which has gained attention in recent years. However, despite its promising features, the algorithm exhibits certain limitations, including the tendency to converge to local optima and a relatively slow convergence speed. In this paper, we propose the multi-strategy improved HHO algorithm (MSI-HHO) as an enhancement to the standard HHO algorithm, which adopts three strategies to improve its performance, namely, inverted S-shaped escape energy, a stochastic learning mechanism based on Gaussian mutation, and refracted opposition-based learning. At the same time, we conduct a comprehensive comparison between our proposed MSI-HHO algorithm with the standard HHO algorithm and five other well-known metaheuristic optimization algorithms. Extensive simulation experiments are conducted on both the 23 classical benchmark functions and the IEEE CEC 2020 benchmark functions. Then, the results of the non-parametric tests indicate that the MSI-HHO algorithm outperforms six other comparative algorithms at a significance level of 0.05 or greater. Additionally, the visualization analysis demonstrates the superior convergence speed and accuracy of the MSI-HHO algorithm, providing evidence of its robust performance. [ABSTRACT FROM AUTHOR]

In the prediction of a nonlinear time series based on a leaky integrator echo state network (leaky-ESN), building a reservoir related to the specific problem is a key step. For problems such as poor performance of randomly generated reservoirs, it is tough to determine the parameter values of the reservoirs. The work in this paper uses the gravitational search algorithm (GSA) to optimize the global parameters of a leaky-ESN, such as the leaking rate, the spectral radius, and the input scaling factor. The basic GSA has some problems, such as slow convergence and poor balance between exploration and exploitation, and it cannot solve some complex optimization problems well. To solve these problems, an improved gravitational search algorithm (IGSA) is proposed in this paper. First, the best agent and elite agents were archived and utilized to accelerate the exploration phase and improve the convergence rate in the exploitation phase. Second, to improve the effect of the poor fitness agents on the optimization result, a differential mutation strategy was proposed, which generated new individuals to replace original agents with worse fitness, increasing the diversity of the population and improving the global optimization ability of the algorithm. Finally, two simulation experiments showed that the leaky-ESN optimized by the IGSA had better prediction accuracy. [ABSTRACT FROM AUTHOR]

This paper introduces novel enhancements to the most recent versions of DIRECT-type algorithms, especially when dealing with solutions located at the hyper-rectangle vertices. The BIRECT algorithm encounters difficulties in efficiently sampling points at the boundaries of the feasible region, leading to potential slowdowns in convergence. This issue is particularly pronounced when the optimal solution resides near the boundary. Our research explores diverse approaches, with a primary focus on incorporating a grouping strategy for hyper-rectangles of similar sizes. This categorization into different classes, constrained by a predefined threshold, aims to enhance computational efficiency, particularly involving a substantial number of hyper-rectangles of varying sizes. To further improve the new algorithm's efficiency, we implemented a mechanism to prevent oversampling and mitigate redundancy in sampling at shared vertices within descendant sub-regions. Comparisons with several DIRECT-type algorithms highlight the promising nature of the proposed algorithms as a global optimization solution. Statistical analyses, including Friedman and Wilcoxon tests, demonstrated the effectiveness of the improvements introduced in this new algorithm. [ABSTRACT FROM AUTHOR]

As engineering systems become increasingly complex, reliability-based design optimization (RBDO) has been extensively studied in recent years and has made great progress. In order to achieve better optimization results, the mathematical model used needs to consider a large number of uncertain factors. Especially when considering mixed uncertainty factors, the contradiction between the large computational cost and the efficiency of the optimization algorithm becomes increasingly fierce. How to quickly find the optimal most probable point (MPP) will be an important research direction of RBDO. To solve this problem, this paper constructs a new RBDO method framework by combining an improved particle swarm algorithm (PSO) with excellent global optimization capabilities and a decoupling strategy using a simulated annealing algorithm (SA). This study improves the efficiency of the RBDO solution by quickly solving MPP points and decoupling optimization strategies. At the same time, the accuracy of RBDO results is ensured by enhancing global optimization capabilities. Finally, this article illustrates the superiority and feasibility of this method through three calculation examples. [ABSTRACT FROM AUTHOR]

Data envelopment analysis (DEA) is a leading approach in performance analysis and discovering newer benchmarks, and the traditional DEA models cannot forecast the future efficiency of decision-making units (DMUs). Machine learning, such as the artificial neural networks (ANNs), support vector machine/regression (SVM/SVR), projection pursuit regression (PPR), etc., have been viewed as beneficial for managers in predicting system behaviors. PPR is especially suitable for small and non-normal distribution samples, the usual cases in DEA analysis. This paper integrates DEA and PPR to cover the shortcomings we faced while using DEA and DEA-BPNN, DEA-SVR, etc. This study explores the advantages of combining these complementary methods into an integrated performance measurement and prediction model. Firstly, the DEA approach is used to evaluate and rank the efficiency of DMUs. Secondly, we establish two DEA-PPR combined models to describe the DEA efficiency scores (also called the production function) and the DEA-efficient frontier function. The first combined model's input variables are input–output indicators in the DEA model, and the output variable is the DEA efficiency. In the second model, its input variables are input or output indicators in the DEA model, and the output variable is the optimal input indicator for input-oriented DEA or the output indicator for output-oriented DEA. We conducted positive research on two examples with actual data and virtual small, medium-sized, and large samples. Compared with the DEA-BPNN and DEA-SVR models, the results show that the DEA-PPR combined model has more vital global optimization ability, better convergence, higher accuracy, and a simple topology. The DEA-PPR model can obtain robust results for both small and large cases. The DEA-BPNN and DEA-SVR models cannot obtain robust results for small and medium-sized samples due to overfitting. For large samples, the DEA-PPR model outperforms DEA-BPNN, DEA-SVR, etc. The DEA-PPR combined model possesses better suitability, applicability, and reliability than the DEA-BPNN model, the DEA-SVR model, etc. [ABSTRACT FROM AUTHOR]

Autonomous driving technology heavily depends on accurate and smooth path tracking. Facing complex urban driving scenarios, developing a suite of high-performance and robust parameters for controllers becomes imperative. This paper proposes a stochastic simulation-based optimization model for optimizing the Proportional–Integral–Differential (PID) controller parameters, with tracking accuracy and smoothness as bi-objectives, and solves it using a domination-measure-based efficient global optimization (DMEGO) algorithm. In this model, the tracking accuracy and smoothness are indexed by the normalized dynamic time warping (NDTW) and the mean absolute lateral acceleration (MALA), respectively. In addition, we execute the PID controller in a realistic simulation environment using a CARLA simulator, which consider various city scenes, diverse routes, different vehicle types, road slopes, etc., to provide a comprehensive and reliable evaluation for the designed PID controller. In the DMEGO method, each solution undergoes evaluation using a fixed number of costly simulations. Then, utilizing the solutions and their estimated bi-objective values, two surrogate models for the bi-objectives are constructed using the Gaussian process (GP) model. The preliminary nondominated solutions can be obtained by optimizing the two surrogate models. Finally, a novel performance metric known as the domination measure is employed to evaluate the quality of each solution. This metric is then integrated with the crowding distance to selectively retain a candidate solution exhibiting superior performance and good diversity for the next iteration. In our numerical experiments, we first test the DMEGO algorithm against three other counterparts using a stochastic FON benchmark. The proposed approach is then employed to optimize the PID parameters considering the complexity and uncertainty of urban traffic. The numerical results demonstrate that the nondominated solutions obtained by DMEGO exhibit excellent performance in terms of tracking accuracy and smoothness under limited simulation budgets. Overall, the proposed approach may be a viable tool for solving multi-objective simulation-based optimization problem under uncertainties. [ABSTRACT FROM AUTHOR]

The group teaching optimization algorithm (GTOA) is a meta heuristic optimization algorithm simulating the group teaching mechanism. The inspiration of GTOA comes from the group teaching mechanism. Each student will learn the knowledge obtained in the teacher phase, but each student's autonomy is weak. This paper considers that each student has different learning motivations. Elite students have strong self-learning ability, while ordinary students have general self-learning motivation. To solve this problem, this paper proposes a learning motivation strategy and adds random opposition-based learning and restart strategy to enhance the global performance of the optimization algorithm (MGTOA). In order to verify the optimization effect of MGTOA, 23 standard benchmark functions and 30 test functions of IEEE Evolutionary Computation 2014 (CEC2014) are adopted to verify the performance of the proposed MGTOA. In addition, MGTOA is also applied to six engineering problems for practical testing and achieved good results. [ABSTRACT FROM AUTHOR]

This article considers a box-constrained global optimization problem for Lipschitz continuous functions with an unknown Lipschitz constant. The well-known derivative-free global search algorithm DIRECT (DIvide RECTangle) is a promising approach for such problems. Several studies have shown that recent two-step (global and local) Pareto selection-based algorithms are very efficient among all DIRECT-type approaches. However, despite its encouraging performance, it was also observed that the candidate selection procedure has two possible shortcomings. First, there is no limit on how small the size of selected candidates can be. Secondly, a balancing strategy between global and local candidate selection is missing. Therefore, it may waste function evaluations by over-exploring the current local minimum and delaying finding the global one. This paper reviews and employs different strategies in a two-step Pareto selection framework (1-DTC-GL) to overcome these limitations. A detailed experimental study has revealed that existing strategies do not always improve and sometimes even worsen results. Since 1-DTC-GL is a DIRECT-type algorithm, the results of this paper provide general guidance for all DIRECT-type algorithms on how to deal with excessive local refinement more efficiently. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the problem of optimal control of complex multistage chemical reactions, which is considered a nonlinear global constrained optimization problem. This class of problems is computationally expensive due to the inclusion of multiple parameters and requires parallel computing systems and algorithms to obtain a solution within a reasonable time. However, the efficiency of parallel algorithms can differ depending on the architecture of the computing system. One available approach to deal with this is the development of specialized optimization algorithms that consider not only problem-specific features but also peculiarities of a computing system in which the algorithms are launched. In this work, we developed a novel parallel population algorithm based on the mind evolutionary computation method. This algorithm is designed for desktop girds and works in synchronous and asynchronous modes. The algorithm and its software implementation were used to solve the problem of the catalytic reforming of gasoline and to study the parallelization efficiency. Results of the numerical experiments are presented in this paper. [ABSTRACT FROM AUTHOR]

In this paper, we would first like to promote an interesting idea for identifying the local minimizer of a non-convex optimization problem with the global minimizer of a convex optimization one. Secondly, to give an extension of their sparse regularization model for inverting incomplete Fourier transforms introduced. Thirdly, following the same lines, to develop convergence guaranteed efficient iteration algorithm for solving the resulting nonsmooth and nonconvex optimization problem but here using applied nonlinear analysis tools. These both lead to a simplification of the proofs and to make a connection with classical works in this filed through a startling comment. [ABSTRACT FROM AUTHOR]

Harris Hawk Optimization (HHO) is a well-known nature-inspired metaheuristic model inspired by the distinctive foraging strategy and cooperative behavior of Harris Hawks. As with numerous other algorithms, HHO is susceptible to getting stuck in local optima and has a sluggish convergence rate. Several techniques have been proposed in the literature to improve the performance of metaheuristic algorithms (MAs) and to tackle their limitations. Chaos optimization strategies have been proposed for many years to enhance MAs. There are four distinct categories of Chaos strategies, including chaotic mapped initialization, randomness, iterations, and controlled parameters. This paper introduces SHHOIRC, a novel hybrid algorithm designed to enhance the efficiency of HHO. Self-adaptive Harris Hawk Optimization using three chaotic optimization methods (SHHOIRC) is the proposed algorithm. On 16 well-known benchmark functions, the proposed hybrid algorithm, authentic HHO, and five HHO variants are evaluated. The computational results and statistical analysis demonstrate that SHHOIRC exhibits notable similarities to other previously published algorithms. The proposed algorithm outperformed the other algorithms by 81.25%, compared to 18.75% for the prior algorithms, by obtaining the best average solutions for 13 benchmark functions. Furthermore, the proposed algorithm is tested on a real-life problem, which is the maximum coverage problem of Wireless Sensor Networks (WSNs), and compared with pure HHO, and two well-known algorithms, Grey Wolf Optimization (GWO) and Whale Optimization Algorithm (WOA). For the maximum coverage experiments, the proposed algorithm demonstrated superior performance, surpassing other algorithms by obtaining the best coverage rates of 95.4375% and 97.125% for experiments 1 and 2, respectively. [ABSTRACT FROM AUTHOR]

This study aims to achieve rapid and stable control of quadrotor unmanned aerial vehicles' (UAVs) attitude by using an Active Disturbance Rejection Control (ADRC) controller. Addressing the challenge of numerous and complex ADRC parameters, optimization algorithms are employed for parameter tuning. This paper draws on the group mechanism of the Ant Colony Optimization (ACO) algorithm and innovatively introduces population search into the Beetle Antennae Search (BAS) algorithm. The refined algorithm is then applied to tune the ADRC parameters, reducing complexity and human intervention while enhancing intelligence and efficiency. The advanced optimization algorithm exhibits an exceptional global optimization capacity, convergence speed, and stability. Ultimately, flight simulation and experimental results suggest that the optimized ADRC controller demonstrates superior control and antidisturbance capabilities. [ABSTRACT FROM AUTHOR]

The spherical evolution algorithm (SE) is a unique algorithm proposed in recent years and widely applied to new energy optimization problems with notable achievements. However, the existing improvements based on SE are deemed insufficient due to the challenges arising from the multiple choices of operators and the utilization of a spherical search method. In this paper, we introduce an enhancement method that incorporates weights in individuals' dimensions that are affected by individual fitness during the iteration process, aiming to improve SE by adaptively balancing the tradeoff between exploitation and exploration during convergence. This is achieved by reducing the randomness of dimension selection and enhancing the retention of historical information in the iterative process of the algorithm. This new SE improvement algorithm is named DWSE. To evaluate the effectiveness of DWSE, in this study, we apply it to the CEC2017 standard test set, the CEC2013 large-scale global optimization test set, and 22 real-world problems from CEC2011. The experimental results substantiate the effectiveness of DWSE in achieving improvement. [ABSTRACT FROM AUTHOR]

Differential evolution (DE) has shown remarkable performance in solving continuous optimization problems. However, its optimization performance still encounters limitations when confronted with complex optimization problems with lots of local regions. To address this issue, this paper proposes a dual elite groups-guided mutation strategy called "DE/current-to-duelite/1" for DE. As a result, a novel DE variant called DEGGDE is developed. Instead of only using the elites in the current population to direct the evolution of all individuals, DEGGDE additionally maintains an archive to store the obsolete parent individuals and then assembles the elites in both the current population and the archive to guide the mutation of all individuals. In this way, the diversity of the guiding exemplars in the mutation is expectedly promoted. With the guidance of these diverse elites, a good balance between exploration of the complex search space and exploitation of the found promising regions is hopefully maintained in DEGGDE. As a result, DEGGDE expectedly achieves good optimization performance in solving complex optimization problems. A large number of experiments are conducted on the CEC'2017 benchmark set with three different dimension sizes to demonstrate the effectiveness of DEGGDE. Experimental results have confirmed that DEGGDE performs competitively with or even significantly better than eleven state-of-the-art and representative DE variants. [ABSTRACT FROM AUTHOR]

Differential evolution (DE) is a simple, effective, and robust algorithm, which has demonstrated excellent performance in dealing with global optimization problems. However, different search strategies are designed for different fitness landscape conditions to find the optimal solution, and there is not a single strategy that can be suitable for all fitness landscapes. As a result, developing a strategy to adaptively steer population evolution based on fitness landscape is critical. Motivated by this fact, in this paper, a novel adaptive DE based on fitness landscape (FL-ADE) is proposed, which utilizes the local fitness landscape characteristics in each generation population to (1) adjust the population size adaptively; (2) generate DE/current-to-pcbest mutation strategy. The adaptive mechanism is based on local fitness landscape characteristics of the population and enables to decrease or increase the population size during the search. Due to the adaptive adjustment of population size for different fitness landscapes and evolutionary processes, computational resources can be rationally assigned at different evolutionary stages to satisfy diverse requirements of different fitness landscapes. Besides, the DE/current-to-pcbest mutation strategy, which randomly chooses one of the top p% individuals from the archive cbest of local optimal individuals to be the pcbest, is also an adaptive strategy based on fitness landscape characteristic. Using the individuals that are approximated as local optimums increases the algorithm's ability to explore complex multimodal functions and avoids stagnation due to the use of individuals with good fitness values. Experiments are conducted on CEC2014 benchmark test suit to demonstrate the performance of the proposed FL-ADE algorithm, and the results show that the proposed FL-ADE algorithm performs better than the other seven highly performing state-of-art DE variants, even the winner of the CEC2014 and CEC2017. In addition, the effectiveness of the adaptive population mechanism and DE/current-to-pcbest mutation strategy based on landscape fitness proposed in this paper are respectively verified. [ABSTRACT FROM AUTHOR]

In this paper, a hybrid gradient simulated annealing algorithm is guided to solve the constrained optimization problem. In trying to solve constrained optimization problems using deterministic, stochastic optimization methods or hybridization between them, penalty function methods are the most popular approach due to their simplicity and ease of implementation. There are many approaches to handling the existence of the constraints in the constrained problem. The simulated-annealing algorithm (SA) is one of the most successful meta-heuristic strategies. On the other hand, the gradient method is the most inexpensive method among the deterministic methods. In previous literature, the hybrid gradient simulated annealing algorithm (GLMSA) has demonstrated efficiency and effectiveness to solve unconstrained optimization problems. In this paper, therefore, the GLMSA algorithm is generalized to solve the constrained optimization problems. Hence, a new approach penalty function is proposed to handle the existence of the constraints. The proposed approach penalty function is used to guide the hybrid gradient simulated annealing algorithm (GLMSA) to obtain a new algorithm (GHMSA) that finds the constrained optimization problem. The performance of the proposed algorithm is tested on several benchmark optimization test problems and some well-known engineering design problems with varying dimensions. Comprehensive comparisons against other methods in the literature are also presented. The results indicate that the proposed method is promising and competitive. The comparison results between the GHMSA and the other four state-Meta-heuristic algorithms indicate that the proposed GHMSA algorithm is competitive with, and in some cases superior to, other existing algorithms in terms of the quality, efficiency, convergence rate, and robustness of the final result. [ABSTRACT FROM AUTHOR]

Particle swarm optimization (PSO) has exhibited well-known feasibility in problem optimization. However, its optimization performance still encounters challenges when confronted with complicated optimization problems with many local areas. In PSO, the interaction among particles and utilization of the communication information play crucial roles in improving the learning effectiveness and learning diversity of particles. To promote the communication effectiveness among particles, this paper proposes a stochastic triad topology to allow each particle to communicate with two random ones in the swarm via their personal best positions. Then, unlike existing studies that employ the personal best positions of the updated particle and the neighboring best position of the topology to direct its update, this paper adopts the best one and the mean position of the three personal best positions in the associated triad topology as the two guiding exemplars to direct the update of each particle. To further promote the interaction diversity among particles, an archive is maintained to store the obsolete personal best positions of particles and is then used to interact with particles in the triad topology. To enhance the chance of escaping from local regions, a random restart strategy is probabilistically triggered to introduce initialized solutions to the archive. To alleviate sensitivity to parameters, dynamic adjustment strategies are designed to dynamically adjust the associated parameter settings during the evolution. Integrating the above mechanism, a stochastic triad topology-based PSO (STTPSO) is developed to effectively search complex solution space. With the above techniques, the learning diversity and learning effectiveness of particles are largely promoted and thus the developed STTPSO is expected to explore and exploit the solution space appropriately to find high-quality solutions. Extensive experiments conducted on the commonly used CEC 2017 benchmark problem set with different dimension sizes substantiate that the proposed STTPSO achieves highly competitive or even much better performance than state-of-the-art and representative PSO variants. [ABSTRACT FROM AUTHOR]

This paper introduces an innovative extension of the DIRECT algorithm specifically designed to solve global optimization problems that involve Lipschitz continuous functions subject to linear constraints. Our approach builds upon recent advancements in DIRECT-type algorithms, incorporating novel techniques for partitioning and selecting potential optimal hyper-rectangles. A key contribution lies in applying a new mapping technique to eliminate the infeasible region efficiently. This allows calculations to be performed only within the feasible region defined by linear constraints. We perform extensive tests using a diverse set of benchmark problems to evaluate the effectiveness and performance of the proposed algorithm compared to existing DIRECT solvers. Statistical analyses using Friedman and Wilcoxon tests demonstrate the superiority of a new algorithm in solving such problems. [ABSTRACT FROM AUTHOR]

This paper presents a novel composite heuristic algorithm for global optimization by organically integrating the merits of a water cycle algorithm (WCA) and gravitational search algorithm (GSA). To effectively reinforce the exploration and exploitation of algorithms and reasonably achieve their balance, a modified WCA is first put forward to strengthen its search performance by introducing the concept of the basin, where the position of the solution is also considered into the assignment of the sea or river and its streams, and the number of the guider solutions is adaptively reduced during the search process. Furthermore, the enhanced WCA is adaptively cooperated with the gravitational search to search for new solutions based on their historical performance within a certain stage. Moreover, the binomial crossover operation is also incorporated after the water cycle search or the gravitational search to further improve the search capability of the algorithm. Finally, the performance of the proposed algorithm is evaluated by comparing with six excellent meta-heuristic algorithms on the IEEE CEC2014 test suite, and the numerical results indicate that the proposed algorithm is very competitive. [ABSTRACT FROM AUTHOR]

End-to-end obstacle avoidance path planning for intelligent vehicles has been a widely studied topic. To resolve the typical issues of the solving algorithms, which are weak global optimization ability, ease in falling into local optimization and slow convergence speed, an efficient optimization method is proposed in this paper, based on the whale optimization algorithm. We present an adaptive adjustment mechanism which can dynamically modify search behavior during the iteration process of the whale optimization algorithm. Meanwhile, in order to coordinate the global optimum and local optimum of the solving algorithm, we introduce a controllable variable which can be reset according to specific routing scenarios. The evolutionary strategy of differential variation is also applied in the algorithm presented to further update the location of search individuals. In numerical experiments, we compared the proposed algorithm with the following six well-known swarm intelligence optimization algorithms: Particle Swarm Optimization (PSO), Bat Algorithm (BA), Gray Wolf Optimization Algorithm (GWO), Dragonfly Algorithm (DA), Ant Lion Algorithm (ALO), and the traditional Whale Optimization Algorithm (WOA). Our method gave rise to better results for the typical twenty-three benchmark functions. In regard to path planning problems, we observed an average improvement of 18.95% in achieving optimal solutions and 77.86% in stability. Moreover, our method exhibited faster convergence compared to some existing approaches. [ABSTRACT FROM AUTHOR]

In optimizing the energy consumption of a cellular space robot (CSR) climbing in orbit, traditional trajectory planning methods do not include the configuration as a decision variable; thus, it is difficult to obtain an effective energy-optimal climbing strategy for CSRs. To solve this kind of problem, first, we considered the effect of configuration on the kinetic parameters of the robot and established the kinetic equations of a variable-size cellular space robot by combining the spin volume and Lagrange equations. Second, we constructed a higher-order continuous joint trajectory using a cubic spline curve and combined it with a robot dynamics model to establish a robot climbing energy consumption model. Finally, for the energy consumption problem of climbing in cellular space robots, we proposed a comprehensive optimization algorithm considering the configuration and climbing time. Compared with another algorithm in the literature, the algorithm proposed in this paper has stronger global optimization capability and convergence. The simulation results have important theoretical significance and engineering practical value for the study of space robot on-orbit climbing trajectory optimization strategies. [ABSTRACT FROM AUTHOR]

The Competitive Swarm Optimizer (CSO) has emerged as a prominent technique for solving intricate optimization problems by updating only half of the population in each iteration. Despite its effectiveness, the CSO algorithm often exhibits a slow convergence rate and a tendency to become trapped in local optimal solutions, as is common among metaheuristic algorithms. To address these challenges, this paper proposes a hybrid approach combining the CSO with the Salp Swarm algorithm (SSA), CL-SSA, to increase the convergence rate and enhance search space exploration. The proposed approach involves a two-step process. In the first step, a pairwise competition mechanism is introduced to segregate the solutions into winners and losers. The winning population is updated through strong exploitation using the SSA algorithm. In the second step, non-winning solutions learn from the winners, achieving a balance between exploration and exploitation. The performance of the CL-SSA is evaluated on various benchmark functions, including the CEC2017 benchmark with dimensions 50 and 100, the CEC2008lsgo benchmark with dimensions 200, 500 and 1000, as well as a set of seven well-known constrained design challenges in various engineering domains defined in the CEC2020 conference. The CL-SSA is compared to other metaheuristics and advanced algorithms, and its results are analyzed through statistical tests such as the Friedman and Wilcoxon rank-sum tests. The statistical analysis demonstrates that the CL-SSA algorithm exhibits improved exploitation, exploration, and convergence patterns compared to other algorithms, including SSA and CSO, as well as popular algorithms. Furthermore, the proposed hybrid approach performs better in solving most test functions. [ABSTRACT FROM AUTHOR]

The novel coronavirus pandemic is a major global public health emergency, and has presented new challenges and requirements for the timely response and operational stability of emergency logistics that were required to address the major public health events outbreak in China. Based on the problems of insufficient timeliness and high total system cost of emergency logistics distribution in major epidemic situations, this paper takes the minimum vehicle distribution travel cost, time cost, early/late punishment cost, and fixed cost of the vehicle as the target, the soft time window for receiving goods at each demand point, the rated load of the vehicle, the volume, maximum travel of the vehicle in a single delivery as constraints, and an emergency logistics vehicle routing problem optimization model for major epidemics was constructed. The convergence speed improvement strategy, particle search improvement strategy, and elite retention improvement strategy were introduced to improve the particle swarm optimization (PSO) algorithm for it to be suitable for solving global optimization problems. The simulation results prove that the improved PSO algorithm required to solve the emergency medical supplies logistics vehicle routing problem for the major emergency can reach optimal results. Compared with the basic PSO algorithm, the total cost was reduced by 20.09%. [ABSTRACT FROM AUTHOR]

The artificial Gorilla Troop Optimization (GTO) algorithm (GTO) is a metaheuristic optimization algorithm that simulates the social life of gorillas. This paper proposes three innovative strategies considering the GTO algorithm's insufficient convergence accuracy and low convergence speed. First, a shrinkage control factor fusion strategy is proposed to expand the search space and reduce search blindness by strengthening the communication between silverback gorillas and other gorillas to improve global optimization performance. Second, a sine cosine interaction fusion strategy based on closeness is proposed to stabilize the performance of silverback gorillas and other gorilla individuals and improve the convergence ability and speed of the algorithm. Finally, a gorilla individual difference identification strategy is proposed to reduce the difference between gorilla and silverback gorillas to improve the quality of the optimal solution. In order to verify the optimization effect of the modified artificial gorilla troop optimization (MGTO) algorithm, we used 23 classic benchmark functions, 30 CEC2014 benchmark functions, and 10 CEC2020 benchmark functions to test the performance of the proposed MGTO algorithm. In this study, we used a total of 63 functions for algorithm comparison. At the same time, we carried out the exploitation and exploration balance experiment of 30 CEC2014 and 10 CEC2020 functions for the MGTO algorithm. In addition, the MGTO algorithm was also applied to test seven practical engineering problems, and it achieved good results. [ABSTRACT FROM AUTHOR]

Harris Hawks Optimization (HHO) simulates the cooperative hunting behavior of Harris hawks and it has the advantages of fewer control parameters, simple principles, and excellent exploitation ability. However, HHO also has the disadvantages of slow convergence and easy falling into local optimality. Aiming at the above shortcomings, this paper proposes a Multi-strategy Enhanced Harris Hawks Optimization (MEHHO). Firstly, the map-compass operator and Cauchy mutation strategy are used to increase the population diversity and improve the ability of the algorithm to jump out of the local optimal. Secondly, a spiral motion strategy is introduced to improve the exploration phase to enhance search efficiency. Finally, the convergence speed and accuracy of the algorithm are improved by greedy selection to fully retain the dominant individuals. The global search capability of the proposed MEHHO is verified by 28 benchmark test functions, and then the parameters of the deep learning network used for channel estimation are optimized by using the MEHHO to verify the practicability of the MEHHO. Experimental results show that the proposed MEHHO has more advantages in solving global optimization problems and improving the accuracy of the channel estimation method based on deep learning. [ABSTRACT FROM AUTHOR]

This paper proposes an improved method for solving diverse optimization problems called EGBO. The EGBO stands for the extended gradient-based optimizer, which improves the local search of the standard version of the gradient-based optimizer (GBO) using expanded and narrowed exploration behaviors. This improvement aims to increase the ability of the GBO to explore a wide area in the search domain for the giving problems. In this regard, the local escaping operator of the GBO is modified to apply the expanded and narrowed exploration behaviors. The effectiveness of the EGBO is evaluated using global optimization functions, namely CEC2019 and twelve benchmark feature selection datasets. The results are analyzed and compared to a set of well-known optimization methods using six performance measures, such as the fitness function's average, minimum, maximum, and standard deviations, and the computation time. The EGBO shows promising results in terms of performance measures, solving global optimization problems, recording highlight accuracies when selecting significant features, and outperforming the compared methods and the standard version of the GBO. [ABSTRACT FROM AUTHOR]

Identifying parameters in photovoltaic (PV) cell and module models is one of the primary challenges of the simulation and design of photovoltaic systems. Metaheuristic algorithms can find near-optimal solutions within a reasonable time for such challenging real-world optimization problems. Control parameters must be adjusted with many existing algorithms, making them difficult to use. In real-world problems, many of these algorithms must be combined or hybridized, which results in more complex and time-consuming algorithms. This paper presents a new artificial parameter-less optimization algorithm (APLO) for parameter estimation of PV models. New mutation operators are designed in the proposed algorithm. APLO's exploitation phase is enhanced by each individual searching for the best solution in this updating operator. Moreover, the current best, the old best, and the individual's current position are utilized in the differential term of the mutation operator to assist the exploration phase and control the convergence speed. The algorithm uses a random step length based on a normal distribution to ensure population diversity. We present the results of a comparative study using APLO and well-known existing parameter-less meta-heuristic algorithms such as grey wolf optimization, the salp swarm algorithm, JAYA, teaching-learning based optimization, colliding body optimization, as well as three major parameter-based algorithms such as differential evolution, genetic algorithm, and particle swarm optimization to estimate the parameters of PV the modules. The results revealed that the proposed algorithm could provide excellent exploration–exploitation balance and consistency during the iterations. Furthermore, the APLO algorithm shows high reliability and accuracy in identifying the parameters of PV cell models. [ABSTRACT FROM AUTHOR]

The spherical search algorithm is an effective optimizer to solve bound-constrained non-linear global optimization problems. Nevertheless, it may fall into the local optima when handling combination optimization problems. This paper proposes an enhanced self-adapting spherical search algorithm with differential evolution (SSDE), which is characterized by an opposition-based learning strategy, a staged search mechanism, a non-linear self-adapting parameter, and a mutation-crossover approach. To demonstrate the outstanding performance of the SSDE, eight optimizers on the CEC2017 benchmark problems are compared. In addition, two practical constrained engineering problems (the welded beam design problem and the pressure vessel design problem) are solved by the SSDE. Experimental results show that the proposed algorithm is highly competitive compared with state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

An efficient optimization method is needed to address complicated problems and find optimal solutions. The gazelle optimization algorithm (GOA) is a global stochastic optimizer that is straightforward to comprehend and has powerful search capabilities. Nevertheless, the GOA is unsuitable for addressing multimodal, hybrid functions, and data mining problems. Therefore, the current paper proposes the orthogonal learning (OL) method with Rosenbrock's direct rotation strategy to improve the GOA and sustain the solution variety (IGOA). We performed comprehensive experiments based on various functions, including 23 classical and IEEE CEC2017 problems. Moreover, eight data clustering problems taken from the UCI repository were tested to verify the proposed method's performance further. The IGOA was compared with several other proposed meta-heuristic algorithms. Moreover, the Wilcoxon signed-rank test further assessed the experimental results to conduct more systematic data analyses. The IGOA surpassed other comparative optimizers in terms of convergence speed and precision. The empirical results show that the proposed IGOA achieved better outcomes than the basic GOA and other state-of-the-art methods and performed better in terms of solution quality. [ABSTRACT FROM AUTHOR]

Feature selection (FS) is applied to reduce data dimensions while retaining much information. Many optimization methods have been applied to enhance the efficiency of FS algorithms. These approaches reduce the processing time and improve the accuracy of the learning models. In this paper, a developed method called MPAO based on the marine predators algorithm (MPA) and the "narrowed exploration" strategy of the Aquila optimizer (AO) is proposed to handle FS, global optimization, and engineering problems. This modification enhances the exploration behavior of the MPA to update and explore the search space. Therefore, the narrowed exploration of the AO increases the searchability of the MPA, thereby improving its ability to obtain optimal or near-optimal results, which effectively helps the original MPA overcome the local optima issues in the problem domain. The performance of the proposed MPAO method is evaluated on solving FS and global optimization problems using some evaluation criteria, including the maximum value (Max), minimum value (Min), and standard deviation (Std) of the fitness function. Furthermore, the results are compared to some meta-heuristic methods over four engineering problems. Experimental results confirm the efficiency of the proposed MPAO method in solving FS, global optimization, and engineering problems. [ABSTRACT FROM AUTHOR]

This paper addresses a problem of global optimization in a non-Archimedean fuzzy metric space context without fuzzy P-property. Specifically, it concerns the determination of the fuzzy distance between two subsets of a non-Archimedean fuzzy metric space. Our approach to solving this problem is to find an optimal approximate solution to a fixed point equation. This approach has been well studied within a category of problems called proximity point problems. We explore some new types of (ψ − ϕ) -weak proximal contractions and investigate the existence of the unique best proximity point for such kinds of mappings. Subsequently, some fixed point results for corresponding contractions are proved, and some illustrative examples are presented to support the validity of the main results. Moreover, an interesting application in computer science, particularly in the domain of words has been provided. Our work is a fuzzy generalization of the proximity point problem by means of fuzzy fixed point method. [ABSTRACT FROM AUTHOR]

This paper contains two main parts, Part I and Part II, which discuss the local and global minimization problems, respectively. In Part I, a fresh conjugate gradient (CG) technique is suggested and then combined with a line-search technique to obtain a globally convergent algorithm. The finite difference approximations approach is used to compute the approximate values of the first derivative of the function f. The convergence analysis of the suggested method is established. The comparisons between the performance of the new CG method and the performance of four other CG methods demonstrate that the proposed CG method is promising and competitive for finding a local optimum point. In Part II, three formulas are designed by which a group of solutions are generated. This set of random formulas is hybridized with the globally convergent CG algorithm to obtain a hybrid stochastic conjugate gradient algorithm denoted by HSSZH. The HSSZH algorithm finds the approximate value of the global solution of a global optimization problem. Five combined stochastic conjugate gradient algorithms are constructed. The performance profiles are used to assess and compare the rendition of the family of hybrid stochastic conjugate gradient algorithms. The comparison results between our proposed HSSZH algorithm and four other hybrid stochastic conjugate gradient techniques demonstrate that the suggested HSSZH method is competitive with, and in all cases superior to, the four algorithms in terms of the efficiency, reliability and effectiveness to find the approximate solution of the global optimization problem that contains a non-convex function. [ABSTRACT FROM AUTHOR]

The current journal paper proposes an end-to-end analysis for the numerical implementation of a two-degrees-of-freedom (2DOF) control structure, starting from the sampling rate selection mechanism via a quasi-optimal manner, along with the estimation of the worst-case execution time (WCET) for the specified controller. For the sampling rate selection, the classical Shannon–Nyquist sampling theorem is replaced by an optimization problem that encompasses the trade-off between the fidelity of the controllers' representation, along with the fidelity of the resulting closed-loop systems, and the implementation difficulty of the controllers. Additionally, the WCET analysis can be seen as a verification step before automatic code generation, a computational model being provided. The proposed computational model encompasses infinite-impulse response (IIR) and finite-impulse response (FIR) filter models for the controller implementation, along with additional relevant phenomena being discussed, such as saturation, signal scaling and anti-windup techniques. All proposed results will be illustrated on a DC motor benchmark control problem. [ABSTRACT FROM AUTHOR]

In this paper, a new deterministic method is proposed. This method depends on presenting (suggesting) some modifications to existing parameters of some conjugate gradient methods. The parameters of our suggested method contain a mix of deterministic and stochastic parameters. The proposed method is added to a line search algorithm to make it a globally convergent method. The convergence analysis of the method is established. The gradient vector is estimated by a finite difference approximation approach, and a new step-size h of this approach is generated randomly. In addition, a set of stochastic parameter formulas is constructed from which some solutions are generated randomly for an unconstrained problem. This stochastic technique is hybridized with the new deterministic method to obtain a new hybrid algorithm that finds an approximate solution for the global minimization problem. The performance of the suggested hybrid algorithm is tested in two sets of benchmark optimization test problems containing convex and non-convex functions. Comprehensive comparisons versus four other hybrid algorithms are listed in this study. The performance profiles are utilized to evaluate and compare the performance of the five hybrid algorithms. The numerical results show that our proposed hybrid algorithm is promising and competitive for finding the global optimum point. The comparison results between the performance of our suggested hybrid algorithm and the other four hybrid algorithms indicate that the proposed algorithm is competitive with, and in all cases superior to, the four algorithms in terms of the efficiency, reliability, and effectiveness for finding the global minimizers of non-convex functions. [ABSTRACT FROM AUTHOR]

Deep learning has been widely used in different fields such as computer vision and speech processing. The performance of deep learning algorithms is greatly affected by their hyperparameters. For complex machine learning models such as deep neural networks, it is difficult to determine their hyperparameters. In addition, existing hyperparameter optimization algorithms easily converge to a local optimal solution. This paper proposes a method for hyperparameter optimization that combines the Sparrow Search Algorithm and Particle Swarm Optimization, called the Hybrid Sparrow Search Algorithm. This method takes advantages of avoiding the local optimal solution in the Sparrow Search Algorithm and the search efficiency of Particle Swarm Optimization to achieve global optimization. Experiments verified the proposed algorithm in simple and complex networks. The results show that the Hybrid Sparrow Search Algorithm has the strong global search capability to avoid local optimal solutions and satisfactory search efficiency in both low and high-dimensional spaces. The proposed method provides a new solution for hyperparameter optimization problems in deep learning models. [ABSTRACT FROM AUTHOR]

Ground surface roughness is difficult to predict through a physical model due to its complex influencing factors. BP neural networks (BPNNs), a promising method, have been widely applied in the prediction of surface roughness. This paper uses the concept of BPNN to predict ground surface roughness considering the state of the grinding wheel. However, as the number of input parameters increases, the local optimum solution of the model that arises is more serious. Therefore, "identify factors" are designed to judge the iterative state of the model, whilst "memory factors" are designed to store the best weights during network training. The iterative termination conditions of the model are improved, and the learning rate and update rules of the weights are adjusted to avoid the local optimal solution. The results show that the prediction accuracy of the presented model is higher and more stable than the traditional model. Under three types of iteration steps, the average prediction accuracy is improved from 0.071, 0.065, 0.066 to 0.049, 0.042, 0.039 and the standard deviation of prediction decreased from 0.0017, 0.0166, 0.0175 to 0.0017, 0.0070, 0.0076, respectively. Therefore, the proposed method provides guidance for improving the global optimization ability of BPNNs and developing more accurate models for predicting surface roughness. [ABSTRACT FROM AUTHOR]

The paper considers the slope flow simulation and the problem of finding the optimal parameter values of this mathematical model. The slope flow is modeled using the finite volume method applied to the Reynolds-averaged Navier–Stokes equations with closure in the form of the k − ω S S T turbulence model. The optimal values of the turbulence model coefficients for free surface gravity multiphase flows were found using the global search algorithm. Calibration was performed to increase the similarity of the experimental and calculated velocity profiles. The Root Mean Square Error (RMSE) of derivation between the calculated flow velocity profile and the experimental one is considered as the objective function in the optimization problem. The calibration of the turbulence model coefficients for calculating the free surface flows on test slopes using the multiphase model for interphase tracking has not been performed previously. To solve the multi-extremal optimization problem arising from the search for the minimum of the loss function for the flow velocity profile, we apply a new optimization approach using a Peano curve to reduce the dimensionality of the problem. To speed up the optimization procedure, the objective function was approximated using an artificial neural network. Thus, an interdisciplinary approach was applied which allowed the optimal values of six turbulence model parameters to be found using OpenFOAM and Globalizer software. [ABSTRACT FROM AUTHOR]

This paper proposes a multi-objective teaching–learning studying-based algorithm (MTLSBA) to handle different objective frameworks for solving the large-scale Combined Heat and Power Economic Environmental Dispatch (CHPEED) problem. It aims at minimizing the fuel costs and emissions by managing the power-only, CHP and heat-only units. TLSBA is a modified version of TLBA to increase its global optimization performance by merging a new studying strategy. Based on this integrated tactic, every participant gathers knowledge from someone else randomly to improve his position. The position is specified as the vector of the design variables, which are the power and heat outputs from the power-only, CHP and heat-only units. TLSBA has been upgraded to include an extra Pareto archiving to capture and sustain the non-dominated responses. The objective characteristic is dynamically adapted by systematically modifying the shape of the applicable objective model. Likewise, a decision-making approach based on the fuzzy concept is used to select the most suitable CHPEED solution for large-scale dispatching of combined electrical power and heat energies. The proposed MTLSBA is assigned to multiple testing of 5-unit, 7-unit and 96-unit systems. It is contrasted with other reported techniques in the literature. According to numerical data, the suggested MTLSBA outperforms the others in terms of effectiveness and robustness indices. For the 5-unit system, the proposed MTLSBA achieves improvement in the fuel costs of 0.6625% and 0.3677% and reduction in the emissions of 2.723% and 7.4669% compared to non-dominated sorting genetic algorithm (NSGA-II) and strength Pareto evolutionary algorithm (SPEA 2), respectively. For the 7-unit system, the proposed MTLSBA achieves improvement in the fuel costs of 2.927% and 3.041% and reduction in the emissions of 40.156% and 40.050% compared to NSGA-II and SPEA 2, respectively. [ABSTRACT FROM AUTHOR]

Many of the applied algorithms that have been developed for solving a system of logical equations or the Boolean satisfiability problem have solved the problem in the Boolean domain. However, other approaches have recently been developed and improved. One of these developments is the transformation of a system of logical equations to a real continuous domain. The essence of this development is that a system of logical equations is transformed into a system in a real domain and the solution is sought in a real continuous domain. A real continuous domain is a richer domain, as it involves many well-developed algorithms. In this paper, we have constructively transformed the solution of any system of logical equations with a unique solution into an optimization problem for a polylinear target function in a unit n -dimensional cube K n . The resulting polylinear target function in K n does not have a local minimum. We proved that only once by calculating the gradient of the polylinear target function at any interior point of the K n cube, we can determine the solution to the system of logical equations. [ABSTRACT FROM AUTHOR]