Search

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

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]

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]

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]

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]

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]

With the rapid development of artificial intelligence, handicraft design has developed from artificial design to artificial intelligence design. Traditional handicraft design has the problems of long time consumption and low output, so it is necessary to improve the process technology. Artificial intelligence technology can provide optimized design steps in handicraft design and improve design efficiency and process level. Handicrafts are regarded as important social products and exist in people's daily life. In the current society, many people do handicrafts and there are major exhibitions. Furthermore, the display of handicrafts is also very grand and shocking. In the design of handicrafts, the traditional design method cannot completely keep up with the production speed and efficiency of handicrafts. Therefore, this paper adopts the fusion multi-intelligent decision algorithm of multi-node branch design in the design method of handicraft. The algorithm model combination is used to analyze and design the layout of the handicraft, which speeds up the design efficiency and production of the handicraft. In this paper, two intelligent algorithms will be used for fusion; they are genetic algorithm and GA-PSO fusion algorithm obtained by particle swarm optimization and they are embedded in handicraft design method for application through mathematical model construction and function construction. After comparing the performance parameter index data of three intelligent algorithms and GA-PSO fusion algorithm, it is obtained that GA-PSO fusion algorithm is 97% correct and has 82% readability, 72% robustness, and 61% structure, making it have better important indicators. Four algorithms optimize each design problem in all aspects of handicraft design at present. Design efficiency, image distribution rate, image optimization degree, and image clarity are compared by simulation experiments. Compared with three intelligent algorithms, traditional design methods, and manual design methods, GA-PSO fusion algorithm can effectively improve the design method and design effect of handicrafts with 92.1% design efficiency, 82.7% image distribution rate, 94.3% image optimization degree, and 84% layout void rate. Finally, the space complexity experiment of four algorithms shows that GA-PSO algorithm can achieve 9.73 dispersion with 11.42 space complexities, which makes the dimension reduction relatively stable, and the algorithm can maintain stability in the design and application of handicrafts. [ABSTRACT FROM AUTHOR]

Aiming at the problems existing in the traditional teaching mode, this paper intelligently optimizes English teaching courses by using multidirectional mutation genetic algorithm and its optimization neural network method. Firstly, this paper gives the framework of intelligent English course optimization system based on multidirectional mutation genetic BP neural network and analyses the local optimization problems existing in the traditional BP algorithm. A BP neural network optimization algorithm based on multidirectional mutation genetic algorithm (MMGA-BP) is presented. Then, the multidirectional mutation genetic BPNN algorithm is applied to the intelligent optimization of English teaching courses. The simulation shows that the multidirectional mutation genetic BP neural network algorithm can solve the local optimization problem of traditional BP neural network. Finally, a control group and an experimental group are set up to verify the role of multidirectional mutation genetic algorithm and its optimization neural network in the intelligent optimization system of English teaching courses through the combination of summative and formative teaching evaluations. The data show that MMGA-BP algorithm can significantly improve the scores of academic students in English courses and has better teaching performance. The effect of vocabulary teaching under the guidance of MMGA-BP optimization theory is very significant, which plays a certain role in the intelligent curriculum optimization of the experimental class. [ABSTRACT FROM AUTHOR]

