Search

Solving nonlinear equation systems (NESs) is one of the most important tasks in numerical computing. The NESs usually have multiple roots, and quickly locating their roots in a single algorithm run with a limited number of iterations has always been the algorithm improvement direction. In order to further enhance the efficiency of the existing methods, a density clustering-based differential evolution algorithm (DCDE) for the NESs problem solving is proposed in this paper. Firstly, density-based spatial clustering of applications with noise (DBSCAN) is used to divide the population into clusters and noises, which provides a better direction for population evolution. Secondly, a cluster evaluation factor is proposed, which not only divides the clusters into excellent clusters and non-excellent clusters, but also prevents the migration of excellent clusters and maintain the diversity of populations. Then, a migration strategy and individual generation mechanism are proposed to guide non-excellent clusters to migrate to promising regions. Finally, combined with an archive technique, the individuals which satisfy the solution requirements are archived and randomly initialized to further improve population diversity. To verify the effectiveness of the proposed algorithm, comparative experimental results of the propsoed DCDE with other state-of-the-art algorithms for thirty NESs problems solving show that the proposed DCDE is the most effective algorithm to locate more roots in a single run. [ABSTRACT FROM AUTHOR]

• An improved gaining-sharing knowledge-based algorithm named MSGSK is proposed. • A parameter adjustment strategy is developed to adjust relative parameters of MSGSK. • A backtracking differential mutation strategy is designed to enrich the population diversity. • A strategy selection mechanism is presented to integrate the former two strategies. • MSGSK extracts more accurate parameters for five PV models. The determination of photovoltaic (PV) model parameters has essential theoretical and practical significance for the performance evaluation, power monitoring, and power generation efficiency calculation of PV systems. In this paper, a multi-strategy gaining-sharing knowledge-based algorithm (MSGSK) is developed to determine these parameters. In our previous work, it has been demonstrated that gaining-sharing knowledge-based algorithm (GSK) is well suited for solving the concerned problem. To enhance its performance, a parameter adjustment strategy is developed to adjust the knowledge rate and knowledge ratio of GSK. Besides, a backtracking differential mutation strategy by combining the mutation scheme of differential evolution and the updating scheme of backtracking search optimization algorithm is developed to enrich the population diversity. Furthermore, a strategy selection mechanism is introduced to integrate the former two strategies to balance exploration and exploitation in different stages of the evolutionary process. The suggested MSGSK algorithm is applied to five PV cases (SDM, DDM, Photowatt-PW201, STM6-40/36, and STP6-120/36). From the experimental data, it can be observed that MSGSK extracts the PV model parameters more precisely than the basic GSK. Furthermore, it exhibits faster convergence speed and higher accuracy compared to other advanced algorithms found in the literature. [ABSTRACT FROM AUTHOR]

In this paper, a new differential evolution (DE) algorithm is presented for solving global optimization problems by guiding the individuals adaptively to explore different decision regions and setting the control parameters properly for individuals. To consolidate algorithm efficiency and preserve population diversity, we first introduce a proration-based mutation strategy. This strategy dynamically selects promising individuals from population as guiders and proportionately allocates the individuals following them based on their fitness values and unsuccessful updates. Besides, we design a multi-segment mixed parameter setting to provide suitable parameters for individuals, considering feedback information from the population, individual requirements, and parameters' interaction. Additionally, we devise an adaptive population maintaining mechanism to refresh the population by replacing individuals with higher unsuccessful updates and removing those with poor fitness values. Unlike previous DE versions, our new algorithm dynamically and appropriately explores promising areas, refines parameter suitability, and accelerates convergence by updating and removing unpromising individuals. This enhances the algorithm search efficiency and achieves a good balance between exploration and exploitation. Finally, we evaluate the proposed algorithm's performance by comparing it with 17 typical or state-of-the-art algorithms on IEEE CEC2014 and CEC2017 test suites. Experimental results indicate that the proposed algorithm is a more promising optimizer. [ABSTRACT FROM AUTHOR]

Filter pruning has been successfully applied in convolutional neural networks (CNN) to reduce model redundancy and speed up inference. Current pruning algorithms require setting a target value for a pruned model, which is not conducive to the rapid implementation in practical application. Firstly, for a target model, it may be necessary to pay attention to multiple performances at the same time, but it is hard to keep the best trade-off among indicators. Secondly, it is time-consuming to find a suitable model by pruning in a trial-and-error way. Therefore, this paper attempts to combine the most concerning indicators into a search target, rather than producing a model that only contains some pre-defined constraint. Specifically, the multi-object differential evolution algorithm is introduced into the search process, which is used to obtain a set of sparse structures that have taken all useful indicators into account. Then select proper sub-network to retrain from search results according to actual requirements. Experiments on multiple advanced CNN networks show that our algorithm can compress different indicators while keeping comparable or better performance than prior works. On ImageNet, pruning based on ResNet50 reduces FLOPs by 60.4%, while the accuracy of top-1 and top-5 only loses 1.09% and 0.57%, respectively. [ABSTRACT FROM AUTHOR]

Effective gas system scheduling is vital for ensuring the safe operation and energy efficiency of steel production. However, the dynamic and cyclical nature of gas generation and consumption leads to fluctuations in gas network pressure and gas holder levels. To address this issue, this paper proposes a novel strategy for gas system scheduling based on multi-objective differential evolution. The originality lies in fully considering the workload of operators, effectively reducing the workload while ensuring gas network stability. We analyze the composition of the gas system and design a scheduling scheme. Subsequently, a novel gas holder level model based on mechanism analysis is established, which calculates the gas holder level by analyzing the volume and pressure of the gas. Then, a gas system scheduling model with a new objective function based on a multi-objective differential evolution algorithm is provided. By comparing with the two recent methods, this method reduced the number of adjustments by 13.9% and 9.75%, respectively, effectively reducing the workload while ensuring gas system stability. Through statistical analysis for eight consecutive months, the results show that this method can reduce the gas emission rate from 1.34% to 0.88%, demonstrating its correctness and effectiveness. [ABSTRACT FROM AUTHOR]

In many comparison papers Evolutionary Algorithms are stopped after a pre-defined number of function calls, which is a code-independent measure of computational time. This number of function calls is either defined by the inventors of particular benchmark problems, or set subjectively by the user for the specific problem. The question how much improvement could be achieved by Evolutionary Algorithms if they were given much more time is surprisingly rarely asked. In the present study we analyze improvements obtained by thirty Evolutionary Algorithms on four different benchmark sets, including one composed of 22 real-world problems, when the allowed number of function calls is extended ten times with respect to the values defined in the comparison criteria for the specific benchmark sets. We analyze how the prolonged search would affect the ranking of algorithms, how much improvement could be obtained by Evolutionary Algorithms in general, on what kind of problems the improvement will be achieved, and which type of algorithms would benefit most from such an extended search. We show that the improvements obtained in prolonged search are higher for real-world problems than for mathematical functions, and such improvements are mainly achieved by similar kinds of adaptive algorithms proposed relatively recently. Many metaheuristics fail to benefit from the extended search on most benchmark problems, or benefit only marginally. [ABSTRACT FROM AUTHOR]