Search

Process discovery approaches analyze the business data to automatically uncover structured information, known as a process model. The quality of a process model is measured using quality dimensions, completeness (replay fitness), preciseness, simplicity, and generalization. Traditional process discovery algorithms usually output a single process model. A single model may not accurately capture the observed behavior and overfit the training data. We have formed the process discovery problem in a multiobjective framework that yields several candidate solutions for the end user who can pick a suitable model based on the local environmental constraints (possibly varying). We consider the Binary Differential Evolution approach in a multiobjective framework for the task of process discovery. The proposed method employs dichotomous crossover/mutation operators. The parameters are tuned using grey relational analysis combined with the Taguchi approach. We have compared the proposed approach with the well‐known single‐objective algorithms and state‐of‐the‐art multiobjective evolutionary algorithm—Nondominated Sorting Genetic Algorithm (NSGA‐II). Additional comparison via computing a weighted average of the quality dimensions is also undertaken. Results show that the proposed algorithm is computationally efficient and produces diversified candidate solutions that score high on the fitness functions. It is shown that the process models generated by the proposed approach are superior to or at least as good as those generated by the state‐of‐the‐art algorithms. [ABSTRACT FROM AUTHOR]

The rapid development of mobile Internet has promoted the rapid rise of cloud computing technology. Mobile terminal devices have greatly expanded the service capacity of mobile terminals by migrating complex computing tasks to run in the cloud. However, in the process of data exchange between mobile terminals and cloud computing centers, on the one hand, it consumes the limited power of mobile terminals, and on the other hand, it results in longer communication time, which negatively affects user QoE. Mobile cloud can effectively improve user QoE by shortening the data transmission distance, reducing the power consumption, and shortening the communication time at the same time. In this paper, we utilize the property that genetic algorithm can perform global search seeking the global optimal solution and construct a dynamic task scheduling model by combining the device-cloud link. The task scheduling model based on genetic algorithm and random scheduling algorithm is compared through comparison experiments, which show that the assignment time of the task scheduling model based on genetic algorithm is shortened by 11.82% to 48.51% and the energy consumption is reduced by 22.28% to 47.52% under different load conditions. [ABSTRACT FROM AUTHOR]

In this paper, we present an innovative approach for the discovery of involutory maximum distance separable (MDS) matrices over finite fields F 2 q , derived from MDS self-dual codes, by employing a technique based on genetic algorithms. The significance of involutory MDS matrices lies in their unique properties, making them valuable in various applications, particularly in coding theory and cryptography. We propose a genetic algorithm-based method that efficiently searches for involutory MDS matrices, ensuring their self-duality and maximization of distances between code words. By leveraging the genetic algorithm's ability to evolve solutions over generations, our approach automates the process of identifying optimal involutory MDS matrices. Through comprehensive experiments, we demonstrate the effectiveness of our method and also unveil essential insights into automorphism groups within MDS self-dual codes. These findings hold promise for practical applications and extend the horizons of knowledge in both coding theory and cryptographic systems. [ABSTRACT FROM AUTHOR]

As one of the most serious geological hazards, landslides affect infrastructure construction. Thus, it is vital to prepare reliable landslide susceptibility evaluation maps to avoid landslide-prone areas in construction projects. More studies on landslide susceptibility using machine learning have emerged in recent years, but there is a need to study ways to draw up high-precision evaluation maps. In this article, a 60 km oil pipeline in China's Kunming was selected as the research area. The data of 141 landslide points in the research area were obtained through field work and data collection. Meanwhile, lithology, elevation, aspect, slope, stream power index, topographic wetness index, average annual rainfall from 2017 to 2021, distance to roads, and terrain roughness were selected as causal factors of landslide susceptibility in the research area. First, the information value method was used to quantify the impact of conditional factors on landslides. Genetic algorithm (GA), particle swarm optimization (PSO), and bat algorithm (BA) were then used for parameter tuning, and the support vector machine (SVM) was used to analyze landslide susceptibility in the research area. Finally, the receiver operating characteristic (ROC) curve was used to test the model performance after parameter tuning with GA, PSO, and BA. The results show that the area-under-the-curve (AUC) values obtained through SVM, GA-SVM, PSO-SVM, and BA-SVM are 81.1%, 86.2%, 89%, and 91.8%, respectively. SVM had the best performance after parameter tuning with the BA algorithm. [ABSTRACT FROM AUTHOR]

Shared e-scooters are provided as a free-floating service that can be freely rented and returned within the service area. Although this has a positive effect in terms of convenience for users of shared e-scooters, it is creating new urban problems, such as undermining the aesthetics of the city and obstructing the passage of pedestrians. Therefore, this study developed an optimal rebalancing algorithm to mitigate these problems and proposed an efficient operation plan. Complete relocation was performed to match the demand and supply for an efficient operation by reducing the unnecessary oversupply of shared e-scooters. The optimal rebalancing algorithm that reflects the attributes of e-scooters was developed through genetic algorithms and subsequently applied to actually used cases. The results indicate that when 20% of the potential demand was considered, an optimal solution could be derived with two relocation vehicles; however, when the potential demand was not considered, three relocation vehicles were required. Therefore, it is anticipated that the results of this study can serve as basic data for solving various urban problems caused by the recent rapid increase in the use of shared e-scooters. [ABSTRACT FROM AUTHOR]

The flexibility of cloud computing to provide a dynamic and adaptable infrastructure in the context of information technology and service quality has made it one of the most challenging issues in the computer industry. Task scheduling is a major challenge in cloud computing. Scheduling tasks so that they may be processed by the most effective cloud network resources has been identified as a critical challenge for maximizing cloud computing's performance. Due to the complexity of the issue and the size of the search space, random search techniques are often used to find a solution. Several algorithms have been offered as possible solutions to this issue. In this study, we employ a combination of the genetic algorithm (GA) and the gravitational emulation local search (GELS) algorithm to overcome the task scheduling issue in cloud computing. GA and the particle swarm optimization (PSO) algorithms are compared to the suggested algorithm to demonstrate its efficacy. The suggested algorithm outperforms the GA and PSO, as shown by the experiments. [ABSTRACT FROM AUTHOR]