Contributions of measurements for detecting drowsy driving are determined by calculation parameters, which are directly related to the accuracy of drowsiness detection. The previous studies utilized the same Unified Calculation Parameters (UCPs) to compute each driver's measurements. However, since each driver has unique driving behavior characteristics, namely, driver fingerprinting, Individual Drivers' Best Calculation Parameters (IDBCPs) making measurements more discriminative for drowsiness are various. Regardless of the difference in driver fingerprinting among the drivers being tested, using UCPs instead of IDBCPs to compute measurements will limit the drowsiness-detection performance of the measurements and reduce drowsiness-detection accuracies at the individual driver level. Thus, this paper proposed a model to optimize calculation parameters of individual driver's measurements and to extract individual driver's measurements that effectively distinguish drowsy driving. Through real vehicle experiments, we collected naturalistic driving data and subjective drowsy levels evaluated by the Karolinska Sleepiness Scale. Eight nonintrusive drowsiness-related measurements were calculated by double-layer sliding time windows. In the proposed model, we firstly applied the Wilcoxon test to analyze differences between measurements of the awake state and drowsy state, and constructed the fitness function reflecting the relationship between the calculation parameters and measurement's drowsiness-detection performance. Secondly, the genetic algorithms were used to optimize fitness functions to obtain measured IDBCPs. Finally, we selected measurements calculated by IDBCPs that can distinguish drowsy driving to constitute individual drivers' optimal drowsiness-detection measurement set. To verify the advantages of IDBCPs, the measurements calculated by UCPs and IDBCPs were, respectively, used to build driver-specific drowsiness-detection models: DF_U and DF_I based on the Fisher discriminant algorithm. The mean drowsiness-detection accuracies of DF_U and DF_I were, respectively, 85.25% and 91.06%. It indicated that IDBCPs could enhance measurements' drowsiness-detection performance and improve the drowsiness-detection accuracies. This paper contributed to the establishment of personalized drowsiness-detection models considering driver fingerprinting differences. [ABSTRACT FROM AUTHOR]

In recent years, most of the communication places are using business English manual simultaneous interpretation or electronic equipment translation. In the context of diverse cultures, the way English is used and its grammar vary from country to country. In the face of this situation, how to optimize business English translation technology and improve the accuracy of business communication content is one of the research contents of scholars all over the world. This paper first introduces the purpose of business English translation and the gap between business English translation and general English translation. Secondly, a genetic algorithm is used to optimize the structure of the BP neural network, and the combination of the two improves the ability of translation search. This paper compares the influence of the traditional BP algorithm and the BP algorithm optimized by genetic algorithm on the construction of a business English translation model. The results show that BP neural network optimized by the genetic algorithm can improve the speed of business English text translation, reduce the impact of semantic errors on the accuracy of the translation model, and improve the efficiency of translation. [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]

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]

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]

Dynamic bus scheduling refers to adjusting the departure time according to the latest time-varying information or adjusting bus speed in the process of operation. These control strategies can prevent bus bunching and alleviate traffic pressure. The paper studies the multiline bus dynamic scheduling with consideration of departure time and speed meanwhile. The hyperheuristic algorithm is proposed, and low-level heuristics (LLH) operators are designed. The simulation experiment is performed for the passenger flow distribution of different strengths and types of different scenarios. By comparing the experimental results of genetic algorithm (GA) and hyperheuristic algorithm in solving different scenarios, the results show that in smooth, increasing, decreasing, and multiconvex passenger flow mode, the performance of the hyperheuristic algorithm is higher than that of GA. The promotion rate reaches 18∼28%, and especially the average value of the hyperheuristic algorithm designed under multiconvex passenger flow is up to 28.62%, significantly reducing passengers' waiting time. By comparing the stability of the three passenger flow modes, the results illustrate that the stability of the hyperheuristic algorithm is lower than that of GA. For the smooth passenger flow mode, the stability of medium and lower density of GA is higher than that of the hyperheuristic algorithm. In comparison, the high-density stability of the hyperheuristic algorithm is better than that of GA. [ABSTRACT FROM AUTHOR]

This paper uses data mining technology to analyze students' English scores. In view of the influence of many factors on students' English performance, the analysis is realized by using the association rule algorithm. The thesis analyzes and applies students' English scores based on association rules and mainly does the following work: (1) at present, the problem of the CARMA algorithm is low operating efficiency. The combination of the genetic algorithm's crossover, mutation, and the CARMA algorithm realizes the fast search of the algorithm. The simulation results show that the operation performance of the algorithm is greatly improved after the crossover and mutation operations in the genetic algorithm are applied to the CARMA algorithm. The simulation results show that the mining accuracy of the improved algorithm is 97.985%, and the mining accuracy before the improvement is 92.221%, indicating that the improved algorithm can improve the accuracy of mining. (2) By comparing the mining time of the improved CARMA algorithm, the traditional CARMA algorithm, the FP-Growth algorithm, and the Apriori algorithm, the results show that when the number is 6,500, the mining efficiency of the improved CARMA algorithm is twice that of the other three algorithms. As the amount of data increases, the effect of improving mining efficiency gradually increases. (3) By using the improved CARMA algorithm to analyze students' English performance, it is found that the quality of student performance is strongly related to the quality of daily homework, and if it is related to the teacher's gender, professional title, etc., it is recommended that schools should pay more attention to homework during the teaching process. [ABSTRACT FROM AUTHOR]

