Search

Copyright of Baghdad Science Journal is the property of Republic of Iraq Ministry of Higher Education & Scientific Research (MOHESR) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In order to improve the autonomy and intelligence of group animation behavior, this paper proposes a particle swarm optimization algorithm for automatic control of group animation behavior. After the user inputs the group animation behavior construction target, the individual path is planned according to the fixed behavior rules, and the particle swarm optimization algorithm and the improved artificial fish swarm optimization algorithm are used to select the optimal action for the individual in the group animation according to the top-down control process. The experimental results show that after the PSO converges to the global optimal solution, the evolution times of the PSO converge to the global optimal solution again when the surrounding environment changes 10 times. The population diversity of particle swarm optimization algorithm is obviously better than those of the other two algorithms in the process of automatically controlling the movement of individuals to the circle and to the stand in the crowd animation. Compared with the original algorithm AFSA, the improved artificial fish swarm algorithm proposed in this paper is easier to obtain the global optimal value, and the optimization speed is also improved. In conclusion, the example analysis verifies that the algorithm can effectively realize the automatic control of group animation behavior and has high convergence speed and high autonomy. [ABSTRACT FROM AUTHOR]

The Marine Predators Algorithm (MPA) is a swarm intelligence algorithm developed based on the foraging behavior of the ocean's predators. This algorithm has drawbacks including, insufficient population diversity, leading to trapping in local optima and poor convergence. To mitigate these drawbacks, this paper introduces an enhanced MPA based on Adaptive Sampling with Maximin Distance Criterion (AM) and the horizontal and vertical crossover operators – i.e. Adaptive Crossover-based MPA (AC-MPA). The AM approach is used to generate diverse and well-distributed candidate solutions. Whereas the horizontal and vertical crossover operators maintain the population diversity during the search process. The performance of AC-MPA was tested using 51 benchmark functions from CEC2017, CEC2020, and CEC2022, with varying degrees of dimensionality, and the findings are compared with those of its basic version, variants, and numerous well-established metaheuristics. Additionally, 11 engineering optimization problems were utilized to verify the capabilities of the AC-MPA in handling real-world optimization problems. The findings clearly show that AC-MPA performs well in terms of its solution accuracy, convergence, and robustness. Furthermore, the proposed algorithm demonstrates considerable advantages in solving engineering problems, proving its effectiveness and adaptability. [ABSTRACT FROM AUTHOR]

The Tree-Seed Algorithm (TSA) has been effective in addressing a multitude of optimization issues. However, it has faced challenges with early convergence and difficulties in managing high-dimensional, intricate optimization problems. To tackle these shortcomings, this paper introduces a TSA variant (DTSA). DTSA incorporates a suite of methodological enhancements that significantly bolster TSA's capabilities. It introduces the PSO-inspired seed generation mechanism, which draws inspiration from Particle Swarm Optimization (PSO) to integrate velocity vectors, thereby enhancing the algorithm's ability to explore and exploit solution spaces. Moreover, DTSA's adaptive velocity adaptation mechanism based on count parameters employs a counter to dynamically adjust these velocity vectors, effectively curbing the risk of premature convergence and strategically reversing vectors to evade local optima. DTSA also integrates the trees population integrated evolutionary strategy, which leverages arithmetic crossover and natural selection to bolster population diversity, accelerate convergence, and improve solution accuracy. Through experimental validation on the IEEE CEC 2014 benchmark functions, DTSA has demonstrated its enhanced performance, outperforming recent TSA variants like STSA, EST-TSA, fb-TSA, and MTSA, as well as established benchmark algorithms such as GWO, PSO, BOA, GA, and RSA. In addition, the study analyzed the best value, mean, and standard deviation to demonstrate the algorithm's efficiency and stability in handling complex optimization issues, and DTSA's robustness and efficiency are proven through its successful application in five complex, constrained engineering scenarios, demonstrating its superiority over the traditional TSA by dynamically optimizing solutions and overcoming inherent limitations. [ABSTRACT FROM AUTHOR]

This paper proposes a novel multi-hybrid algorithm named DHPN, using the best-known properties of dwarf mongoose algorithm (DMA), honey badger algorithm (HBA), prairie dog optimizer (PDO), cuckoo search (CS), grey wolf optimizer (GWO) and naked mole rat algorithm (NMRA). It follows an iterative division for extensive exploration and incorporates major parametric enhancements for improved exploitation operation. To counter the local optima problems, a stagnation phase using CS and GWO is added. Six new inertia weight operators have been analyzed to adapt algorithmic parameters, and the best combination of these parameters has been found. An analysis of the suitability of DHPN towards population variations and higher dimensions has been performed. For performance evaluation, the CEC 2005 and CEC 2019 benchmark data sets have been used. A comparison has been performed with differential evolution with active archive (JADE), self-adaptive DE (SaDE), success history based DE (SHADE), LSHADE-SPACMA, extended GWO (GWO-E), jDE100, and others. The DHPN algorithm is also used to solve the image fusion problem for four fusion quality metrics, namely, edge-based similarity index ( Q A B / F ), sum of correlation difference (SCD), structural similarity index measure (SSIM), and artifact measure ( N A B / F ). The average Q A B / F = 0.765508 , S C D = 1.63185 , S S I M = 0.726317 , and N A B / F = 0.006617 shows the best combination of results obtained by DHPN with respect to the existing algorithms such as DCH, CBF, GTF, JSR and others. Experimental and statistical Wilcoxon's and Friedman's tests show that the proposed DHPN algorithm performs significantly better in comparison to the other algorithms under test. [ABSTRACT FROM AUTHOR]

Inspired by the migration and reproduction of species in nature to explore suitable habitats, this paper proposed a new swarm intelligence algorithm called the Migration and Reproduction Algorithm (MARA). This new algorithm discusses how to transform the behavior of an organism looking for a suitable habitat into a mathematical model, which can solve optimization problems. MARA has some common features with other optimization methods such as particle swarm optimization (PSO) and the fireworks algorithm (FWA), which means MARA can also solve the optimization problems that PSO and FWA are used to, namely, high-dimensional optimization problems. MARA also has some unique features among biology-based optimization methods. In this paper, we articulated the structure of MARA by correlating it with natural biogeography; then, we demonstrated the performance of MARA on sets of 12 benchmark functions. In the end, we applied it to optimize a practical problem of power dispatching in a multi-microgrid system that proved it has certain value in practical applications. [ABSTRACT FROM AUTHOR]