A novel random biased-genetic algorithm (NRB-GA) load-balancing algorithm that exhibits the characteristics of both genetic algorithms and biased random algorithms is designed and developed to improve the processing time and response time metrics of the cloud computing environment. The NRB-GA is designed to discover a virtual machine with fewer loads by applying a genetic algorithm with a fitness function that is inversely proportional to the average load over a period of time for each virtual machine and with biased parent selection to maximize the fitness values of offspring. The developed NRB-GA load-balancing algorithm is evaluated by analysing its performance for various simulated scenarios in a cloud computing environment with different user bases and data center configurations. The analysis of the experimental results of NRB-GA indicates that the average response time is reduced by 27.22%, 21.15%, and 22.34%, and the processing time is reduced by 25.73%, 16.14%, and 18.82% for one, two, and three data centers, respectively. It is evident that the proposed NRB-GA algorithm for load balancing outperforms other existing algorithms significantly. [ABSTRACT FROM AUTHOR]

Aiming at low efficiency of agricultural machinery scheduling, this paper proposes an adaptive immune‐following algorithm (AIFA) based on immune algorithm and artificial fish swarm algorithm. The adaptive crossover operator is used to accelerate convergence, and adaptive mutation operator ensures good diversity of population. After the adaptive evolution operations are performed, the following operator based on the following behavior of artificial fish swarm algorithm is embedded into the algorithm, which improves the convergence precision and obtains the promising optimization results. Experiments on scheduling considering the breakdown of agricultural machinery are performed based on multiple regions and multiple agricultural machineries. Compared with the immune algorithm and genetic algorithm, the simulation results demonstrate that AIFA can converge faster and achieve a better optimal solution. [ABSTRACT FROM AUTHOR]

In this paper, we consider the problem of motion intention recognition for cluster targets with splitting behaviour and lack of motion prior information. This is a challenge to the classical Bayesian inference based intention recognition algorithms because they rely heavily on a priori knowledge. In order to solve these problems, a joint algorithm of deep echo state network optimized by adaptive genetic algorithm (AGADESN) and DBSCAN clustering algorithm is proposed in this paper. We use improved Olfati-Saber model with direction noise to generate cluster motion and use the cluster motion data to drive AGADESN algorithm to predict cluster destination, which achieves higher destination prediction accuracy than DESN algorithm. We innovatively design the motion similarity distance (MSD) and take the destination prediction output as one of the distance inputs, alleviating the lack of differentiation among different cluster targets caused by only relying on speed and position distance at the early stage of cluster motion. Based on the MSD, DBSCAN clustering algorithm is used to identify clusters in the field of view to determine whether splitting behaviour occurs. Simulation results demonstrate the effectiveness of the proposed algorithm in cluster target motion intention recognition and its superiority over DESN algorithm and DBSCAN algorithm only based on speed and position distance. [ABSTRACT FROM AUTHOR]

With the increasingly important role of image segmentation in the field of computed tomography (CT) image segmentation, the requirements for image segmentation technology in related industries are constantly improving. When the hardware resources can fully meet the needs of the fast and high-precision image segmentation program system, the main means of how to improve the image segmentation effect is to improve the related algorithms. Therefore, this study has proposed a combination of genetic algorithm (GA) and Great Law (OTSU) algorithm to form an image segmentation algorithm-immune genetic algorithm (IGA) algorithm. The algorithm has improved the segmentation accuracy and efficiency of the original algorithm, which is beneficial to the more accurate results of CT image segmentation. The experimental results in this study have shown that the operating efficiency of the OTSU segmentation algorithm is up to 75%. The operating efficiency of the GA algorithm is up to 78%. The operating efficiency of the IGA algorithm is up to 92%. In terms of operating efficiency, the OTSU segmentation algorithm has more advantages. In terms of segmentation accuracy, the highest accuracy rate of OTSU segmentation algorithm is 45%. The accuracy of the GA algorithm is 80%. The highest accuracy of the IGA algorithm is 97%. The IGA algorithm is more powerful in terms of operating efficiency and accuracy. Therefore, the application of the IGA algorithm to CT image segmentation is beneficial to doctors to better judge the lesions and improve the diagnosis rate. [ABSTRACT FROM AUTHOR]

Considering that in the process of job scheduling, the cluster load should be prebalanced rather than remedied when the load is seriously unbalanced; therefore, in this paper, the task scheduling flow of the Hadoop cluster is analyzed deeply. On the Hadoop platform, a self-dividing algorithm is proposed for load balancing. An intelligent optimization algorithm is used to solve load balance. A dynamic feedback load balancing scheduling method is proposed from the point of view of task scheduling. In order to solve the shortcoming of the fair scheduling algorithm, this paper proposes two ways to improve the resource utilization and overall performance of Hadoop. When the mapping task is completed and the tasks to be reduced are assigned, the task assignment is based on the performance of the nodes to be reduced. It gives full play to the advantages of the ant colony algorithm and the hive colony algorithm so that the fusion algorithm can better deal with load balance. Then, three existing scheduling algorithms are introduced in detail: single queue scheduling, capacity scheduling, and fair scheduling. On this basis, an improved task scheduling strategy based on genetic algorithm is proposed to allocate and execute application tasks to reduce task completion time. The experiment verifies the effectiveness of the algorithm. The LBNP algorithm greatly improves the efficiency of reducing task execution and job execution. The delay capacity scheduling algorithm can ensure that most tasks can achieve localization scheduling, improve resource utilization, improve load balance, and speed up job completion time. [ABSTRACT FROM AUTHOR]

The more frequent occurrence of network security incidents has an impact on network security. Through the research on network security situational awareness, this paper constructs a multilevel network security situation evaluation index system from various aspects and uses the Elman neural network optimized by the genetic algorithm to evaluate network security situation. Aiming at the disadvantage of subjective dependence in the traditional assignment method of basic probability assignment function, Elman neural network is used to obtain the basic probability assignment function to increase its objectivity, and it is optimized with the PSD algorithm. In addition, the neural network is further improved by the genetic algorithm. In the traditional D-S evidence theory, an evidence correction step is added to optimize the situation that the final judgment result is incorrect due to evidence conflict. Finally, the fusion rules of the D-S evidence theory are used to fuse the support degrees of the four first-level situations to different security levels to obtain the final network security situation assessment result. The results show that the prediction accuracy of the GA-Elman neural network model is as high as 80%, which is significantly higher than that of the traditional D-S model, indicating that the model proposed in this paper has improved the accuracy of the assessment and prediction results. In conclusion, this study provides feasible theoretical prediction guidance for the accurate assessment of network security posture, reveals the improvement ideas for network security development, and is of great significance for the maintenance of network environment security. [ABSTRACT FROM AUTHOR]