Trains can be optimally spread over the period of the cyclic timetable. By integrating sequencing issue with headway time together, this paper studies the structure optimization of mixed-speed train traffic for a cyclic timetable. Firstly, by taking it as a job-shop problem with sequence-dependent setup times on one machine, in the type of infinite capacity resource with headway (ICR + H), the problem is transformed to alternative graph (AG) and then recast to the mixed-speed train traffic planning (MSTTP) model. For the multiobjective in MSTTP, three indicators are optimized, i.e., heterogeneity, cycle time, and buffer time, which correspond to diversity of train service toward passenger, capacity consumption of rail network, and stability of train operation, respectively. Secondly, the random-key genetic algorithm (RKGA) is proposed to tackle the sequence and headway simultaneously. Finally, RKGA is coded with visual studio C# and the proposed method is validated with a case study. The rail system considered is a line section encompassing a territory of 180 km with 15 mixed-speed trains in each cycle of the timetable. Results indicate the comprehensively balanced train plan for all stakeholders from random variations of train sequence and headway time. Both the quantitative proportion of heterogeneity/homogeneity (e.g., 2.5) about the optimized distribution of the mixed train traffic and the link between train headway time and the sequence for each traffic scenario are found. All the findings can be used to arrange the mixed-speed train traffic more scientifically. [ABSTRACT FROM AUTHOR]

With the development of neural network technology and the rapid growth of China's tourism economic income at this stage, the research on the comprehensive evaluation of tourism resources has gradually emerged. Based on this, this paper studies the neural network comprehensive evaluation model based on multispecies evolutionary genetic algorithm and designs the neural network analysis system of influencing factors of tourism resources based on multispecies evolutionary genetic algorithm. The collection and acquisition of data information are realized from the aspects of resource income status, tourism development investment, and sustainability evaluation in the tourism area. The multispecies evolutionary genetic algorithm is used for comprehensive analysis and evaluation. The algorithm can realize the complex analysis and comprehensive evaluation of the core influencing factors of neural network. Accurate analysis and evaluation were carried out according to the different characteristics of tourism resources and the current situation of tourism income. The results show that the neural network comprehensive evaluation model based on multispecies evolutionary genetic algorithm has the advantages of high practicability, good sorting effect of variable ratio, and good data integration. It can effectively analyze and compare the comprehensive evaluation factors affecting tourism resources in different ratios. [ABSTRACT FROM AUTHOR]

The existing social talent governance algorithms have a number of issues such as slow convergence rate, relatively low data accuracy, recall rate, and low anti-interference. To address these problems, this paper proposes a research on social talent governance algorithm based on genetic algorithm. We discuss the difference between the traditional and the genetic algorithms and determine the implementation process of genetic algorithm. On this basis, the excellent individuals are determined by independent computing fitness, and the initialization population is designed according to the individual similarity threshold. After the population is defined, the roulette and deterministic sampling selection method are integrated to clarify the selection calculation process. Based on the calculation results, we design the crossover operator by segmented single-point crossover between individuals. The mutation operator is designed by segmented mutation of different gene segments according to the calculation results. The results are incorporated into the simulated annealing acceptance probability to conduct simulated annealing for the individuals after the cross-mutation operation and set relevant conditions after the end of the algorithm. We seek the optimal solution of the data within the number of iterations and finally realize the whole process of social talent governance algorithm. The experimental results show that the proposed algorithm has fast convergence rate, high data precision and recall, and has certain feasibility. [ABSTRACT FROM AUTHOR]

