Search

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]

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]

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]

A fireworks algorithm (FWA) is a recent swarm intelligence algorithm that is inspired by observing fireworks explosions. An adaptive fireworks algorithm (AFWA) proposes additional adaptive amplitudes to improve the performance of the enhanced fireworks algorithm (EFWA). The purpose of this paper is to add opposition-based learning (OBL) to AFWA with the goal of further boosting performance and achieving global optimization. Twelve benchmark functions are tested in use of an opposition-based adaptive fireworks algorithm (OAFWA). The final results conclude that OAFWA significantly outperformed EFWA and AFWA in terms of solution accuracy. Additionally, OAFWA was compared with a bat algorithm (BA), differential evolution (DE), self-adapting control parameters in differential evolution (jDE), a firefly algorithm (FA), and a standard particle swarm optimization 2011 (SPSO2011) algorithm. The research results indicate that OAFWA ranks the highest of the six algorithms for both solution accuracy and runtime cost. [ABSTRACT FROM AUTHOR]

In recent years, the development of multi-classifier systems has become an active research field. A multi-classifier system is an ensemble of classification algorithms whose individual outputs are fused together for better accuracy and interpretability. An important aspect when designing such systems is related to the heterogeneity of the building blocks (classifiers) that make up the ensemble, since previous studies have uncovered that a more diverse ensemble often boosts up the overall classification power. Some statistical measures can be used to estimate how diverse the classifier ensembles are; they are called diversity measures. Another issue to be considered is the number of individual classifiers included in the model: the lower the number of classifiers, the simpler the resulting system. In general terms, the parsimony principle is highly desired in such ensembles, since a bulky ensemble will also be a very time-consuming model. Finding the minimal subset of individual classifiers that brings about the best system performance can be posed as a combinatorial optimization problem. In this paper, we address the problem of building multi-classifiers systems from the perspective of Ant Colony Optimization (ACO), a widely popular and effective metaheuristic optimization algorithm. The main reason behind the use of ACO lies on its strong ability to solve entangled combinatorial optimization problems. An empirical analysis is included to statistically validate the benefits of our proposal. [ABSTRACT FROM AUTHOR]