This paper proposes a direct position determination (DPD) method for a digital modulation signal based on time difference of arrival (TDOA) measurements. Unlike the two-step positioning process, the measurements are used to directly estimate the source position. Fully utilizing information in a transmitted waveform can improve the accuracy of source localization in a single-step method. Based on maximum likelihood (ML) estimates, when the digital modulation scheme is known to the location system, an alternating iterative DPD method is developed to locate the emitter. The objective function of the proposed algorithm takes into account the source position and transmitted symbol sequence, which makes it a mixed-integer optimization problem. In particular, ML sequence estimation is adopted and the complex envelope is restored using a genetic algorithm. Then, based on Newton's method, an alternating iterative algorithm is proposed to update the position and symbol sequence results. Compared with the existing DPD method, the proposed algorithm gives more accurate location results for unknown waveforms. In addition, the proposed algorithm can reach the Cramér-Rao bound (CRB) for known signal waveforms, as verified using comprehensive simulations. [ABSTRACT FROM AUTHOR]

In recent years, an increasing number of population-based metaheuristic algorithms have been proposed to solve the flexible job-shop scheduling problem (FJSP) according to its practicality and complexity. Most of these algorithms are single-population-based and hence are very susceptible to becoming trapped in local optimal values. Thus, multipopulation methods are widely used to improve these algorithms, resulting in multipopulation algorithms. These multipopulation algorithms have been widely studied in the context of single-layer complex networks recently. However, coupled networks used to control two (or more) algorithms simultaneously to get a better algorithm are always ignored in literature. Therefore, in this paper, using coupled scale-free networks (with different scaling exponents) to control the genetic algorithm (GA) and the invasive weed optimization (IWO) simultaneously, a multipopulation GA/IWO with coupled scale-free networks (MPGAIWO-SF) is proposed to solve FJSP. Then, we study how some parameters (e.g., subpopulation size, subpopulation number, and scaling exponent) of MPGAIWO-SF affect its performance, which is also ignored in literature. The simulation results illustrate that (1) the performance of MPGAIWO-SF is significantly improved compared with that of GA and IWO; (2) as the subpopulation size increases, the performance of MPGAIWO-SF first becomes better and then remains almost unchanged; (3) as the subpopulation number increases, the performance of MPGAIWO-SF first becomes better and then decreases rapidly; and (4) the performance of MPGAIWO-SF becomes worse slightly as the scaling exponent decreases. Finally, solving more FJSP instances, the MPGAIWO-SF with optimized parameters is compared with other related algorithms to verify its effectiveness. [ABSTRACT FROM AUTHOR]

For the multiple automated guided vehicle (multi-AGV) routing problems in the warehousing link of logistics, where the optimization objective is to minimize both the number of AGVs used and the maximum pickup time simultaneously, a nondominant sorting differential evolution (NSDE) algorithm is proposed. In the encoding and decoding stages, the pickup point area is divided. AGVs are allocated to each region according to the proposed rule based on avoiding duplicate paths. Meanwhile, the pickup points within the region can be adjusted to optimize the pickup paths and improve the pickup efficiency. The fast nondominated sorting method and elitist selection strategy in the nondominated sorting genetic algorithm II (NSGA-II) are introduced into the differential evolution algorithm, which sorts all the regions to obtain the best Pareto solution set. Lastly, the domination of the proposed NSDE algorithm in Pareto frontier evaluation indicators is verified by some numerical experiments. [ABSTRACT FROM AUTHOR]

In logistics distribution systems, the constrained optimisation of the cargo dispensing problem has been the focus of research in related fields. At present, many scholars try to solve the problem by introducing swarm intelligence algorithms, including genetic algorithm, particle swarm algorithm, bee swarm algorithm, fish swarm algorithm, etc. Each swarm intelligence algorithm has different characteristics, but they all have certain advantages for the optimisation of complex problems. In recent years, the Wolf Pack algorithm, an emerging swarm intelligence algorithm, has shown good global convergence and computational robustness in solving complex high-dimensional functions. Therefore, this article chooses to use the Wolf Pack algorithm to solve a multi-vehicle and multi-goods dispensing problem model. First, the principle and process of the Wolf Pack algorithm are introduced, and two improvements are proposed for the way of location update and the way of step update. Then, a mathematical model of the multi-vehicle and multi-goods dispensing problem is developed. Next, the mathematical model is solved using the proposed improved Wolf Pack algorithm. The experimental results show that the proposed improved Wolf Pack algorithm effectively solves the cargo dispatching problem. In addition, the proposed improved Wolf Pack algorithm can effectively reduce the number of vehicles to be dispatched compared with other swarm intelligence algorithms. [ABSTRACT FROM AUTHOR]

Aiming at the shortcomings of traditional genetic algorithms such as premature and insufficient local search ability, a hybrid genetic algorithm combining k -means algorithm and cluster analysis to improve genetic algorithm is proposed. Among them, the selection operation adopts the tournament selection strategy of the elite retention model, the crossover operation adopts the double cut-point crossover, and the variation operator introduces the k -exchange variation operation to ensure the evolution of individuals from generation to generation. Through the selection, crossover, and variation operations, the objective function is minimized, the vehicle travel distance is greatly reduced, and the distribution route is optimized. [ABSTRACT FROM AUTHOR]