Summary: The purpose of this paper is to present a model for optimal placement of distributed generation units and sectionalizing switches (relocation of the existing switches and installation of new ones) to increase distribution network resilience against the threat of transmission system outage. The proposed model is formulated as a multi‐objective optimization problem with the objectives of minimizing investment costs and maximizing load restoration. In this regard, distribution system operation during normal conditions as well as transmission system outages is considered. In addition, the unique characteristics of the real power grid in Khuzestan province in southwestern of Iran are addressed in the proposed model which makes the model applicable to the real networks with similar characteristics in many parts of the Middle East. This grid has two completely different load patterns (in terms of load curve shape and peak load) corresponding to two hot and temperate periods, which causes completely different concerns for the network's operator. The proposed model is solved using multi‐objective genetic algorithm (NSGA‐II), and it is implemented on the 33‐node test system and the results are analyzed. Moreover, it is applied to the 327‐node real‐world test system in Khuzestan province to demonstrate its applicability to large networks. In both cases, the results confirm the effectiveness of the proposed optimization model. [ABSTRACT FROM AUTHOR]

Increased frequency of disasters keeps reminding us of the importance of effective resource distribution in postdisaster. To reduce the suffering of victims, this paper focuses on how to establish an effective emergency logistics system. We first propose a multiobjective optimization model in which the location and allocation decisions are made for a three-level logistics network. Three objectives, deprivation costs, unsatisfied demand costs, and logistics cost, are adopted in the proposed optimization model. Several cardinality and flow balance constraints are considered simultaneously. Then, we design a novel effective IFA-GA algorithm by combining the firefly algorithm and genetic algorithm to solve this complex model effectively. Furthermore, three schemes are proposed to improve the effectiveness of the IFA-GA algorithm. Finally, the numerical results provide several insights on the theory and practice of relief distribution, which also illustrate the validity of the proposed solution algorithm. [ABSTRACT FROM AUTHOR]

Calibrating the microsimulation model is essential to enhance its ability to capture reality. The paper proposes a Bayesian neural network (BNN)-based method to calibrate parameters of microscopic traffic simulators, which reduces repeated running of simulations in the calibration and thus significantly improves the calibration efficiency. We use BNN with probability distributions on the weights to quickly predict the simulation results according to the inputs of the parameters to be calibrated. Based on the BNN model with the best performance, heuristic algorithms (HAs) are performed to seek the optimal values of the parameters to be calibrated with the minimum difference between the predicted results of BNN and the field-measured values. Three HAs are considered, including genetic algorithm (GA), evolutionary strategy (ES), and bat algorithm (BA). A TransModeler case of highway links in Shanghai, China, indicates the validity of the proposed calibration method in terms of error and efficiency. The results demonstrate that the BNN model is able to accurately predict the simulation and adequately capture the uncertainty of the simulation. We also find that the BNN-BA model produces the best calibration efficiency, while the BNN-ES model offers the best performance in calibration accuracy. [ABSTRACT FROM AUTHOR]

A decentralized control strategy can effectively solve the control problem of the large-scale time delayed structures. In this paper, combining the overlapping decentralized control method, linear matrix inequality (LMI) method, and H∞ control algorithm, overlapping decentralized H∞ control approach of the time delayed structures has been established. The feedback gain matrixes of all subsystems are obtained by this method based on genetic algorithm optimization tools and the specific goal of optimization control. The whole vibration control system of the time delayed structures is divided into a series of overlapping subsystems by overlapping decentralized control strategy. The feedback gain matrixes of each subsystem can be obtained by using H∞ control algorithm to calculate each subsystem. The vibration control of a twenty layers' antiseismic steel structure Benchmark model was analyzed with the numerical method. The results show that the proposed method can be applied to control system with time delay. The overlapping decentralized control strategies acquire the similar control effects with that of the centralized control strategy. Moreover, the flexibility of the controller design has been enhanced by using overlapping decentralized control strategies. [ABSTRACT FROM AUTHOR]

