Search Results (28)

As power grids scale and aging assets edge toward obsolescence, grounding grid corrosion has become a critical vulnerability. Conventional diagnosis must fit high-dimensional electrical data to a physical model, typically yielding a nonlinear under-determined system fraught with computational burden and uncertainty. We propose the Enhanced Biomimetic Hippopotamus Optimization (EBOHO) algorithm, which distills the river-dwelling hippo’s ecological wisdom into three synergistic strategies: a beta-function herd seeding that replicates the genetic diversity of juvenile hippos diffusing through wetlands, an elite–mean cooperative foraging rule that echoes the way dominant bulls steer the herd toward nutrient-rich pastures, and a lens imaging opposition maneuver inspired by moonlit water reflections that spawn mirror candidates to avert premature convergence. Benchmarks on the CEC 2017 suite and four classical design problems show EBOHO’s superior global search, robustness, and convergence speed over numerous state-of-the-art meta-heuristics, including prior hippo variants. An industrial case study on grounding grid corrosion further confirms that EBOHO swiftly resolves the under-determined equations and pinpoints corrosion sites with high precision, underscoring its promise as a nature-inspired diagnostic engine for aging power system infrastructure. Full article

The traditional particle swarm optimization (PSO) algorithm often exhibits defects such as of slow convergence and easily falling into a local optimum. To overcome these problems, this paper proposes an enhanced variant featuring adaptive selection. Initially, a composite chaotic mapping model integrating Logistic and Sine mappings is employed to initialize the population for diversity and exploration capability. Subsequently, the global and local search capabilities of the algorithm are balanced through the introduction of adaptive inertia weights. The population is then divided into three subpopulations—elite, ordinary, and inferior particles—based on their fitness values, with each group employing a distinct position update strategy. Finally, a particle mutation strategy is incorporated to avoid convergence to local optima. Experimental results demonstrate that our algorithm outperforms existing algorithms on the standard benchmark functions. In practical engineering applications, our algorithm also has demonstrated better performance than other meta heuristic algorithms. Full article

Recommendation systems (RSs) play a vital role in e-commerce and content platforms, yet balancing efficiency and recommendation quality remains challenging. Traditional deep models are computationally expensive, while heuristic methods like particle swarm optimization struggle with discrete optimization. To address these limitations, this paper proposes elite-evolution-based discrete particle swarm optimization (EEDPSO), a novel framework specifically designed to optimize high-dimensional combinatorial recommendation tasks. EEDPSO restructures the velocity and position update mechanisms to operate effectively in discrete spaces, integrating neighborhood search, elite evolution strategies, and roulette-wheel selection to balance exploration and exploitation. Experiments on the MovieLens and Amazon datasets show that EEDPSO outperforms five metaheuristic algorithms (GA, DE, SA, SCA, and PSO) in both recommendation quality and computational efficiency. For datasets below the million-level scale, EEDPSO also demonstrates superior performance compared to deep learning models like FairGo. The results establish EEDPSO as a robust optimization strategy for recommendation systems that effectively handles the cold-start problem. Full article

Due to increasing energy consumption, green scheduling in the manufacturing industry has attracted great attention. In distributed manufacturing involving heterogeneous plants, accounting for complex work sequences and energy consumption poses a major challenge. To address distributed heterogeneous green hybrid flowshop scheduling (DHGHFSP) while optimising total weighted delay (TWD) and total energy consumption (TEC), a deep reinforcement learning-based evolutionary algorithm (DRLBEA) is proposed in this article. In the DRLBEA, a problem-based hybrid heuristic initialization with random-sized population is designed to generate a desirable initial solution. A bi-population evolutionary algorithm with global search and local search is used to obtain the elite archive. Moreover, a distributional Deep Q-Network (DQN) is trained to select the best local search strategy. Experimental results on 20 instances show a 9.8% increase in HV mean value and a 35.6% increase in IGD mean value over the state-of-the-art method. The results show the effectiveness and efficiency of the DRLBEA in solving DHGHFSP. Full article