As an important model of machine learning, Bayesian networks (BNs) have received a lot of attentions since they can be used for classification via probabilistic inference. However, since it is a complicated combination optimization problem, BN structure learning cannot be solved with classic convex optimization algorithms. Hence, evolutionary algorithms provide an alternative way to find a global solution to BN structure learning problem. In this paper, we improve the biased random-key genetic algorithm to solve the BN structure learning problem. Meanwhile, we apply a local optimization model as its decoder to improve the performance of the proposed algorithm. Finally, we conduct our experiments on nine benchmark networks and a real dataset of cross-site scripting (XSS) attack. Experimental results show that the proposed algorithm can obtain more accurate solutions than other state-of-the-art algorithms and achieve a good performance in XSS attack detection for web security. [ABSTRACT FROM AUTHOR]

In order to solve the problem in the application and optimization method of fractal art pattern generation, on the basis of the integration of the fractal theory and genetic algorithm, a generation method based on genetic algorithm and composition generation was proposed. The method provided a more stable and convenient supporting environment for the innovative design of artistic patterns, which met the needs of different users for the design of artistic patterns. The experimental results showed that the simplified genetic programming algorithm was optimized in both individual coding complexity and algorithm complexity. The search space was 1023-1026 times larger than the traditional algorithm, and the evaluation times were 2-3 times larger than the traditional algorithm. The results showed that the method could solve the problem that fitness function could not express well and ensure the optimal genetic population. [ABSTRACT FROM AUTHOR]

In order to improve the prediction accuracy of stock price, an improved model QPSO-DBN-GABP using quantum particle swarm optimization algorithm to optimize deep belief network is proposed. In this model, the quantum particle swarm optimization algorithm is used to find the optimal combination of the number of neurons in each layer of RBM, and the genetic algorithm is used to optimize the initial weight and threshold of BP neural network, so as to obtain the optimized combination prediction model. The prediction results are compared with those of DBN, PSO-DBN, and QPSO-DBN models. Through the comparison of experimental results, it is found that compared with the above three prediction models, the prediction error index RMSE of the model is reduced by about 10.1%, 9.1%, 1.3%, and MAE is reduced by 8.1%, 5.7%, and 0.67%. The prediction accuracy of the model is improved to 96.435%. [ABSTRACT FROM AUTHOR]

In our study, in terms of performance evaluation methods, the performance evaluation algorithm based on genetic algorithm and fuzzy comprehensive performance evaluation algorithm is introduced, their advantages and disadvantages are compared and analyzed, and the design idea of fuzzy performance evaluation algorithm based on compound elements is proposed. It can be divided into seven steps: first, clarify the evaluation purpose and object; second, select the optimal evaluation mode and method; third, compile the evaluation index system; fourth, it is to collect information extensively; fifth, the evaluation adopts a variety of methods, multiple angles, and multiple sides to collect materials so that the conclusion of the evaluation has sufficient factual basis; the sixth is to process the information and make a comprehensive evaluation; the seventh is to analyze the results and write an evaluation report. Based on the existing algorithms, the fuzzy performance evaluation algorithm based on compound elements is studied, and the detailed design of the algorithm is presented. Through the comparison and analysis of the performance evaluation algorithm based on compound elements and the performance evaluation algorithm of specific elements, the superiority of the performance evaluation algorithm based on compound elements is experimentally verified by comparing the operation time and classification accuracy. The performance evaluation system based on the performance evaluation algorithm designed in this study, combined with the official business of the performance evaluation system, modularizes the administrative management activities of the enterprise, digitizes the electronic office information, and conducts in-depth exploration of the unstructured natural language. A real-time performance evaluation system based on the arrangement of corporate administrative activities has been established. By designing and implementing a performance-assisted analysis system based on text content analysis, which is suitable for performance evaluation systems, it solves the imperfect problem of performance evaluation based on electronic enterprise administrative management. [ABSTRACT FROM AUTHOR]

In order to meet the edge services placement demand for multiobjective optimization of Power Internet of Things, an edge services placement strategy based on an improved strength Pareto evolutionary algorithm (SPEA2) is proposed in this paper. Firstly, we model the delay, resource utilization, and energy consumption. Then, a multiobjective optimization is proposed. Finally, an enhanced genetic algorithm is used to derive the decision candidate set. Moreover, the optimal solution in the candidate set is selected to be utilized in the iteration of the multicriteria decision and the superior-inferior solution distance method. Numerical results and analysis show that the proposed strategy is more effective in reducing system delay, improving resource utilization, and saving energy consumption than the other two benchmark algorithms. [ABSTRACT FROM AUTHOR]

Using the traditional English teaching mode is difficult to help correct students, and it is difficult to achieve human-computer interaction in oral English communication. In order to improve the effect of English detection and improve teaching efficiency, this article builds an artificial intelligence-assisted teaching system suitable for English teaching based on heuristic genetic algorithms. Furthermore, this article extends the multioffspring genetic algorithm, improves the offspring generation method, and proposes GMOGA, which makes the choice of the number of offspring more flexible. At the same time, it also enables the value of the number of children of the algorithm to be a value that cannot be obtained by the previous algorithm, which further improves the efficiency of the algorithm. In addition, this article combines the actual needs to construct the functional structure of the artificial intelligence system and designs two sets of comparative experiments to verify and analyze the model's performance. The research results show that the model constructed in this article meets the multifunctional requirements of the system and can be applied to practice. [ABSTRACT FROM AUTHOR]

Instant delivery is an intermediary bridge for same-city O2O services and an important part of urban short-distance logistics. The route planning and scheduling of instant delivery need to balance cost and customer satisfaction and consider the impact of traffic conditions on the distribution process. In this paper, we propose a vehicle routing problem model considering two types of customer time windows under time-dependent road networks and design a memetic algorithm combined with genetic algorithm and variable neighborhood search to solve the problem. By comparing the results of the different time periods and conducting sensitivity analysis for the two types of customer time windows, the effectiveness of the model and algorithm is verified. [ABSTRACT FROM AUTHOR]

In order to solve the periodic hard real-time tasks with dependencies on multicore processors, the author proposes a low-power task scheduling algorithm for multicore processor systems based on the genetic algorithm. This method first uses the RDAG algorithm to separate the tasks and then takes the lowest power consumption as the principle; a genetic algorithm is used to determine the task mapping. Experimental results show that based on the power consumption model of Intel PXA270, several random task sets are used for simulation experiments, which shows that this method saves 20% to 30% of the energy consumption compared with the existing methods. This method effectively shortens the completion time of tasks, improves the utilization efficiency of multicore system resources, improves the parallel computing capability of multicore systems, reduces the average response time of tasks, and improves the throughput and resource utilization of multicore systems. [ABSTRACT FROM AUTHOR]