Nowadays, with the constant change of public aesthetic standards, a large number of new types and themes of film programs have emerged. For this reason, this paper proposes an improved neural network optimized by mutation ant colony algorithm for automatic acquisition of film labels, which not only overcomes the disadvantages of traditional neural network, such as difficulty in determining weights, slow convergence speed, and easiness to fall into local minimum, but also makes up for the shortcomings faced by using ant colony algorithm alone through the gradient information of quantum genetic algorithm neural network. The results show that the user similarity judgment is added in the process of calculating the user rating deviation between movies, and the neighbor chooses to add the movie tag weight and rating similarity as the basis for the neighbor selection of the target movie in the process of predicting the target movie rating. Experiments show the effectiveness of the algorithm. [ABSTRACT FROM AUTHOR]

One of the top issues in logistics management and related research is to establish an effective distribution system that is adaptive to new retail and capable of lowering the cost of logistics while enhancing consumer satisfaction. Aimed at reversing the weak points of current logistics distribution patterns, a dual-objective bipolar model with optimal logistics cost and consumer satisfaction by restraining distribution time and load is tested in this paper to figure out the proper nodes and vehicle routes. Data from general and front warehouses of PuPu mall, a Fuzhou-based online retail enterprise, are made into a case study. Moreover, the immune algorithm and genetic algorithm are adopted to achieve the model solution. It is found that the immune algorithm is more efficient than the genetic algorithm in searching solutions, thus having better adaptivity and effectiveness, and also that the type of distribution vehicle plays a significant role in determining the total distribution cost. [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]

With the development of society and the promotion of science and technology, English, as the largest universal language in the world, is used by more and more people. In the life around us, there is information in English all the time. However, because the process of manual recognition of English letters is very labor-intensive and inefficient, the demand for computer recognition of English letters is increasing. This paper studies the influence of the parameters of BP neural network and genetic algorithm on the whole network, including the input, output, and number of hidden layer nodes. Finally, it improves and determines the settings and values of the relevant parameters. On this basis, it shows the rationality of the selected parameters through experiments. The results show that only GA-BP neural network and feature data mining algorithm can complete feature extraction and become the main function of feature classification at the same time. After enough initial data sample analysis training, the GA-BP neural network was found to have good data fault tolerance and feature recognition. The experimental results show that the genetic algorithm can find the best weights and thresholds and the weights and thresholds are given to the BP neural network. After training, the recognition of handwritten letters can be realized. Finally, the convergence of the two algorithms is compared through experiments, which shows that the overall performance of the BP neural network algorithm is improved after genetic algorithm optimization. It can be seen that the genetic algorithm has a good effect in improving the BP neural network and this method has a broad prospect in English feature recognition. [ABSTRACT FROM AUTHOR]

The timetabling problem (TTP) and vehicle scheduling problem (VSP) are two indispensable problems in public transit planning process. They used to be solved in sequence; hence, optimality of resulting solutions is compromised. To get better results, some integrated approaches emerge to solve the TTP and VSP as an integrated problem. In the existing integrated approaches, the passenger comfort on bus and the uncertainty in the real world are rarely considered. To provide better service for passengers and enhance the robustness of the schedule to be compiled, we study the integrated optimization of TTP and VSP with uncertainty. In this paper, a novel multiobjective optimization approach with the objectives of minimizing the passenger travel cost, the vehicle scheduling cost, and the incompatible trip-link cost is proposed. Meanwhile, a multiobjective hybrid algorithm, which is a combination of the self-adjust genetic algorithm (SGA), large neighborhood search (LNS) algorithm, and Pareto separation operator (PSO), is applied to solve the integrated optimization problem. The experimental results show that the approach outperforms existing approaches in terms of service level and robustness. [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]

Parameter tuning of PID controller for liquid level control of beer filling machine was studied in this paper, which can meet the demand of accurate controlling in beer production and improve the rapidity under the same conditions. Firstly, an improved genetic algorithm was proposed which has been verified by eight kinds of test functions. Simulation results revealed that, in comparation with other modified particle swarm optimization algorithm and modified genetic algorithm, the algorithm proposed in this work is not only capable to improve the convergence speed and precision under the same experimental conditions but also to improve the probability to converge to the optimal value. Finally, the proposed algorithm was applied to the parameter tuning of the PID controller of beer filling machine for liquid level control. Superior property had been obtained, which implied an effective improvement in the rapidity with the premise of steady-state error exclusion. [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]