Chinese traditional culture is a typical "moral culture," and traditional morality is the core and essence of culture. However, in recent years, the phenomenon of following the trend of rural construction has been particularly serious, and many villages have lost their original features. To solve the above problems, the genetic algorithm can be used to further explore the traditional culture of urbanization construction. A genetic algorithm is a natural evolutionary process that imitates natural selection and genetic operation in nature to obtain optimal solution, in which genetic operation mainly includes the processes of gene replication, crossover, and mutation. This paper studies the traditional culture of urbanization construction based on the genetic algorithm under the concept of environmental protection. Among the accuracy of urban construction land expansion, in 2018, the accuracy of ant colony algorithm, data mining algorithm, and particle swarm optimization algorithm is 58%, 51.8%, and 56.7%, respectively. The accuracy of this genetic algorithm is as high as 58.8%. It can be seen that the genetic algorithm in this paper has the highest accuracy in the expansion of urban construction land. Therefore, in the process of large-scale urbanization based on the genetic algorithm, we should pay attention to not being separated from traditional culture, not letting farmers lose their regional culture, local culture, and grassroots culture, and protecting the cultural-ecological environment on which these cultures depend. [ABSTRACT FROM AUTHOR]

In existing meta-heuristic algorithms, population initialization forms a huge part towards problem optimization. These calculations can impact variety and combination to locate a productive ideal arrangement. Especially, for perceiving the significance of variety and intermingling, different specialists have attempted to improve the presentation of meta-heuristic algorithms. Particle Swarm Optimization (PSO) algorithm is a populace-based, shrewd stochastic inquiry strategy that is motivated by the inherent honey bee swarm food search mechanism. Population initialization is an indispensable factor in the PSO algorithm. To improve the variety and combination factors, rather than applying the irregular circulation for the introduction of the populace, semi-arbitrary successions are more helpful. This examination presents a thorough overview of the different PSO initialization approaches which are dependent on semi-arbitrary successions systems. In this precise review, the best in class in the populace instatement is uncovered. The procedures are classified by utilizing a theoretical model that parts the cycle of populace introduction into two phases: that is, right now expressly or certainly utilized for reinstatement in every single present approach. The deliberate investigation unveils the potential examination zones of populace introduction and, furthermore, research holes, despite the fact that the fundamental center is to give the headings to future upgrade and advancement around there. This paper gives a deliberate study identified with this calculated model for the cutting edge of exploration, which is talked about in the predefined writing to date. The study is envisioned to be useful in examining the PSO algorithm in detail for the specialist. Likewise, the paper finds the proficiency of numerous quasi-random sequences (QRS) based on initialization approaches by looking at their exhibition analyzed for sixteen notable benchmark test problems. [ABSTRACT FROM AUTHOR]

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

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

Copyright of Baghdad Science Journal is the property of Republic of Iraq Ministry of Higher Education & Scientific Research (MOHESR) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In the Internet of Things (IoT) ecosystem, localization is critical for tracking and monitoring targets via nodes. The distance vector-hop (DV-Hop) technique is a good choice for localizing neighborhood in IoT networks. The conventional DV-Hop algorithm is a distributed localization approach that does not consider the distribution of the nodes into full deliberation when calculating the hop count from the source to destined nodes. The transfer distance and node positions thus do not attain higher efficiency while ascertaining the distance between sources and destined nodes. The study aims to resolve the pitfalls in the traditional algorithm by making enhancements in controlling the original DV-Hop algorithm's hop count and transfer distance method by utilizing the particle swarm to estimate the node positions. Error rate in the distance between beacon nodes and unseen nodes is effectively reduced with the proposed technique that calculate error factors with corrections in a reversed fashion to revise hop counts. An escape factor is introduced to take control of updating particles' velocity in the system, and the inertia weight is defined by a piecewise function to enlarge search space. This mechanism increases the diversity of the particle populations and mitigates the tendency of estimations on node positions to be trapped into local optima under stationary state. Also, the improved DV-Hop algorithm described in the paper has a better convergence speed due to the presence of random inertia weight logarithmic method. Finally, the problem of premature convergence is also tackled as a variation factor is adopted in collaboration with a fitness function that affects the particles' movement range and assists in global convergence. The overall performance of improved DV-Hop is evaluated by statistical metrics and also compared with the traditional DV-Hop algorithm under simulated environment with the data collected from real-world scenarios. Industry 4.0 is fully dependent upon IoT and the count of hops is very important for deciding the routing from the source to destination for speedy transmission of data. The improved DV-hop algorithm can achieve better results and has reduced error rate by more than 30%. The DV-Hop algorithm plays an important role in IoT-enabled environment especially in Industry 4.0. [ABSTRACT FROM AUTHOR]

Sensor deployment is an important issue in wireless sensor network (WSN), which is a typical nonlinear system. Conditions of both area coverage and point coverage should be considered in research studies on sensor coverage. It is generally necessary to ensure high coverage ratio of area when controlling sensor locations, and covering specific point targets to ensure long lifetime is also important sometimes. In current studies, swarm intelligence algorithms such as particle swarm optimization (PSO) are widely used to solve the sensor deployment problem in WSN. In this paper, coverage rate and network life indicators are analyzed comprehensively with establishment of a more general K-coverage model. In related calculation examples with different coverage requirements including target coverage, area coverage, and boundary coverage, several improved algorithms based on PSO are applied to solve the problem in the paper. Simulation results show that the improved algorithms can achieve a good performance and deployment effect. [ABSTRACT FROM AUTHOR]

Based on the principle of particle swarm algorithm and support vector machine, this article aims to improve the classification performance of college English teaching effect and explores the best support vector machine parameter optimization algorithm to promote college English teaching for the theory and application research of data analysis. First, the advantages and disadvantages of common support vector machine parameter selection methods such as grid search algorithm, gradient descent method, and swarm intelligence algorithm are studied. Secondly, this article has a detailed analysis and comparison of various other algorithms. Finally, the study analyzed the advantages and disadvantages of the quantum particle swarm algorithm, introduced the dual-center idea into the quantum particle swarm algorithm, and proposed an improved quantum particle swarm algorithm. Through simulation experiments, it is proved that the improved quantum particle swarm algorithm is more superior in optimizing the parameters of support vector machine. In general, this paper uses the PSO algorithm to simultaneously solve the SVM feature selection and parameter optimization problems and has achieved good results. Within the scope of the literature that the author has, there is still a lack of work in this area. Compared with the existing algorithms, the algorithm proposed in this paper has stronger feature selection ability and higher efficiency. [ABSTRACT FROM AUTHOR]