In this study, the fuzzy comprehensive evaluation model is used to evaluate the characteristics of college students' entrepreneurial psychology, and a prediction model of college students' entrepreneurial psychology characteristics is established, which is simulated by Matlab to achieve good validity. Based on the research on the characteristics of college students' entrepreneurial psychology, this study proposes a design method of indicators and parameters for evaluating the characteristics of college students' entrepreneurial psychology. In this study, the genetic algorithm is used to optimize the BP neural network. The optimized neural network greatly improves the global search and local search capabilities. The performance of the model is tested through simulation tests. Through the simulation comparison test between the improved model and the standard model, the results show that the model can predict the entrepreneurial psychological characteristics of college students. By comparing the improved BP neural network algorithm with the original algorithm simulation experiment, the improved BP neural network improves the sensitivity by 20%, the specificity by 5%, and the accuracy by 8%. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel multipath cluster-assisted single station localization method based on a genetic algorithm-based improved salp swarm algorithm (SSA-GA) to improve localization accuracy in an outdoor non-line-of-sight (NLOS) propagation environment. The scattering area model is presented which scatterers are considered Gaussian distribution for outdoor NLOS environments. The geometrical properties of propagation paths, such as angle of arrival and time of arrival, are jointly utilized to construct pseudoscatterer distribution. In order to filter the interference scatterers distributed outside the scattering region, the Gaussian kernel-based algorithm is developed. Furthermore, SSA-GA is proposed to solve the positioning objective functions constructed by pseudoscatterers clustering accurately. Results confirm the practicability of our newly proposed method, and the positioning error is less than 5% in outdoor NLOS propagation environment. [ABSTRACT FROM AUTHOR]

In order to effectively solve the problem of relatively large errors in individual positioning strategies in indoor environments, this paper applies the genetic optimization neural network algorithm to indoor location based on multi-source information fusion. The range of the geomagnetic fitness is constrained based on the results obtained by using the wireless WiFi positioning for combination and matching, which can reduce the value of the matching error effectively. Subsequently, the global optimal value of the indoor network is calculated based on the genetic algorithm, which can optimize the initial value and threshold of the neural network after genetic optimization so as to improve the accuracy of the network to the greatest extent possible while accelerating the convergence speed at the same time. After the optimization processing is completed, fusion training can be performed on the coordinates of the actual positions based on the obtained combination positioning situation and the predicted positioning result in the indoor network. Finally, the optimal positioning result can be obtained accordingly. Through the analysis of practical cases, it can be known that the mean square error predicted based on the genetic optimization neural network calculated by using the genetic algorithm can be effectively reduced by 76%, and the accuracy of the fusion positioning can be increased by 48% on average compared with the accuracy of a single positioning strategy. Hence, the method put forward in this paper has effectively improved the positioning accuracy, which suggests that its positioning performance is superior. [ABSTRACT FROM AUTHOR]

An ODL centralized control strategy is designed to study the problem of heavy load in the power communication network, in which the machine learning method is introduced. SDN technology is used to establish SDN cluster control structure, and different algorithms, such as genetic algorithm, are utilized to optimize resource scheduling. The results show that the improved algorithm obtains the shortest link path through 28 iterations. At the same time, AHP is used to switch the network spectrum. Moreover, the application effect of the control strategy is simulated and analyzed, and its effect on network communication application is verified. [ABSTRACT FROM AUTHOR]

Finding the location of sensors in wireless sensor networks (WSNs) is a major test, particularly in a wide region. A salient clustering approach is laid out to achieve better performance in such a network using an evolutional algorithm. This paper developed a clustered network called neighborhood grid cluster which has a node assuming the part of a cluster center focused in every grid. Grid-based clustering is less difficult and possesses a lot of benefits compared to other clustering techniques. Besides, we proposed a localization algorithm that centers around assessing the target area by considering the least estimated distance embedded with the genetic algorithm. Performance standards incorporate the energy representation, connectivity stratagem, and distance measure as fitness functions that assess our localization problem to demonstrate its viability. Simulation results confirm that our approach further improves localization accuracy, energy utilization, node lifetime, and localization coverage. [ABSTRACT FROM AUTHOR]

This paper demonstrates an improved version of the Salp Swarm Algorithm (SSA) to solve the problems of slow convergence and local minima of the original version. In the population initialization of this scheme, ten chaotic searches with dynamic inertia coefficients are introduced to increase the diversity so that the probability of being trapped in local minima is reduced. Genetic algorithms are then applied to improve the global search ability and convergence speed. The experiments with 12 test functions show that the improved version achieves better accuracy and convergence speed over the original SSA. In the test with robot path planning problem, the proposed algorithm shows improved performance in the average number of iterations, path length, and average number of turns by 69.2%, 19.1%, and 43%, respectively, compared with the original SSA. [ABSTRACT FROM AUTHOR]

Loss of selection pressure in the presence of many objectives is one of the pertinent problems in evolutionary optimization. Therefore, it is difficult for evolutionary algorithms to find the best-fitting candidate solutions for the final Pareto optimal front representing a multi-objective optimization problem, particularly when the solution space changes with time. In this study, we propose a multi-objective algorithm called enhanced dynamic non-dominated sorting genetic algorithm III (E-dyNSGA-III). This evolutionary algorithm is an improvement of the earlier proposed dyNSGA-III, which used principal component analysis and Euclidean distance to maintain selection pressure and integrity of the final Pareto optimal front. E-dyNSGA-III proposes a strategy to select a group of super-performing mutated candidates to improve the selection pressure at high dimensions and with changing time. This strategy is based on an earlier proposed approach on the use of mutated candidates, which are randomly chosen from the mutation and crossover stages of the original NSGA-II algorithm. In our proposed approach, these mutated candidates are used to improve the diversity of the solution space when the rate of change in the objective function space increases with respect to time. The improved algorithm is tested on RPOOT problems and a real-world hydrothermal model, and the results show that the approach is promising. [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]