In practical applications of droplet actuation using digital microfluidic (DMF) systems based on electrowetting-on-dielectric (EWOD), various electrode failures can still arise due to diverse operational conditions. To improve droplet transport efficiency, this study proposes a heuristic-elite genetic algorithm (HEGA) for droplet path planning. We introduce a heuristic method and a bidirectional elite fragment recombination method to address the challenge of poor initialization quality in genetic algorithms, particularly in complex environments. These approaches aim to enhance the global search capability and accelerate the algorithm’s convergence. Simulations were performed using MATLAB, and the results indicate that compared to the basic ant colony algorithm, the proposed method reduces the average number of turning points by approximately 17.23% and the average search time by about 92.60%. In multi-droplet transport applications, the algorithm generates optimal paths for test droplets while maintaining fast convergence. Additionally, it effectively prevents droplets from accidentally contacting or merging in non-synthesis areas, ensuring improved testing outcomes for the chip. Full article

The snow ablation optimizer (SAO) is a meta-heuristic technique used to seek the best solution for sophisticated problems. In response to the defects in the SAO algorithm, which has poor search efficiency and is prone to getting trapped in local optima, this article suggests a multi-strategy improved (MISAO) snow ablation optimizer. It is employed in the unmanned aerial vehicle (UAV) path planning issue. To begin with, the tent chaos and elite reverse learning initialization strategies are merged to extend the diversity of the population; secondly, a greedy selection method is deployed to retain superior alternative solutions for the upcoming iteration; then, the Harris hawk (HHO) strategy is introduced to enhance the exploitation capability, which prevents trapping in partial ideals; finally, the red-tailed hawk (RTH) is adopted to perform the global exploration, which, enhances global optimization capability. To comprehensively evaluate MISAO’s optimization capability, a battery of digital optimization investigations is executed using 23 test functions, and the results of the comparative analysis show that the suggested algorithm has high solving accuracy and convergence velocity. Finally, the effectiveness and feasibility of the optimization path of the MISAO algorithm are demonstrated in the UAV path planning project. Full article

The expansion of Internet of Things (IoT) technology and the rapid increase in data in smart grid business scenarios have led to a need for more dynamic and adaptive security strategies. Traditional static security measures struggle to meet the evolving low-voltage security requirements of state grid systems under this new IoT-driven environment. By incorporating symmetry in metaheuristic algorithms, we can further improve performance and robustness. Symmetrical properties have the potential to lead to more efficient and balanced solutions, improving the overall stability of the grid. We propose a gnn-enhanced ant colony optimization method for orchestrating grid security strategies, which trains across combinatorial optimization problems (COPs) that are representative scenarios in the state grid business scenarios, to learn specific mappings from instances to their heuristic measures. The learned heuristic metrics are embedded into the ant colony optimization (ACO) to generate the optimal security policy adapted to the current security situation. Compared to the ACO and adaptive elite ACO, our method reduces the average time consumption of finding a path within a limited time in the capacitated vehicle routing problem by 67.09% and 66.98%, respectively. Additionally, ablation experiments verify the effectiveness and necessity of the individual functional modules. Full article

Extreme learning machines (ELMs), single hidden-layer feedforward neural networks, are renowned for their speed and efficiency in classification and regression tasks. However, their generalization ability is often undermined by the random generation of hidden layer weights and biases. To address this issue, this paper introduces a Hierarchical Learning-based Chaotic Crayfish Optimization Algorithm (HLCCOA) aimed at enhancing the generalization ability of ELMs. Initially, to resolve the problems of slow search speed and premature convergence typical of traditional crayfish optimization algorithms (COAs), the HLCCOA utilizes chaotic sequences for population position initialization. The ergodicity of chaos is leveraged to boost population diversity, laying the groundwork for effective global search efforts. Additionally, a hierarchical learning mechanism encourages under-performing individuals to engage in extensive cross-layer learning for enhanced global exploration, while top performers directly learn from elite individuals at the highest layer to improve their local exploitation abilities. Rigorous testing with CEC2019 and CEC2022 suites shows the HLCCOA’s superiority over both the original COA and nine renowned heuristic algorithms. Ultimately, the HLCCOA-optimized extreme learning machine model, the HLCCOA-ELM, exhibits superior performance over reported benchmark models in terms of accuracy, sensitivity, and specificity for UCI breast cancer diagnosis, underscoring the HLCCOA’s practicality and robustness, as well as the HLCCOA-ELM’s commendable generalization performance. Full article