For sophisticated applications, engineers should always consider multi-objective, multi-task or multi-modal problems, especially in the Internet of Things, such as the data fusion of multi-sensor systems, multiple routing problems for automation and convergence control in wireless sensor networks. Normally, utilizing traditional methods costs abundant resources and yields the homogeneous results that fails to satisfy requirements. For the multimodal situation, this paper proposes the dual-biological-community swarm intelligence algorithm based on particle swarm optimization (DBC–PSO), which is combined with the commensal evolution strategy to enhance the convergence ability. This algorithm can split tasks into two communities and guarantee regional changes in information and search accuracy for multimodal problems through a commensal strategy. Moreover, some typical parameters, including the population rate, velocity and radius influence, are considered to study the algorithm performance. The performance is evaluated on 12 well-known multimodal problems, and the simulation is compared with some algorithms that utilize a similar evolutionary approach. The results indicate that the proposed algorithm exhibits strong performance and is very promising for use in more productive work. [ABSTRACT FROM AUTHOR]

The firefly algorithm is nature-inspired, and it belongs to swarm intelligence category optimization. Firefly algorithm is the latest algorithm developed under the nature-inspired algorithm (NIA), which is fruitful for business and engineering optimization. So, for business optimization, healthcare industries are affected through big data where big data affects in different ways such as patients understanding and care, improved personalized care, analysis trends, predict health outcomes, etc. Big data analysis is required to optimize a broad set of data generated by the different mediums in the healthcare and engineering sectors. A firefly algorithm can be used to optimize data analysis and results. Therefore, the firefly algorithm becomes essential to optimize the healthcare sector application process and provides optimized solutions. This paper discussed firefly algorithm implementations, optimization solutions for an engineering problem, fireflies' algorithm (FA) performance through MATLAB 2019b, formulation, optimization problems in healthcare, firefly algorithms in other applications, and conclusions. This paper focuses on how the firefly algorithm (FA) can be used, modified, and merged with other optimization algorithms to solve engineering problems. [ABSTRACT FROM AUTHOR]

This paper discusses the merging of two optimization algorithms, atom search optimization and particle swarm optimization, to create a hybrid algorithm called hybrid atom search particle swarm optimization (h-ASPSO). Atom search optimization is an algorithm inspired by the movement of atoms in nature, which employs interaction forces and neighbor interaction to guide each atom in the population. On the other hand, particle swarm optimization is a swarm intelligence algorithm that uses a population of particles to search for the optimal solution through a social learning process. The proposed algorithm aims to reach exploration-exploitation balance to improve search efficiency. The efficacy of h-ASPSO has been demonstrated in improving the time-domain performance of two high-order real-world engineering problems: the design of a proportional-integral-derivative controller for an automatic voltage regulator and a doubly fed induction generator-based wind turbine systems. The results show that h-ASPSO outperformed the original atom search optimization in terms of convergence speed and quality of solution and can provide more promising results for different high-order engineering systems without significantly increasing the computational cost. The promise of the proposed method is further demonstrated using other available competitive methods that are utilized for the automatic voltage regulator and a doubly fed induction generator-based wind turbine systems. [ABSTRACT FROM AUTHOR]

In recent years, there is massive development of new metaheuristics as stochastic methods. Meanwhile, there is not any metaheuristics is powerful to handle all problems as stated in the no-free-lunch (NFL) theory. Based on this circumstance, this paper introduces a new swarm-based metaheuristics with the main strategy moving toward the resultant of better swarm members and avoiding the resultant of worse swarm members called group better-worse algorithm (GBWA). It consists of five searches: moving toward the best swarm member, moving toward the resultant of better swarm members, moving away from the resultant of worse swarm members, searching locally, and jumping to the opposite area. GBWA is then evaluated in three ways. The first evaluation is a comparative evaluation where GBWA is compared to five recent metaheuristics: coati optimization algorithm (COA), average and subtraction-based optimization (ASBO), clouded leopard optimization (CLO), total interaction algorithm (TIA), and osprey optimization algorithm (OOA). The second evaluation is the individual search evaluation. The third evaluation is hyperparameter test. The collection of 23 classic functions is chosen as the use case in all evaluations. The result of the first evaluation shows that GBWA is better than COA, ASBO, CLO, TIA, and OOA in 20, 21, 20, 21, and 21 functions consecutively. Meanwhile, the result of the second evaluation shows the equal contribution between the motion toward the best swarm member and the motion toward the resultant of better swarm members. [ABSTRACT FROM AUTHOR]

Many important computational applications in science, engineering, industry, and technology are represented by PSE (parameter sweep experiment) applications. These applications involve a large number of resource-intensive and independent computational tasks. Because of this, cloud autoscaling approaches have been proposed to execute PSE applications on public cloud environments that offer instances of different VM (virtual machine) types, under a pay-per-use scheme, to execute diverse applications. One of the most recent approaches is the autoscaler MOEA (multiobjective evolutive algorithm), which is based on the multiobjective evolutionary algorithm NSGA-II (nondominated sorting genetic algorithm II). MOEA considers on-demand and spot VM instances and three optimization objectives relevant for users: minimizing the computing time, monetary cost, and spot instance interruptions of the application's execution. However, MOEA's performance regarding these optimization objectives depends significantly on the optimization algorithm used. It has been shown recently that MOEA's performance improves considerably when NSGA-II is replaced by a more recent algorithm named NSGA-III. In this paper, we analyze the incorporation of other multiobjective optimization algorithms into MOEA to enhance the performance of this autoscaler. First, we consider three multiobjective optimization algorithms named E-NSGA-III (extreme NSGA-III), SMS-EMOA (S-metric selection evolutionary multiobjective optimization algorithm), and SMPSO (speed-constrained multiobjective particle swarm optimization), which have behavioral differences with NSGA-III. Then, we evaluate the performance of MOEA with each of these algorithms, considering the three optimization objectives, on four real-world PSE applications from the meteorology and molecular dynamics areas, considering different application sizes. To do that, we use the well-known CloudSim simulator and consider different VM types available in Amazon EC2. Finally, we analyze the obtained performance results, which show that MOEA with E-NSGA-III arises as the best alternative, reaching better and significant savings in terms of computing time (10%–17%), monetary cost (10%–40%), and spot instance interruptions (33%–100%). [ABSTRACT FROM AUTHOR]