The multidepot capacitated arc routing problem (CARP) is investigated with the hybrid optimization algorithm of the Dijkstra algorithm and genetic algorithm. The complex multidepot CARP is transformed into multiple single depot CARP by systematic clustering analysis. After completing the system clustering, the Dijkstra algorithm is used to adjust the boundary arc locally and merge it to a reasonable depot, while in the genetic algorithm, the structure of the chromosome is reset to use the path as the way of real coding, and the elite selection is used to decode to obtain the optimal path optimization scheme. Finally, Lanzhou road network data as experimental data, through Matlab to achieve the practicability of the algorithm in sprinkler applications. The results show that the improved genetic algorithm can successfully solve the multi-segment CARP with a certain road network scale, ensuring the correctness and feasibility of the algorithm. In addition, the efficiency of the algorithm in the later iteration is basically controlled at about 0.5 seconds, indicating that the efficiency of the algorithm is worth identifying. [ABSTRACT FROM AUTHOR]

With the gradual expansion of college scale, the professional categories in colleges and universities are becoming more and more complete, and the volume of courses is becoming more and more huge. In the meantime, the number of students is growing by leaps and bounds, and the teaching resources are subject to more and more complicated teaching tasks. The workload and the difficulty of scheduling in teaching management are also on the rise year by year. This paper proposes a design of a college scheduling algorithm based on an improved genetic ant colony hybrid optimization algorithm. Firstly, the fitness-enhanced elimination law is proposed to improve the selection process of traditional genetic algorithms. Subsequently, the gene infection crossover method is proposed to ensure the increase of the average fitness value in the evolutionary process. Next, the unnecessary replication operation in the traditional genetic algorithm is removed to enhance the operation speed of the algorithm. Finally, the parallel mechanism of fuzzy adaptive is introduced to improve the convergence and stability of the algorithm. For the ant colony optimization algorithm, a nonuniform pheromone distribution is used according to the position of the current raster relative to the starting point, which makes the initial pheromone concentration of the dominant raster higher and avoids blind search by ants. The ant movement rules are redefined by the directional neighborhood expansion strategy to further shorten the path. The experimental results indicate that the hybrid optimization algorithm outperforms other algorithms in terms of performance in terms of scheduling success and scheduling time, and it can be applied in practical scheduling because of the high quality of courses schedule. [ABSTRACT FROM AUTHOR]

Traditional residential lighting systems have the problem of high energy consumption. Based on artificial neural network (ANN), combined with particle swarm optimization algorithm, and genetic algorithm to optimize the initial weights and thresholds, an improved ANN prediction model for residential energy-saving lighting is proposed, and an actual residential lighting project is taken as an example to verify it. The results show that the proposed method can quickly predict the number of residential lighting lamps under the premise of meeting the standard illumination of residential lighting. The prediction accuracy can reach 98.45%, which has the characteristics of high prediction accuracy and small error. Compared with the ANN model and ANFIS model, the average relative error of the proposed prediction model is reduced by 2.29% and 0.87%, respectively, which has certain effectiveness and superiority. It provides a new idea for residential energy-saving lighting. [ABSTRACT FROM AUTHOR]

This study exploits a novel enhanced genetic neural network algorithm with link switches (EGA-NNLS) to model the professional university course evaluating system. Various indices should be employed to evaluate the learning effect of a professional course comprehensively and objectively, and the traditional artificial evaluation methods cannot achieve this goal. The presented data-driven modeling method, EGA-NNLS, combines a neural network with link switches (NN-LS) with an enhanced genetic algorithm (EGA) and the Levenberg–Marquardt (LM) algorithm. It employs an optimized network structure combined with EGA and NN-LS to learn the relationships between the system's input and output from historical data and uses the network's gradient information via the LM algorithm. Compared with the traditional backpropagation neural network (BPNN), EGA-NNLS achieves a faster convergence speed and higher evaluation precision. In order to verify the efficiency of EGA-NNLS, it is applied to a collection of experimental data for modeling the professional university course evaluating system. [ABSTRACT FROM AUTHOR]

Three aspects of the system's online resource distribution and application are built around subject, object, and intermediary resources. The invention relates to a method for allocating resources based on the random forest algorithm. The resource allocation process entails the following steps: constructing a mathematical model of the resource allocation process, defining a mathematical model of the resource allocation process for the target object, and designing the cost function. The training data set for random forest is constructed using the classification concept. It is based on the mathematical model of resource allocation and cost function. Generation of random forests and prediction of target objects are based on historical data. Resource allocation steps are based on predictive structure. The invention provides a resource allocation method that satisfies task completion degree constraints and includes a resource allocation algorithm based on random forest with a high probability of finding an optimal solution. It also addresses the issue that intelligent optimization algorithms such as genetic algorithms are prone to fall into local optimum. [ABSTRACT FROM AUTHOR]

In order to make key decisions more conveniently according to the massive data information obtained, a spatial data mining technology based on a genetic algorithm is proposed, which is combined with the k-means algorithm. The immune principle and adaptive genetic algorithm are introduced to optimize the traditional genetic algorithm, and the K-means, GK, and IGK algorithms are compared and analyzed. The results show that, in two different datasets, the objective functions obtained by the K-means algorithm are 94.05822 and 4.10373 × 10 6 , respectively, while the objective functions obtained by the GK and IGK algorithms are 89.8619 and 3.9088 × 10 6 , respectively. The difference between the three algorithms can also be reflected in the data comparison of the number of iterations. The number of iterations required for k-means to reach the optimal solution is 8.21 and 8.4, respectively, which is the most among the three algorithms, while the number of iterations required for IGK to reach the optimal solution is 5.84 and 4.9, respectively, which is the least. Although the time required for K-means is short, by comparison, the IGK algorithm we use can get the optimal solution in relatively less time. [ABSTRACT FROM AUTHOR]

