Search

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]

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]

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]

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]

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]

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]

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]

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]

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]

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]

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]

In order to protect the copyright of audio media in cyberspace, a robust and blind audio watermarking scheme based on the genetic algorithm (GA) is proposed in a dual transform domain. A formula for calculating the embedding depth is developed, and two embedding depths with different values are used to represent the "1" and "0" states of the binary watermark, respectively. In the extracting process, the embedding depth in each audio fragment will be calculated and compared with the average embedding depth to determine the watermark bit by bit, so this scheme can blindly extract the watermark without the original audio. GA will be applied to optimize the algorithm parameters for meeting the performance requirements in different applications. Besides, the embedding rule is further optimized to enhance the transparency based on the principle of minimal modification to the audio. Experimental results prove that the payload capacity reaches 172.27 bps, the bit error rate (BER) is 0.1% under the premise that its transparency is higher than 25 dB, and its robustness is strong against many attacks. Significantly, this scheme can adaptively select the algorithm parameters to satisfy the specific performance requirements. [ABSTRACT FROM AUTHOR]