A multi-swarm-evolutionary structure based on the parasitic relationship in the biosphere is proposed in this paper and, according to the conception, the Para-PSO-ABC algorithm (ParaPA), combined with merits of the modified particle swarm optimization (MPSO) and artificial bee colony algorithm (ABC), is conducted with the multimodal routing strategy to enhance the safety and the cost issue for the mobile robot path planning problem. The evolution is divided into three stages, where the first is the independent evolutionary stage, with the same evolution strategies for each swarm. The second is the fusion stage, in which individuals are evolved hierarchically in the parasitism structure. Finally, in the interaction stage, a multi-swarm-elite strategy is used to filter the information through a predefined cross function among swarms. Meanwhile, the segment obstacle-avoiding strategy is proposed to accelerate the searching speed with two fitness functions. The best path is selected according to the performance on the safety and consumption issues. The introduced algorithm is examined with different obstacle allocations and simulated in the real routing environment compared with some typical algorithms. The results verify the productiveness of the parasitism-relation-based structure and the stage-based evolution strategy in path planning. [ABSTRACT FROM AUTHOR]

In this paper, we study swarm intelligence computation for constrained optimization problems and propose a new hybrid PSO-DE algorithm based on feasibility rules. Establishing individual feasibility rules as a way to determine whether the position of an individual satisfies the constraint or violates the degree of the constraint, which will determine the choice of the individual optimal position and the global optimal position in the particle population. First, particle swarm optimization (PSO) is used to act on the top 50% of individuals with higher degree of constraint violation to update their velocity and position. Second, Differential Evolution (DE) is applied to act on the individual optimal position of each individual to form a new population. The current individual optimal position and the global optimal position are updated using the feasibility rules, thus forming a hybrid PSO-DE intelligent algorithm. Analyzing the convergence and complexity of PSO-DE. Finally, the performance of the PSO-DE algorithm is tested with 12 benchmark functions of constrained optimization and 57 engineering optimization problems, the numerical results show that the proposed algorithm has good accuracy, effectiveness and robustness. [ABSTRACT FROM AUTHOR]

Text document clustering is one of the data mining techniques used in many real-world applications such as information retrieval from IoT Sensors data, duplicate content detection, and document organization. Swarm intelligence (SI) algorithms are suitable for solving complex text document clustering problems compared to traditional clustering algorithms. The previous studies show that in SI algorithms, particle swarm optimization (PSO) provides an effective solution to text document clustering problems. This PSO still needs to be improved to avoid the problems such as premature convergence to local optima. In this paper, an approach called dynamic sub-swarm of PSO (subswarm-PSO) is proposed to improve the results of PSO for text document clustering problems and avoid the local optimum by improving the global search capabilities of PSO. The results of this proposed approach were compared with the standard PSO algorithm and K-means algorithm. As for performance assurance, the evaluation metric purity is used with six benchmark data sets. The experimental results of this study show that our proposed subswarm-PSO algorithm performs best with high purity comparing the standard PSO and K-means traditional algorithms and also the execution time of subswarm-PSO comparatively takes a little less than the standard PSO algorithm. [ABSTRACT FROM AUTHOR]

In the paradigm of industry 4.0, manufacturing enterprises need a high level of agility to adapt fast and with low costs to small batches of diversified products. They also need to reduce the environmental impact and adopt the paradigm of the circular economy. In the configuration space defined by this duality, manufacturing systems must embed a high level of reconfigurability at the level of their equipment. Finding the most appropriate concept of each reconfigurable equipment that composes an eco-smart manufacturing system is challenging because every system is unique in the context of an enterprise's business model and technological focus. To reduce the entropy and to minimize the loss function in the design process of reconfigurable equipment, an evolutionary algorithm is proposed in this paper. It combines the particle swarm optimization (PSO) method with the theory of inventive problem-solving (TRIZ) to systematically guide the creative potential of design engineers towards the definition of the optimal concept over equipment's lifecycle: what and when you need, no more, no less. The algorithm reduces the number of iterations in designing the optimal solution. An example for configuration design of a reconfigurable machine tool with adjustable functionality is included to demonstrate the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

The Honey Badger Algorithm (HBA) represents a novel swarm intelligence optimization algorithm introduced in recent years. However, its predominant constraints are linked to inadequate convergence accuracy and a vulnerability to entrapment in local optima. In an effort to mitigate these challenges, this paper introduces an Improved Honey Badger Algorithm Based on a Hybrid Strategy (OHBA). Firstly, during the population initialization phase, a method involving the utilization of a good point set is introduced to enhance the diversity and introduce more randomness into the population. Secondly, in the position update phase, the Beta distribution is employed as an alternative to the Uniform distribution, aiming to strike a balance between global exploration and local exploitation capabilities. Thirdly, an improved adaptive density factor strategy is incorporated into both global and local position updates to enhance the algorithm's convergence precision and speed. Lastly, within the global exploration stage, a Cauchy mutation strategy based on the Sine chaotic mapping is introduced to facilitate the algorithm in overcoming local optima and reinforcing its optimization capabilities. The improved algorithm's performance has been evaluated through a comprehensive set of assessments, including CEC-2017 functions, CEC-2022 functions, Wilcoxon rank-sum tests, and practical engineering optimization problems. These evaluations were undertaken to assess the algorithm in comparison to classical intelligent optimization algorithms. The experimental results show that OHBA possesses significant advantages in terms of convergence speed, optimization accuracy, robustness and its practical utility and effectiveness in addressing complex optimization challenges. This establishes OHBA as a highly competitive option in these critical aspects of optimization. [ABSTRACT FROM AUTHOR]

Ant Colony Optimization and Particle Swarm Optimization represent two widely used Swarm Intelligence (SI) optimization techniques. Information processing using Multiple-Valued Logic (MVL) is carried out using more than two discrete logic levels. In this paper, we compare two the SI-based algorithms in synthesizing MVL functions. A benchmark consisting of 50,000 randomly generated 2-variable 4-valued functions is used for assessing the performance of the algorithms using the benchmark. Simulation results show that the PSO outperforms the ACO technique in terms of the average number of product terms (PTs) needed. We also compare the results obtained using both ACO-MVL and PSO-MVL with those obtained using Espresso-MV logic minimizer. It is shown that on average, both of the SI-based techniques produced better results compared to those produced by Espresso-MV. We show that the SI-based techniques outperform the conventional direct-cover (DC) techniques in terms of the average number of product terms required. [ABSTRACT FROM AUTHOR]