The purpose is to effectively solve the problems of high time cost, low detection accuracy, and difficult standard training samples in video processing. Based on previous investigations, football game videos are taken as research objects, and their shots are segmented to extract the keyframes. The football game videos are divided into different semantic shots using the semantic annotation method. The key events and data in the football videos are analyzed and processed using a combination of artificial rules and a genetic algorithm. Finally, the performance of the proposed model is evaluated and analyzed by using concrete example videos as data sets. Results demonstrate that adding simple artificial rules based on the classic semantic annotation algorithms can save a lot of time and costs while ensuring accuracy. The target events can be extracted and located initially using a unique lens. The model constructed by the genetic algorithm can provide higher accuracy when the training samples are insufficient. The recall and precision of events using the text detection method can reach 96.62% and 98.81%, respectively. Therefore, the proposed model has high video recognition accuracy, which can provide certain research ideas and practical experience for extracting and processing affective information in subsequent videos. [ABSTRACT FROM AUTHOR]

After the occurrence of major sudden disasters, the dispatching and distribution of disaster relief materials are particularly important, but in the process of distribution, there may be excessive distribution of similar emergency materials, unbalanced distribution volume of relief materials in different disaster-affected points, high distribution cost, and low effective distribution rate. In order to solve the above problems, based on the application of big data, this paper proposes a three-level network postdisaster material scheduling and distribution model and an improved NSGA-II algorithm. The model takes the loss degree of the disaster area and the dynamic change rate of the demand for postdisaster relief materials as the constraints, takes the demand prediction of postdisaster relief materials, the optimization of distribution path, distribution nodes, and the satisfaction of victims as the objectives, and designs the sample average approximation method and the improved NSGA-II algorithm. In order to verify the effectiveness of the proposed model and strategy, through the comparative experiment of NSGA and PSO, it can be seen from the experimental results that the three-level network allocation model and the improved NSGA-II algorithm (nondominated sorting genetic algorithm II) proposed in this paper can not only solve the existing postdisaster relief material allocation and scheduling problem but also reduce the space-time complexity of the problem. [ABSTRACT FROM AUTHOR]

The clustering algorithms play a crucial role for energy saving solutions in mobile opportunistic networks. If the selection of cluster head is made appropriately, then the energy can be consumed optimally. The existing clustering algorithms do not consider the optimal selection of the cluster head resulting in low survival rates and high energy consumption rates in nodes. The adaptive clustering is required in Industrial Internet of Things (IIoT) based sophisticated networks where seamless connectivity is imperative for rapid communication. In order to meet this research gap, an adaptive clustering algorithm for mobile opportunistic networks is proposed within military bases that uses a heuristic algorithm (GA) for adaptive clustering. An analysis of the opportunity network at the connected military base is carried out and the mobile opportunity model is constructed using the adaptive clustering for the similar traffic. In a mobile machine network, the next hop node is determined by the node clustering principle. A LEACH clustering protocol enables communication between cluster heads and base stations based on single-hop and multihop cluster nodes. In order to perform adaptive clustering of mobile network nodes based on network partitioning and scheduling of clusters, genetic algorithms are used. The proposed approach can be applied to the IIoT systems in places where adaptive clustering is required to optimize energy consumption, to reduce latency rates, and to enhance the throughput of mobile networks. The experimental findings suggest that the proposed adaptive strategy is capable of optimizing energy consumption rates, reducing network latency, and boosting efficiency by increasing throughput in mobile opportunistic networks. [ABSTRACT FROM AUTHOR]

Aiming at the shortcomings of current music recommendation algorithms, such as low accuracy and poor timeliness, a personalized hybrid recommendation algorithm incorporating genetic features is proposed. The user-based collaborative filtering (UserCF) algorithm analyzes the degree of users' preference for music genes. The improved neural matrix decomposition collaborative filtering (B-NCF) algorithm calculates the correlation between similar users and constructs the adjacency relationship between users. The results of the two algorithms are fused by using a weighted hybrid approach to generate the recommendation list. Finally, the hybrid recommendation model is built on the Spark platform. The paper's traditional and hybrid recommendation algorithms are validated using the Yahoo Music dataset. The experimental results show that the advantages of the algorithm in this paper are more significant under the MAE and F1-measure indexes, and the recommendation accuracy and precision have been greatly improved; the hybrid algorithm can ensure the diversity of the recommended contents, the recommendation hit rate is higher, and the timeliness meets the demand of personalized music recommendation. [ABSTRACT FROM AUTHOR]

The performance of voltage stability indices in the multiobjective optimal power flow of modern power systems is presented in this work. Six indices: the Voltage Collapse Proximity Index (VCPI), Line Voltage Stability Index (LVSI), Line Stability Index (Lmn), Fast Voltage Stability Index (FVSI), Line Stability Factor (LQP), and Novel Line Stability Index (NLSI) were considered as case studies on a modified IEEE 30-bus consisting of thermal, wind, solar and hybrid wind-hydro generators. A multiobjective evaluation using the multiobjective mayfly algorithm (MOMA) was performed in two operational scenarios: normal and contingency conditions, using the MATLAB–MATPOWER toolbox. Fuzzy Decision-Making technique was used to determine the best compromise solutions for each Pareto front. To evaluate the computational efficiency of the case studies, a preference selection index was used. The results indicate that VCPI and NLSI yielded the best-optimized system performance in minimizing generation costs, transmission loss reduction, and simulation time for normal and contingency conditions. The best-case studies also promoted the most scheduled reactive power generation from renewable energy sources (RES). On average, the VCPI index contributed the highest penetration level from RES (13.40%), while the Lmn index had the lowest. Overall, VCPI and Lmn index provided the best and worst average performance in both operating scenarios, respectively. Also, the MOMA algorithm demonstrated superior performance against the multiobjective harris hawks algorithm (MHHO), multiobjective Jaya algorithm (MOJAYA), multiobjective particle swarm algorithm (MOPSO), and nondominated sorting genetic algorithm III (NSGA-III) algorithms. In all, the proposed approach yields the lowest system cost and loss compared to other methods. [ABSTRACT FROM AUTHOR]

