7 research outputs found
Improved Quantum Genetic Algorithm in Application of Scheduling Engineering Personnel
To verify the availability of the improved quantum genetic algorithm in solving the scheduling engineering personnel problem, the following work has been carried out: the characteristics of the scheduling engineering personnel problem are analyzed, the quantum encoding method is proposed, and an improved quantum genetic algorithm is applied to address the issue. Taking the low efficiency and the bad performance of the conventional quantum genetic algorithm into account, a universal improved quantum genetic algorithm is introduced to solve the scheduling engineering personnel problem. Finally, the examples are applied to verify the effectiveness and superiority of the improved quantum genetic algorithm and the rationality of the encoding method
AliCG: Fine-grained and Evolvable Conceptual Graph Construction for Semantic Search at Alibaba
Conceptual graphs, which is a particular type of Knowledge Graphs, play an
essential role in semantic search. Prior conceptual graph construction
approaches typically extract high-frequent, coarse-grained, and time-invariant
concepts from formal texts. In real applications, however, it is necessary to
extract less-frequent, fine-grained, and time-varying conceptual knowledge and
build taxonomy in an evolving manner. In this paper, we introduce an approach
to implementing and deploying the conceptual graph at Alibaba. Specifically, We
propose a framework called AliCG which is capable of a) extracting fine-grained
concepts by a novel bootstrapping with alignment consensus approach, b) mining
long-tail concepts with a novel low-resource phrase mining approach, c)
updating the graph dynamically via a concept distribution estimation method
based on implicit and explicit user behaviors. We have deployed the framework
at Alibaba UC Browser. Extensive offline evaluation as well as online A/B
testing demonstrate the efficacy of our approach.Comment: Accepted by KDD 2021 (Applied Data Science Track
The Improvement of Quantum Genetic Algorithm and Its Application on Function Optimization
To accelerate the evolutionary process and increase the probability to find the optimal solution, the following methods are proposed to improve the conventional quantum genetic algorithm: an improved method to determine the rotating angle, the self-adaptive rotating angle strategy, adding the quantum mutation operation and quantum disaster operation. The efficiency and accuracy to search the optimal solution of the algorithm are greatly improved. Simulation test shows that the improved quantum genetic algorithm is more effective than the conventional quantum genetic algorithm to solve some optimization problems
Model and Algorithm of BP Neural Network Based on Expanded Multichain Quantum Optimization
The model and algorithm of BP neural network optimized by expanded multichain quantum optimization algorithm with super parallel and ultra-high speed are proposed based on the analysis of the research status quo and defects of BP neural network to overcome the defects of overfitting, the random initial weights, and the oscillation of the fitting and generalization ability along with subtle changes of the network parameters. The method optimizes the structure of the neural network effectively and can overcome a series of problems existing in the BP neural network optimized by basic genetic algorithm such as slow convergence speed, premature convergence, and bad computational stability. The performance of the BP neural network controller is further improved. The simulation experimental results show that the model is with good stability, high precision of the extracted parameters, and good real-time performance and adaptability in the actual parameter extraction
Multidistribution Center Location Based on Real-Parameter Quantum Evolutionary Clustering Algorithm
To determine the multidistribution center location and the distribution scope of the distribution center with high efficiency, the real-parameter quantum-inspired evolutionary clustering algorithm (RQECA) is proposed. RQECA is applied to choose multidistribution center location on the basis of the conventional fuzzy C-means clustering algorithm (FCM). The combination of the real-parameter quantum-inspired evolutionary algorithm (RQIEA) and FCM can overcome the local search defect of FCM and make the optimization result independent of the choice of initial values. The comparison of FCM, clustering based on simulated annealing genetic algorithm (CSAGA), and RQECA indicates that RQECA has the same good convergence as CSAGA, but the search efficiency of RQECA is better than that of CSAGA. Therefore, RQECA is more efficient to solve the multidistribution center location problem
Real-Coded Quantum-Inspired Genetic Algorithm-Based BP Neural Network Algorithm
The method that the real-coded quantum-inspired genetic algorithm (RQGA) used to optimize the weights and threshold of BP neural network is proposed to overcome the defect that the gradient descent method makes the algorithm easily fall into local optimal value in the learning process. Quantum genetic algorithm (QGA) is with good directional global optimization ability, but the conventional QGA is based on binary coding; the speed of calculation is reduced by the coding and decoding processes. So, RQGA is introduced to explore the search space, and the improved varied learning rate is adopted to train the BP neural network. Simulation test shows that the proposed algorithm is effective to rapidly converge to the solution conformed to constraint conditions