This paper introduces the election optimization algorithm (EOA), a meta-heuristic approach for engineering optimization problems. Inspired by the democratic electoral system, focusing on the presidential election, EOA emulates the complete election process to optimize solutions. By simulating the presidential election, EOA introduces a novel position-tracking strategy that expands the scope of effectively solvable problems, surpassing conventional human-based algorithms, specifically, the political optimizer. EOA incorporates explicit behaviors observed during elections, including the party nomination and presidential election. During the party nomination, the search space is broadened to avoid local optima by integrating diverse strategies and suggestions from within the party. In the presidential election, adequate population diversity is maintained in later stages through further campaigning between elite candidates elected within the party. To establish a benchmark for comparison, EOA is rigorously assessed against several renowned and widely recognized algorithms in the field of optimization. EOA demonstrates superior performance in terms of average values and standard deviations across the twenty-three standard test functions and CEC2019. Through rigorous statistical analysis using the Wilcoxon rank-sum test at a significance level of 0.05, experimental results indicate that EOA consistently delivers high-quality solutions compared to the other benchmark algorithms. Moreover, the practical applicability of EOA is assessed by solving six complex engineering design problems, demonstrating its effectiveness in real-world scenarios. Full article

Optimization is a process of minimizing or maximizing a given objective function under specified constraints. In multi-objective optimization (MOO), multiple conflicting functions are optimized within defined criteria. Numerous MOO techniques have been developed utilizing various meta-heuristic methods such as Evolutionary Algorithms (EAs), Genetic Algorithms (GAs), and other biologically inspired processes. In a cooperative environment, a Pareto front is generated, and an MOO technique is applied to solve for the solution set. On other hand, Multi-Criteria Decision Making (MCDM) is often used to select a single best solution from a set of provided solution candidates. The Multi-Criteria Decision Making–Pareto Front (M-PF) optimizer combines both of these techniques to find a quality set of heuristic solutions. This paper provides an improved version of the M-PF optimizer, which is called the elite Multi-Criteria Decision Making–Pareto Front (eMPF) optimizer. The eMPF method uses an evolutionary algorithm for the meta-heuristic process and then generates a Pareto front and applies MCDM to the Pareto front to rank the solutions in the set. The main objective of the new optimizer is to exploit the Pareto front while also exploring the solution area. The performance of the developed method is tested against M-PF, Non-Dominated Sorting Genetic Algorithm-II (NSGA-II), and Non-Dominated Sorting Genetic Algorithm-III (NSGA-III). The test results demonstrate the performance of the new eMPF optimizer over M-PF, NSGA-II, and NSGA-III. eMPF was not only able to exploit the search domain but also was able to find better heuristic solutions for most of the test functions used. Full article

Aiming to resolve the problems of slow convergence speed and inability to plan in real time when ant colony optimization (ACO) performs global path planning, we propose a path-planning method that improves adaptive ant colony optimization (IAACO) with the dynamic window approach (DWA). Firstly, the heuristic information function is modified, and the adaptive adjustment factor is added to speed up the algorithm’s convergence rate; secondly, elite ants and max–min ants systems are implemented to enhance the global pheromone updating process, and an adaptive pheromone volatilization factor is aimed at preventing the algorithm from enhancing its global search capabilities; then, the path optimization and withdrawal mechanism is utilized to enable smoother functioning and to avoid the deadlocks; finally, a new distance function is introduced in the evaluation function of DWA to the enhance real-time obstacle-avoidance ability. The simulation experiment results reveal that the path length of the IAACO can be shortened by 10.1% and 13.7% in contrast to the ACO. The iteration count can be decreased by 63.3% and 63.0%, respectively, leading to an enhanced optimization performance in global path planning and achieving dynamic real-time obstacle avoidance for local path planning. Full article