The shape optimization of developable surfaces is a key and difficult technology in CAD/CAM. This paper studies the shape optimization of generalized developable Bézier-like surfaces using the improved salp swarm algorithm. First, aiming at the problems of slow convergence speed and low calculation accuracy, quickly falling into the optimal local solution for the salp swarm algorithm, and by adjusting the control parameters, the added Morlet wavelet mutation strategy to the individual position updates operation. An improved salp swarm algorithm is proposed, called FMSSA for short. Numerical results show that FMSSA performed the best among 18 (78%) comparisons with other improved SSAs in the CEC2005 test set. In addition, FMSSA serves the best among 16 (69%) comparisons with other algorithms. Therefore, the convergence speed and computational accuracy of FMSSA are improved, and the computational results are significantly better than other intelligent algorithms. Second, according to the duality principle of point and plane, the shape optimization problem of generalized developable Bézier-like surface is transformed into the minimization problem of arc length, energy, and curvature change rate of the dual curve, and three shape optimization models of the developable surface are established. Finally, shape optimization of expandable surfaces is mathematically an optimization problem that the swarm intelligence algorithm can efficiently handle, so FMSSA is used to solve these three optimization models. Numerical experiments show that FMSSA obtains optimal generalized developable Bézier-like surfaces in solving these three optimization models, demonstrating the superiority of the proposed FMSSA in effectively solving the shape optimization models in terms of precision and robustness. [ABSTRACT FROM AUTHOR]

Four-bar linkages are one of the most widely used mechanisms in industries. This paper presents a comparative study on the accuracy and efficiency of the optimum synthesis of path-generating four-bar linkages using five metaheuristic optimization algorithms. The utilized metaheuristic methods included two swarm intelligence-based algorithms, i.e., particle swarm optimization and hybrid particle swarm optimization, and three evolutionary-based algorithms, i.e., differential evolution, ensemble of parameters and mutation strategies in differential evolution, and linearly ensemble of parameters and mutation strategies in differential evolution. The objective function to be minimized is the sum of squares of the distance between the generated points and the precision points of a coupler point. The optimal design of four-bar linkages must meet the Grashof's criteria and exhibit sequential constraints that can prevent the occurrence of order defect. This study investigated five representative cases of the dimensional synthesis of four-bar path generators with and without prescribed timing and compared the optimal solutions of the utilized five metaheuristic methods to those of previously reported algorithms in literature. The improved metaheuristic methods exhibited superior optimal solution and enhanced reliability compared to the original methods. Moreover, three improved metaheuristic methods were not only easy implemented, but also more efficient for solving the optimal synthesis problems, particularly for high dimensional problems. [ABSTRACT FROM AUTHOR]

The Bacterial Foraging Algorithm (BFOA) is a well-known swarm collective intelligence algorithm used to solve a variety of constraint optimization problems with wide success. Despite its universality, implementing the BFOA may be complex due to the calibration of multiple parameters. Moreover, the Two-Swim Modified Bacterial Foraging Optimization Algorithm (TS-MBFOA) is a state-of-the-art modification of the BFOA which may lead to solutions close to the optimal but with more parameters than the original BFOA. That is why in this paper we present the design using the Unified Modeling Language (UML) and the implementation in the MATLAB platform of a front-end for the TS-MBFOA algorithm to calibrate the algorithm parameters faster and with no need for editing lines of code. To test our proposal, we solve a numerical optimization problem with constraints known as tension/compression spring, where 30 independent executions were conducted using the TS-MBFOA and then compared with an earlier version called MBFOA. The runtime configuration and the parameter tuning were fluent using our front-end, and the TS-MBFOA obtained the better results. To date, there is no other user-friendly implementation of this specific algorithm in an open-source code, and the front-end is flexible enough to include other numerical optimization problems with minimal effort. [ABSTRACT FROM AUTHOR]

The paper presents a new approach for solving a path planning problem for ships in the environment with static and dynamic obstacles. The algorithm utilizes a heuristic method, classified to the group of Swarm Intelligence approaches, called the Ant Colony Optimization. The method is inspired by a collective behaviour of ant colonies. A group of agents - artificial ants searches through the solution space in order to find a safe, optimal trajectory for a ship. The problem is considered as a multi-criteria optimization task. The criteria taken into account during problem solving are: path safety, path length, the International Regulations for Preventing Collisions at Sea (COLREGs) compliance and path smoothness. The paper includes the description of the new multi-criteria ACO-based algorithm along with the presentation and discussion of simulation tests results. [ABSTRACT FROM AUTHOR]

Formation of effective teams of experts has played a crucial role in successful projects especially in social networks. In this paper, a new particle swarm optimization (PSO) algorithm is proposed for solving a team formation optimization problem by minimizing the communication cost among experts. The proposed algorithm is called by improved particle optimization with new swap operator (IPSONSO). In IPSONSO, a new swap operator is applied within particle swarm optimization to ensure the consistency of the capabilities and the skills to perform the required project. Also, the proposed algorithm is investigated by applying it on ten different experiments with different numbers of experts and skills; then, IPSONSO is applied on DBLP dataset, which is an example for benchmark real-life database. Moreover, the proposed algorithm is compared with the standard PSO to verify its efficiency and the effectiveness and practicality of the proposed algorithm are shown in our results. [ABSTRACT FROM AUTHOR]

With the popularity of swarm intelligence algorithms, the positioning of nodes to be located in wireless sensor networks (WSNs) has received more and more attention. To overcome the disadvantage of large ranging error and low positioning accuracy caused by the positioning algorithm of the received signal strength indication (RSSI) ranging model, we use the RSSI modified by Gaussian to reduce the distance measurement error and introduce an improved whale optimization algorithm to optimize the location of the nodes to be positioned to improve the positioning accuracy. The experimental results show that the improved whale algorithm performs better than the whale optimization algorithm and other swarm intelligence algorithms under 20 different types of benchmark function tests. The positioning accuracy of the proposed location algorithm is better than that of the original RSSI algorithm, the hybrid exponential and polynomial particle swarm optimization (HPSO) positioning algorithms, the whale optimization, and the quasiaffine transformation evolutionary (WOA-QT) positioning algorithm. It can be concluded that the cluster intelligence algorithm has better advantages than the original RSSI in WSN node positioning, and the improved algorithm in this paper has more advantages than several other cluster intelligence algorithms, which can effectively solve the positioning requirements in practical applications. [ABSTRACT FROM AUTHOR]

