Search

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 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]

Ship deck arrangement design is about determining the positions and dimensions of arranged objects. This paper presents the mathematical model for the ship deck arrangement optimization problem statement and how the individual's objective and constraint functions are computed. Moreover, an improved multiobjective hybrid genetic algorithm is redesigned to solve this complex nondeterministic problem and generate a set of diverse and rational deck arrangements in the early stage of ship design. An adaptive crossover operator and a novel topological replace operator invoked in this algorithm are described. Finally, the proposed algorithm is tested on a main deck arrangement optimization of an underwater detection ship. In the validation tests, the proposed algorithm is compared to the standard NSGA-II to determine its ability to produce a set of diverse and rational deck arrangements. Subsequently, the performance tests are used to determine the ability of the algorithm to work with the highly constrained arrangement problems and the efficiency of the adaptive crossover and topological replace operators. [ABSTRACT FROM AUTHOR]

Cloud computing provides multiple services such as computational services, data processing, and resource sharing through multiple nodes. These nodes collaborate for all prementioned services in the data center through the head/leader node. This head node is responsible for reliability, higher performance, latency, and deadlock handling and enables the user to access cost-effective computational services. However, the optimal head nodes' selection is a challenging problem due to consideration of resources such as memory, CPU-MIPS, and bandwidth. The existing methods are monolithic, as they select the head nodes without taking the resources of the nodes. Still, there is a need for the candidate node which can be selected as a head node in case of head node failure. Therefore, in this paper, we proposed a technique, i.e., Head Node Selection Algorithm (HNSA), for optimal head node selection from the data center, which is based on the genetic algorithm (GA). In our proposed method, there are three modules, i.e., initial population generation, head node selection, and candidate node selection. In the first module, we generate the initial population by randomly mapping the task on different servers using a scheduling algorithm. After that, we compute the overall cost and the cost of each node based on resources. In the second module, the best optimal nodes are selected as a head node by applying the genetic operations such as crossover, mutation, and fitness function by considering the available resources. In the selected optimal nodes, one node is chosen as a head node and the other is considered as a candidate node. In the third module, the candidate node becomes the head node in the case of head node failure. The proposed method HNSA is compared against the state-of-the-art algorithms such as Bees Life Algorithm (BLA) and Heterogeneous Earliest Finished Time (HEFT). The simulation analysis shows that the proposed HNSA technique performs better in terms of execution time, memory utilization, service level sgreement (SLA) violation, and energy consumption. [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]

In this paper, a modified model of Nondominated Sorting Genetic Algorithm 2 (NSGA-II), which is one of the Multiobjective Evolutionary Algorithms, is proposed. This algorithm is a new model designed to make a trade-off between minimizing the cost of preventive maintenance (PM) and minimizing the time taken to perform this maintenance for a series-parallel system. In this model, the limitations of labor and equipment of the maintenance team and the effects of maintenance issues on manufacturing problems are also considered. In the mathematical model, finding the appropriate objective functions for the maintenance scheduling problem requires all maintenance costs and failure rates to be integrated. Additionally, the effects of production interruption during preventive maintenance are added to objective functions. Furthermore, to make a better performance compared with a regular NSGA-II algorithm, we proposed a modified algorithm with a repository to keep more unacceptable solutions. These solutions can be modified and changed with the proposed mutation algorithm to acceptable solutions. In this algorithm, modified operators, such as simulated binary crossover and polynomial mutation, will improve the algorithm to generate convergence and uniformly distributed solutions with more diverse solutions. Finally, by comparing the experimental solutions with the solutions of two Strength Pareto Evolutionary Algorithm 2 (SPEA2) and regular NSGA-II, MNSGA-II generates more efficient and uniform solutions than the other two algorithms. [ABSTRACT FROM AUTHOR]