Photovoltaic (PV) systems are crucial for converting solar energy into electricity. Optimization, control, and simulation for PV systems are important for effectively harnessing solar energy. The exactitude of associated model parameters is an important influencing factor in the performance of PV systems. However, PV model parameter extraction is challenging due to parameter variability resulting from the change in different environmental conditions and equipment factors. Existing parameter identification approaches usually struggle to calculate precise solutions. For this reason, this paper presents an improved differential evolution algorithm, which integrates a collaboration mechanism of dual mutation strategies and an orientation guidance mechanism, called DODE. This collaboration mechanism adaptively assigns mutation strategies to different individuals at different stages to balance exploration and exploitation capabilities. Moreover, an orientation guidance mechanism is proposed to use the information of the movement direction of the population centroid to guide the evolution of elite individuals, preventing them from being trapped in local optima and guiding the population towards a local search. To assess the effectiveness of DODE, comparison experiments were conducted on six different PV models, i.e., the single, double, and triple diode models, and three other commercial PV modules, against ten other excellent meta-heuristic algorithms. For these models, the proposed DODE outperformed other algorithms, with the separate optimal root mean square error values of 9.86021877891317 × 10⁻⁴, 9.82484851784979 × 10⁻⁴, 9.82484851784993 × 10⁻⁴, 2.42507486809489 × 10⁻³, 1.72981370994064 × 10⁻³, and 1.66006031250846 × 10⁻². Additionally, results obtained from statistical analysis confirm the remarkable competitive superiorities of DODE on convergence rate, stability, and reliability compared with other methods for PV model parameter identification. Full article

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. Full article

The rapid growth in greenhouse gases (GHGs), the lack of electricity production, and an ever-increasing demand for electrical energy requires an optimal reduction in coal-fired thermal generating units (CFTGU) with the aim of minimizing fuel costs and emissions. Previous approaches have been unable to deal with such problems due to the non-convexity of realistic scenarios and confined optimum convergence. Instead, meta-heuristic techniques have gained more attention in order to deal with such constrained static/dynamic economic emission load dispatch (ELD/DEELD) problems, due to their flexibility and derivative-free structures. Hence, in this work, the elephant herd optimization (EHO) technique is proposed in order to solve constrained non-convex static and dynamic ELD problems in the power system. The proposed EHO algorithm is a nature-inspired technique that utilizes a new separation method and elitism strategy in order to retain the diversity of the population and to ensure that the fittest individuals are retained in the next generation. The current approach can be implemented to minimize both the fuel and emission cost functions of the CFTGUs subject to power balance constraints, active power generation limits, and ramp rate limits in the system. Three test systems involving 6, 10, and 40 units were utilized to demonstrate the effectiveness and practical feasibility of the proposed algorithm. Numerical results indicate that the proposed EHO algorithm exhibits better performance in most of the test cases as compared to recent existing algorithms when applied to the static and dynamic ELD issue, demonstrating its superiority and practicability. Full article

Water conservancy project scheduling is an extension to the classic resource-constrained project scheduling problem (RCPSP). It is limited by special time constraints called “forbidden time windows” during which certain activities cannot be executed. To address this issue, a specific RCPSP model is proposed, and an approach is designated for it which incorporates both a priority rule-based heuristic algorithm to obtain an acceptable solution, and a hybrid genetic algorithm to further improve the quality of the solution. In the genetic algorithm, we introduce a new crossover operator for the forbidden time window and adopt double justification and elitism strategies. Finally, we conduct simulated experiments on a project scheduling problem library to compare the proposed algorithm with other priority-rule based heuristics, and the results demonstrate the superiority of our algorithm. Full article