Feature selection and lung nodule recognition are the core modules of the lung computer-aided detection (Lung CAD) system. To improve the performance of the Lung CAD system, algorithmic research is carried out for the above two parts, respectively. First, in view of the poor interpretability of deep features and the incomplete expression of clinically defined handcrafted features, a feature cascade method is proposed to obtain richer feature information of nodules as the final input of the classifier. Second, to better map the global characteristics of samples, the multiple kernel learning support vector machine (MKL-SVM) algorithm with a linear convex combination of polynomial kernel and sigmoid kernel is proposed. Furthermore, this paper applied the methods for speed contraction factor and roulette strategy, and a mixture of simulated annealing (SA) and particle swarm optimization (PSO) is used for global optimization, so as to solve the problem that the PSO is easy to lose particle diversity and fall into the local optimal solution as well as improve the model's training speed. Therefore, the MKL-SVM algorithm is presented in this paper, which is based on swarm intelligence optimization is proposed for lung nodule recognition. Finally, the algorithm construction experiments are conducted on the cooperative hospital dataset and compared with 8 advanced algorithms on the public dataset LUNA16. The experimental results show that the proposed algorithms can improve the accuracy of lung nodule recognition and reduce the missed detection of nodules. [ABSTRACT FROM AUTHOR]

The sparrow search algorithm is a new type of swarm intelligence optimization algorithm with better effect, but it still has shortcomings such as easy to fall into local optimality and large randomness. In order to solve these problems, this paper proposes an adaptive spiral flying sparrow search algorithm (ASFSSA), which reduces the probability of getting stuck into local optimum, has stronger optimization ability than other algorithms, and also finds the shortest and more stable path in robot path planning. First, the tent mapping based on random variables is used to initialize the population, which makes the individual position distribution more uniform, enlarges the workspace, and improves the diversity of the population. Then, in the discoverer stage, the adaptive weight strategy is integrated with Levy flight mechanism, and the fusion search method becomes extensive and flexible. Finally, in the follower stage, a variable spiral search strategy is used to make the search scope of the algorithm more detailed and increase the search accuracy. The effectiveness of the improved algorithm ASFSSA is verified by 18 standard test functions. At the same time, ASFSSA is applied to robot path planning. The feasibility and practicability of ASFSSA are verified by comparing the algorithms in the raster map planning routes of two models. [ABSTRACT FROM AUTHOR]

Aiming at the inherent problems of swarm intelligence algorithm, such as falling into local extremum in early stage and low precision in later stage, this paper proposes an improved sparrow search algorithm (ISSA). Firstly, we introduce the idea of flight behavior in the bird swarm algorithm into SSA to keep the diversity of the population and reduce the probability of falling into local optimum; Secondly, we creatively introduce the idea of crossover and mutation in genetic algorithm into SSA to get better next-generation population. These two improvements not only keep the diversity of the population at all times but also make up for the defect that the sparrow search algorithm is easy to fall into local optimum at the end of the iteration. The optimization ability of the improved SSA is greatly improved. [ABSTRACT FROM AUTHOR]

With the passage of time and recent advances in science and information technology, the development in the area of course selection based on some defined criteria has made the choice of the mechanism easy and effective. In this paper, the approach is based on an innovative perspective, and swarm intelligence was introduced for the intentional choice mechanism of course selection. The study has considered the course selection in English as an example. Swarm intelligence algorithm and integrative course selection were combined with the recommendation algorithm and the intent of course selection in English course to discuss the relevant decision mechanism. Firstly, the comprehensive selection intentional recommendation algorithm and PSO algorithm were introduced, and the algorithm was initialized. Secondly, the operation process was described in detail, and the application process was analyzed. Then, it was introduced into the English course elective process. Finally, the experimental results of the study came with the conclusion through the test that the PSO algorithm has a higher degree of accuracy and can better judge individual behaviors, which contributes to the establishment of choice-choice mechanism. The effectiveness of the study was demonstrated through experiments. [ABSTRACT FROM AUTHOR]

Cloud computing deals with voluminous heterogeneous data, and there is a need to effectively distribute the load across clusters of nodes to achieve optimal performance in terms of resource usage, throughput, response time, reliability, fault tolerance, and so on. The swarm intelligence methodologies use artificial intelligence to solve computationally challenging problems like load balancing, scheduling, and resource allocation at finite time intervals. In literature, sufficient works are being carried out to address load balancing problem in the cloud using traditional swarm intelligence techniques like ant colony optimization, particle swarm optimization, cuckoo search, bat optimization, and so on. But the traditional swarm intelligence techniques have issues with respect to convergence rate, arriving at the global optimum solution, complexity in implementation and scalability, which limits the applicability of such techniques in cloud domain. In this paper, we look into performance modeling aspects of some of the recent competitive swarm artificial intelligence based techniques like the whale, spider, dragonfly, and raven which are used for load balancing in the cloud. The results and analysis are presented over performance metrics such as total execution time, response time, resource utilization rate, and throughput achieved, and it is found that the performance of the raven roosting algorithm is high compared to other techniques. [ABSTRACT FROM AUTHOR]

The special features of some old residential complexes make reconstructing a better option than rebuilding. The complexity of redesign issues, the ability of computers to solve problems, and the capability of evolutionary optimization techniques in architecture make the use of these methods a priority over traditional processes. This paper, while introducing Particle Swarm Optimization (PSO) as one of the swarm intelligence based algorithms, answers the question of how this algorithm can be used to redesign residential complexes. To achieve this, after reviewing the application of PSO algorithms in architectural space planning, the redesign criteria and constraints was divided into four categories; including primary design specifications, contact-related criteria, designer-related criteria and redesign-related constraints. After the quantification process of these criteria, how to implement the algorithm to achieve optimal plans for each of the five plan types available in high-rise apartment complex in Mashhad, Iran, was shown as a case study. [ABSTRACT FROM AUTHOR]

In conventional differential evolutionary (DE) algorithm, mutation operator has significant influence on generating new vectors by mixing existing target vectors randomly selected from the current population. Recently, many mutation operators, which usually employ the best individual or some high-quality individuals randomly chosen, have been proposed to improve searching capability. However, such designs may easily suffer from premature convergence trapped by local optima. To make a trade-off between exploration and exploitation capability, this paper proposes a novel collective intelligence (CI)-based mutation operator, which is named as "current-to-sa-ci-best." In the presented mutation operator, the evolutionary information of m best target vectors is linearly combined to generate new mutant vectors. Besides, m is designed as an exponential-distributed random number which could be self-adapted based on successful records of m values alongside evolution. Moreover, this mutation operator could be applied to any DE algorithm without destroying existing search capability by adding a greedy selection operator. To verify its effectiveness, the proposed CI-based mutation strategy, which is named as SaCI, was embedded into some state-of-the-art DE variants on 28 CEC2013 benchmark functions. Numerical results have confirmed that the SaCI operator may be beneficial to DEs to some extent. [ABSTRACT FROM AUTHOR]