In order to explore a quantitative and multiobjective optimization method of land use spatial allocation, this paper proposes a multiobjective algorithm for urban land spatial layout optimization. In this paper, the optimal multiobjective particle swarm optimization (MSO) algorithm is used to construct the optimal land use allocation model, and the variation characteristics of the optimized land use allocation scheme in quantity structure and spatial layout are analyzed. The results show that the total running time of the MSO model and the ordinary genetic algorithm spatial optimal allocation model is 8.57 h and 3.31 h, respectively, and the running efficiency of the mosolua model is 61.38% higher than that of the ordinary genetic algorithm spatial optimal allocation model. The configuration was optimized by using the model of land use spatial pattern from the plaque compactness, adjacency, aggregation degree, environmental compatibility, and the overall degree of resource-saving and environmental friendliness than the ordinary genetic algorithm model of optimal configuration results, and the model of overall fitness model compared with the ordinary genetic algorithm improved by 12.57%. [ABSTRACT FROM AUTHOR]

Proportional-integral-derivative (PID) controllers are extensively used in engineering practices for their simple structures, robustness to model errors, and easy operations. At present, there is a great variety of PID controllers. Companies have developed intelligent regulators with functions for automatically tuning PID parameters. For present PID controllers, strategies such as intelligence, self-adaptation, and self-correction are extended to transmission PID. PID controllers and corresponding improved ones are utilized in 90% of industrial control processes. In this paper, PID control algorithms are summarized. This paper focuses on advanced control strategies such as PID control, predictive PID control, adaptive PID control, fuzzy PID control, neural network PID control, expert intelligent PID control, PID control based on genetic algorithms, and PID control based on ant colony algorithms. Besides, these kinds of algorithms are compared, and prospects of PID algorithms are forecast at the end of this paper. [ABSTRACT FROM AUTHOR]

In the current situation of university education in China, there are some problems that need to be solved urgently in college Chinese teaching in China, which seriously restrict the realization and implementation of college Chinese teaching objectives. The emergence and development of cloud computing technology can integrate different information media, and through the integration of traditional text, pictures, videos, and other resource media, it can be presented in a clearer and more vivid way. In this paper, a cloud computing resource scheduling model is established for the realization of the platform for the development and utilization of university Chinese cloud computing curriculum resources. The multi-QoS (Quality of Service) objective constraint problem is transformed into a single objective constraint solving problem. The improved GA (genetic algorithm) is used to solve the single objective constraint problem, and the square of the objective function is used as a fitness function, and a better resource allocation strategy is obtained. Experimental results show that the allocation time of the algorithm proposed in this paper is greatly reduced, and the QoS guarantee ability of cloud computing service providers is effectively improved. It has certain reference value for the further research of cloud computing technology in the development and utilization of college Chinese curriculum resources. [ABSTRACT FROM AUTHOR]

Due to the wide application of cognitive wireless network, the network structure is becoming more and more complex. It is difficult to establish the corresponding mathematical model to simulate the high complexity network environment. The algorithm based on recurrent neural network in deep reinforcement learning can effectively solve this problem. In addition, with the rise of deep learning in recent years, the combination of reinforcement learning and deep learning shows excellent ability in dealing with complex problems and data operation. This paper is aimed at studying dynamic spectrum allocation based on cyclic neural network. This paper briefly introduces MATLAB, sets up the network environment of algorithm simulation, then analyzes the overall performance of the improved genetic algorithm, and explores the influence of genetic algorithm-related parameters and network environment-related parameters on the performance of the algorithm. The results show the improved genetic algorithm. The network efficiency can be improved by about 2%, but the spectrum switching frequency can be reduced by 69%. When the number of primary users in the network is large, the network benefit of improving the genetic algorithm is superior to the other two algorithms. In addition, when the crossover probability is 0.6 and 0.1, the fitness value is higher than the crossover probability of 0.9 and 0.5; the interference of authorized users in the network initially has less impact on the secondary user. [ABSTRACT FROM AUTHOR]

Taxi-out time is the main performance index to evaluate the operational efficiency of major airports. Scientifically and accurately predicting the taxi-out time of departure flights is very important to improve the operational efficiency and coordination decision-making ability of airport. Firstly, the quantifiable influence factors of taxi-out time and their correlation is analyzed, including the number of departure flights, the number of arrival flights, the number of flights pushed back in the same period, the taxi-out time by half-hour in average, the taxi distance, and the number of turns, etc. And then a prediction model of departure flights' taxi-out time based on BP is constructed. Because the traditional BP neural network is sensitive to the initial weight and threshold and has poor accuracy and stability, the taxi-out time prediction model of BP neural network optimized by intelligent algorithm is proposed. Genetic algorithm (GA) and sparrow search algorithm (SSA) are used to obtain the optimal weight and threshold of BP neural network, which is verified by the actual operation data of a major airport in central and southern China for two weeks. The results show that ① the taxi-out time is strongly correlated with the airport surface traffic flow, moderately correlated with the average taxi-out time, and weakly correlated with the taxi distance and the number of turns. ② The predicted outcome of the 4-element combination prediction model which considers strong correlation and medium correlation factors is the best. After adding weak correlation factors, the prediction accuracy is reduced. ③ By obtaining the local optimal weight and threshold of neural network, intelligent optimization algorithm can effectively improve the accuracy of departure flights' taxi-out time prediction results. ④ The prediction result of BP neural network optimized based on GA is 1.79% higher than that of MAPE before optimization, MAE is reduced by 7.4 s, and RMSE is reduced by 6.93 s. The prediction result of BP neural network optimized based on SSA is 3.05% higher than that of MAPE before optimization, MAE is reduced by 16.55 s, and RMSE is reduced by 14.31 s. Therefore, Sparrow search algorithm has better optimization effect on the model than genetic algorithm. [ABSTRACT FROM AUTHOR]

This work investigates thermal aeroelastic tailoring of a laminated composite panel with a lamination parameter-based method. Equivalent membrane and bending coefficients of thermal expansions for symmetric laminated panel are derived and represented with lamination parameters using Classical Laminated Plate Theory. The relationship between thermal flutter behavior and lamination parameters is examined. The optimization process is split into two stages. In the first stage, lamination parameters and laminate thicknesses are as design variables to minimize the structure mass, subject to thermal flutter behavior and feasible region constraints of lamination parameters. In the second-stage, instead of using conventional genetic algorithm, the enhanced JAYA method is extended to search the laminate configuration to target the optimal lamination parameters. The effectiveness of the presented method is demonstrated through a thermal aeroelastic tailoring problem. [ABSTRACT FROM AUTHOR]