The ubiquitous presence of smart phones and other hand-held computing devices has resulted in a growing feasibility to utilize them as computing resources. However, these mobile devices are constrained in battery and may not possess adequate capability for computationally intensive tasks. Cloud computing allows mobile devices to address their inherent challenges by making it possible to offload computation, completely or partially, to powerful cloud servers. This enables mobile devices to act as compute resources; though, it also results in cost of using cloud servers as well as communication cost involved in offloading. The paper models the computation offloading problem as an optimization problem and makes use of nature-inspired algorithms for deciding whether a task should be executed locally on a mobile device or offloaded to the cloud. The study was performed over four algorithms, namely Genetic Algorithm (GA), Differential Evolution (DE), Particle Swarm Optimization (PSO) and Shuffled Frog Leaping Algorithm (SFLA). Experimental analysis revealed that these algorithms outperform exhaustive search technique by providing a near optimal solution in a reasonable time even for large workflows. Results also establish that GA outperforms DE, PSO and SFLA by around 45%, 65% and 42%, respectively by reducing an application's overall execution cost. [ABSTRACT FROM AUTHOR]

The Cockroach Swarm Optimization (CSO) algorithm is inspired by cockroach social behavior. It is a simple and efficient meta-heuristic algorithm and has been applied to solve global optimization problems successfully. The original CSO algorithm and its variants operate mainly in continuous search space and cannot solve binary-coded optimization problems directly. Many optimization problems have their decision variables in binary. Binary Cockroach Swarm Optimization (BCSO) is proposed in this paper to tackle such problems and was evaluated on the popular Traveling Salesman Problem (TSP), which is considered to be an NP-hard Combinatorial Optimization Problem (COP). A transfer function was employed to map a continuous search space CSO to binary search space. The performance of the proposed algorithm was tested firstly on benchmark functions through simulation studies and compared with the performance of existing binary particle swarm optimization and continuous space versions of CSO. The proposed BCSO was adapted to TSP and applied to a set of benchmark instances of symmetric TSP from the TSP library. The results of the proposed Binary Cockroach Swarm Optimization (BCSO) algorithm on TSP were compared to other meta-heuristic algorithms. [ABSTRACT FROM AUTHOR]

To accelerate the convergence rate of high-dimensional optimization problems, inspired by the cooperative hunting process of spider colonies named Anelosimus eximius, a new A. eximius colony algorithm (AECA) was proposed to solve combinatorial optimization problems. In the AECA, a certain direction component of the problem solution is represented as a certain direction in which a spider travels, so that a high-dimensional optimization problem can be transformed into multiple low-dimensional optimization problems. The AECA includes two intelligent behaviors: the random walk of spiders and the summoning of the initiator. The random walk of spiders ensures the diversity of spider colonies, whereas the summoning of the initiator can accelerate the convergence rate. We theoretically proved that the AECA is globally convergent. The inversion method of asteroid spectrum reflectance template can be used to solve the problem that the measured planetary spectrum is affected by the asteroid absorption effect and improves the accuracy of celestial Doppler difference velocimetry, which uses celestial spectrum to provide the information of velocity measurement for navigation. The essence of this method is the optimal combination problem of intrinsic mode functions (IMFs). We applied the AECA to the inversion of the planetary spectrum reflectance template. Experimental results show that, compared with genetic algorithms (GAs), the AECA can obtain the optimal combination of spectrum reflectance templates faster. In addition, to verify the universality of the AECA, for the classical knapsack problem, the AECA has a better optimization effect, faster convergence rate, and higher stability than other swarm intelligence algorithms such as GA, discrete particle swarm optimization, and the quantum genetic algorithm. [ABSTRACT FROM AUTHOR]

Extracting relevant information from a large amount of data is a challenging task. Automatic text summarization is a potential solution for obtaining this information. In this paper, a nature inspired swarm intelligence-based algorithm viz. firefly algorithm for multi-document text summarization is proposed. A new fitness function consisting of three features viz. topic relation factor, cohesion factor and readability factor is utilized. The experiments are performed on datasets from Document Understanding Conference i.e. DUC-2002, DUC-2003 and DUC-2004. The performance of the algorithm has been evaluated using ROUGE score. The performance of the proposed algorithm is compared with some other nature inspired ones such as particle swarm optimization (PSO) and genetic algorithm (GA). The performance of the proposed algorithm outperforms the other adopted ones. [ABSTRACT FROM AUTHOR]

Decision tree induction is a simple, however powerful learning and classification tool to discover knowledge from the database. The volume of data in databases is growing to quite large sizes, both in the number of attributes and instances. Some important limitations of decision trees are instability, local decisions, and overfitting for this extensive data. The simple, effective and non-convergence nature of the African Buffalo Optimization (ABO) algorithm makes it suitable to solve complex optimization problems. In this paper, we propose the African Buffalo Optimized Decision Tree (ABODT) algorithm to create globally optimized decision trees using the intelligent and collective behaviour of African Buffalos. The modified African Buffalo optimization algorithm is used to create efficient and optimal decision trees. To evaluate the efficiency of the proposed African Buffalo Optimized Decision Tree algorithm, experiments are performed on 15 standard UCI learning repository datasets that are of various sizes and domains. Results show that the African Buffalo Optimized Decision Tree algorithm globally optimizes decision trees, increases accuracy and reduces the size of a decision tree. These optimized trees are stable and efficient than conventional decision trees. [ABSTRACT FROM AUTHOR]

In unknown environments, multiple-robot cooperation for target searching is a hot and difficult issue. Swarm intelligence algorithms, such as Particle Swarm Optimization (PSO) and Fruit Fly Optimization Algorithm (FOA), are widely used. To overcome local optima and enhance swarm diversity, this paper presents a novel multi-swarm hybrid FOA-PSO (MFPSO) algorithm for robot target searching. The main contributions of the proposed method are as follows. (1) The improved FOA (IFOA) provides a better value for the improved PSO (IPSO) to find the next optimal robot position value. (2) Multi-swarm strategy is introduced to enhance the diversity and achieve an effective exploration to avoid premature convergence and falling into local optima. (3) An escape mechanism named MSCM (Multi-Scale Cooperative Mutation) is used to address the limitation of local optima and enhance the escape ability for obstacle avoidance. All of the aspects mentioned above lead robots to the target without falling into local optima and allow the search mission to be performed more quickly. Several experiments in four parts are performed to verify the better performance of MFPSO. The experimental results show that the performance of MFPSO is much more significant than that of other current approaches. [ABSTRACT FROM AUTHOR]

This paper intends to enhance the learning performance of radial basis function neural network (RBFnn) using self-organizing map (SOM) neural network (SOMnn). In addition, the particle swarm optimization (PSO) and genetic algorithm (GA) based (PG) algorithm is employed to train RBFnn for function approximation. The proposed mix of SOMnn with PG (MSPG) algorithm combines the automatically clustering ability of SOMnn and the PG algorithm. The simulation results revealed that SOMnn, PSO and GA approaches can be combined ingeniously and redeveloped into a hybrid algorithm which aims for obtaining a more accurate learning performance among relevant algorithms. On the other hand, method evaluation results for four continuous test function experiments and the demand estimation case showed that the MSPG algorithm outperforms other algorithms and the Box-Jenkins models in accuracy. Additionally, the proposed MSPG algorithm is allowed to be embedded into business' enterprise resource planning system in different industries to provide suppliers, resellers or retailers in the supply chain more accurate demand information for evaluation and so to lower the inventory cost. Next, it can be further applied to the intelligent manufacturing system to cope with real situation in the industry to meet the need of customization. [ABSTRACT FROM AUTHOR]

This paper presents an improved particle swarm optimization (PSO) technique for global optimization. Many variants of the technique have been proposed in literature. However, two major things characterize many of these variants namely, static search space and velocity limits, which bound their flexibilities in obtaining optimal solutions for many optimization problems. Furthermore, the problem of premature convergence persists in many variants despite the introduction of additional parameters such as inertia weight and extra computation ability. This paper proposes an improved PSO algorithm without inertia weight. The proposed algorithm dynamically adjusts the search space and velocity limits for the swarm in each iteration by picking the highest and lowest values among all the dimensions of the particles, calculates their absolute values and then uses the higher of the two values to define a new search range and velocity limits for next iteration. The efficiency and performance of the proposed algorithm was shown using popular benchmark global optimization problems with low and high dimensions. Results obtained demonstrate better convergence speed and precision, stability, robustness with better global search ability when compared with six recent variants of the original algorithm. [ABSTRACT FROM AUTHOR]

Being sensitive to initial position and noise is the key problem that must be solved in point cloud registration. To improve the overall performance of registration methods, a point cloud registration method based on the Dark Forest Algorithm is proposed in this paper. The introduction of swarm intelligence enhances the adaptability of the registration method to the initial position and improves the robustness of the point cloud registration system. Furthermore, the application of the Dark Forest Algorithm with four capability enhancement strategies: the hierarchical elite, civilization self-decision, suspicion chain, and technology explosion has improved the comprehensive competitiveness in point cloud registration. The mentioned strategies have brought a great positive impact on the registration methods in solving the far initial position, breaking away from the local optimal solution, and weakening the noise interference. The paper aims to provide the Dark Forest Algorithm and the point cloud registration method based on it, which are elaborated on in detail and compared to other existing algorithms to prove the comprehensive performance, respectively. Then, the point cloud registration experiment for coal-wall point clouds was carried out and the results indicate that the proposed registration algorithm is better than other algorithms for standard point cloud dataset and coal-wall point cloud, which demonstrates that the proposed registration method has strong potential competitiveness. • Proposed a point cloud registration based on a novel meta-heuristic algorithm. • Dark Forest Algorithm is proposed with the higher accuracy and stronger adaptability. • Cloud registration based on the DFA demonstrates potential competitiveness. [ABSTRACT FROM AUTHOR]

A fuzzy cloud resource scheduling model with time-cost constraints is built using fuzzy triangular numbers to represent uncertain task execution time. Task scheduling reduces total time and cost spent on a project. It connects virtual machines and functions. Particle swarm optimization (HPO) is used to plan cloud resources (HSOA). The approach uses orthogonal particle swarm initialization to increase the quality of the initial particle exploration, rerandomization to regulate the particle search range, and real-time updating of inertia weights to control particle speed. The suggested problem model and optimization approach are evaluated using random simulation data provided by the CloudSim simulation platform. Less overall execution time and a lower cost are shown to have fast convergence and solution capabilities in experiments. [ABSTRACT FROM AUTHOR]

In recent years, there have been notable advancements in the theoretical research of existing meta-heuristic algorithms and in the development of novel algorithms. However, the research on the definition and construction methods of the so-called "mutation" operator, a concept widely used in existing meta-heuristic algorithms, remains notably insufficient. In addition, how to directly construct a meta-heuristic algorithm under the guidance of stability and invariance analysis continues to pose a challenge that has yet to resolve. This paper carefully investigates and rigorously defines the concepts of "mutation operator" and "mutation-driven meta-heuristic algorithm" as found in the literature. According to these definitions, a novel meta-heuristic algorithm, called Multi-direction guided Mutation-driven Stable swarm Intelligence algorithm with Translation and Rotation invariance (M2SITRI) is proposed, and the corresponding mutation operator is carefully designed based on the analysis of translation invariance, rotation invariance, order-1 stability, and order-2 stability. The stability and invariance properties of the M2SITRI algorithm are validated through numerical simulations, and its superior solving performance is demonstrated by benchmarking it against several other well-known existing meta-heuristic algorithms across a variety of test problems. • Mutation operator and mutation-driven meta-heuristic algorithm concepts are defined. • A novel translation and rotationally invariant meta-heuristic algorithm termed M2SITRI is proposed. • The invariance and stability properties and the excellent solving performance of M2SITRI algorithm are verified. [ABSTRACT FROM AUTHOR]

This paper presents the first investigation on applying a particle swarm optimization (PSO) algorithm to both the Steiner tree problem and the delay constrained multicast routing problem. Steiner tree problems, being the underlining models of many applications, have received significant research attention within the meta-heuristics community. The literature on the application of meta-heuristics to multicast routing problems is less extensive but includes several promising approaches. Many interesting research issues still remain to be investigated, for example, the inclusion of different constraints, such as delay bounds, when finding multicast trees with minimum cost. In this paper, we develop a novel PSO algorithm based on the jumping PSO (JPSO) algorithm recently developed by Moreno-Perez et al. (Proc. of the 7th Metaheuristics International Conference, ), and also propose two novel local search heuristics within our JPSO framework. A path replacement operator has been used in particle moves to improve the positions of the particle with regard to the structure of the tree. We test the performance of our JPSO algorithm, and the effect of the integrated local search heuristics by an extensive set of experiments on multicast routing benchmark problems and Steiner tree problems from the OR library. The experimental results show the superior performance of the proposed JPSO algorithm over a number of other state-of-the-art approaches. [ABSTRACT FROM AUTHOR]