Research and Application of a Multi-Field Co-Simulation Data Extraction Method Based on Adaptive Infinitesimal Element

Regarding the spatial profile extraction method of a multi-field co-simulation dataset,different extraction directions,locations,and numbers of profileswill greatly affect the representativeness and integrity of data.In this study,a multi-field co-simulation data extractionmethod based on adaptive infinitesimal elements is proposed.Themultifield co-simulation dataset based on related infinitesimal elements is constructed,and the candidate directions of data profile extraction undergo dimension reduction by principal component analysis to determine the direction of data extraction.Based on the fireworks algorithm,the data profile with optimal representativeness is searched adaptively in different data extraction intervals to realize the adaptive calculation of data extraction micro-step length.The multi-field co-simulation data extraction process based on adaptive microelement is established and applied to the data extraction process of the multi-field co-simulation dataset of the sintering furnace.Compared with traditional data extraction methods for multi-field co-simulation,the approximate model constructed by the data extracted from the proposed method has higher construction efficiency.Meanwhile,the relative maximum absolute error,root mean square error,and coefficient of determination of the approximationmodel are better than those of the approximation model constructed by the data extracted from traditional methods,indicating higher accuracy,it is verified that the proposed method demonstrates sound adaptability and extraction efficiency.

基于Plant Simulation的生产车间仿真优化研究与应用

针对生产车间焊接阶段物料难以齐套引发的工序等待问题,通过使用Plant Simulation仿真软件构建模型,以车间实际生产数据为输入验证仿真模型的可信性,建立方便交互的可视化交互界面,方便模型复用和生产参数的调整.通过仿真模型结合启发式算法优化生产线,保证了生产车间的物料齐套性,缩短了焊接等待时间,提供了一种使用仿真软件进行生产线优化的可行方案.结果表明,所建立的仿真优化模型能够提供高效的排程方案,有效提高了企业生产效率.

基于PreScan/CarSim/Simulink/ROS的路径跟随控制仿真

路径跟随可控制AGV沿着参考轨迹行驶,提高行驶过程中的可行性和稳定性,是智能驾驶核心技术之一。文章主要研究使用Prescan、Carsim、Simulink和ROS系统搭建AGV路径跟随控制模型,运用基于几何模型的Stanley算法来实现路径跟随的联合仿真测试。最后使用树莓派搭建硬件在环的仿真模型,联合仿真验证了Stanley算法的可行性,该方法可快速验证和部署基于ROS系统的路径跟随控制方法,为后续研究奠定技术基础。

A Class of Fast Algorithms in Real-Time Simulation

A class of hybrid algorithms of real-time simulation based on evaluation of non-integerstep right-hand side function are presented in this paper. And some results of the convergence and stability of the algorithms are given. Using the class of algorithms, evaluation for the right-hand side function is needed once in every integration-step. Moreover, comparing with the other methods with the same amount of work, their numerical stability regions are larger and the method errors are smaller, and the numerical experiments show that the algorithms are very effective.

基于Plant Simulation的装配车间仿真优化研究与应用

针对纺机装配车间装配线不平衡的问题,通过使用Plant Simulation仿真软件建立符合纺机装配车间实际情况的仿真模型,以车间实际生产数据为输入验证仿真模型的可信性,建立方便交互的可视化交互界面,方便模型复用和生产参数的调整。通过仿真模型结合启发式算法优化各工位的装配工序,装配线生产节拍缩短10.7%,提供了一种使用仿真软件进行装配线优化的可行方案。

A Class of Parallel Algorithms of Real-TimeNumerical Simulation for Stiff Dynamic System

In this paper a class of real-time parallel modified Rosenbrock methods of numerical simulation is constructed for stiff dynamic systems on a multiprocessor system, and convergence and numerical stability of these methods are discussed. A-stable real-time parallel formula of two-stage third-order and A(α)-stable real-time parallel formula with o ≈ 89.96° of three-stage fourth-order are particularly given. The numerical simulation experiments in parallel environment show that the class of algorithms is efficient and applicable, with greater speedup.

Variational quantum simulation of the quantum critical regime

The quantum critical regime marks a zone in the phase diagram where quantum fluctuation around the critical point plays a significant role at finite temperatures.While it is of great physical interest,simulation of the quantum critical regime can be difficult on a classical computer due to its intrinsic complexity.Herein,we propose a variational approach,which minimizes the variational free energy,to simulate and locate the quantum critical regime on a quantum computer.The variational quantum algorithm adopts an ansatz by performing an unitary operator on a product of a single-qubit mixed state,in which the entropy can be analytically obtained from the initial state,and thus the free energy can be accessed conveniently.With numeral simulation,using the one-dimensional Kitaev model as a demonstration we show that the quantum critical regime can be identified by accurately evaluating the temperature crossover line.Moreover,the dependencies of both the correlation length and the phase coherence time with temperature are evaluated for the thermal states.Our work suggests a practical way as well as a first step for investigating quantum critical systems at finite temperatures on quantum devices with few qubits.

An Improved Multi-Objective Hybrid Genetic-Simulated Annealing Algorithm for AGV Scheduling under Composite Operation Mode

This paper presents an improved hybrid algorithm and a multi-objective model to tackle the scheduling problem of multiple Automated Guided Vehicles(AGVs)under the composite operation mode.The multi-objective model aims to minimize the maximum completion time,the total distance covered by AGVs,and the distance traveled while empty-loaded.The improved hybrid algorithm combines the improved genetic algorithm(GA)and the simulated annealing algorithm(SA)to strengthen the local search ability of the algorithm and improve the stability of the calculation results.Based on the characteristics of the composite operation mode,the authors introduce the combined coding and parallel decoding mode and calculate the fitness function with the grey entropy parallel analysis method to solve the multi-objective problem.The grey entropy parallel analysis method is a combination of the grey correlation analysis method and the entropy weighting method to solve multi-objective solving problems.A task advance evaluation strategy is proposed in the process of crossover and mutation operator to guide the direction of crossover and mutation.The computational experiments results show that the improved hybrid algorithm is better than the GA and the genetic algorithm with task advance evaluation strategy(AEGA)in terms of convergence speed and solution results,and the effectiveness of the multi-objective solution is proved.All three objectives are optimized and the proposed algorithm has an optimization of 7.6%respectively compared with the GA and 3.4%compared with the AEGA in terms of the objective of maximum completion time.

Variational quantum simulation of thermal statistical states on a superconducting quantum processer

Quantum computers promise to solve finite-temperature properties of quantum many-body systems,which is generally challenging for classical computers due to high computational complexities.Here,we report experimental preparations of Gibbs states and excited states of Heisenberg X X and X X Z models by using a 5-qubit programmable superconducting processor.In the experiments,we apply a hybrid quantum–classical algorithm to generate finite temperature states with classical probability models and variational quantum circuits.We reveal that the Hamiltonians can be fully diagonalized with optimized quantum circuits,which enable us to prepare excited states at arbitrary energy density.We demonstrate that the approach has a self-verifying feature and can estimate fundamental thermal observables with a small statistical error.Based on numerical results,we further show that the time complexity of our approach scales polynomially in the number of qubits,revealing its potential in solving large-scale problems.

Integrated classification method of tight sandstone reservoir based on principal component analysise simulated annealing genetic algorithmefuzzy cluster means

In this research,an integrated classification method based on principal component analysis-simulated annealing genetic algorithm-fuzzy cluster means(PCA-SAGA-FCM)was proposed for the unsupervised classification of tight sandstone reservoirs which lack the prior information and core experiments.A variety of evaluation parameters were selected,including lithology characteristic parameters,poro-permeability quality characteristic parameters,engineering quality characteristic parameters,and pore structure characteristic parameters.The PCA was used to reduce the dimension of the evaluation pa-rameters,and the low-dimensional data was used as input.The unsupervised reservoir classification of tight sandstone reservoir was carried out by the SAGA-FCM,the characteristics of reservoir at different categories were analyzed and compared with the lithological profiles.The analysis results of numerical simulation and actual logging data show that:1)compared with FCM algorithm,SAGA-FCM has stronger stability and higher accuracy;2)the proposed method can cluster the reservoir flexibly and effectively according to the degree of membership;3)the results of reservoir integrated classification match well with the lithologic profle,which demonstrates the reliability of the classification method.

A Mathematical Model of Real-Time Simulation and the Convergence Analysis on Real-Time Runge-Kutta Algorithms

In this paper, a mathematical model of real-time simulation is given, and the problem of convergence on real-time Runge-Kutta algorithms is analysed. At last a theorem on the relation between the order of compensation and the convergent order of real-time algorithm is proved.

Identification Simulation for Dynamical System Based on Genetic Algorithm and Recurrent Multilayer Neural Network

Identification simulation for dynamical system which is based on genetic algorithm (GA) and recurrent multilayer neural network (RMNN) is presented. In order to reduce the inputs of the model, RMNN which can remember and store some previous parameters is used for identifier. And for its high efficiency and optimization, genetic algorithm is introduced into training RMNN. Simulation results show the effectiveness of the proposed scheme. Under the same training algorithm, the identification performance of RMNN is superior to that of nonrecurrent multilayer neural network (NRMNN).

Dynamic self-adaptive ANP algorithm and its application to electric field simulation of aluminum reduction cell

Region partition(RP) is the key technique to the finite element parallel computing(FEPC),and its performance has a decisive influence on the entire process of analysis and computation.The performance evaluation index of RP method for the three-dimensional finite element model(FEM) has been given.By taking the electric field of aluminum reduction cell(ARC) as the research object,the performance of two classical RP methods,which are Al-NASRA and NGUYEN partition(ANP) algorithm and the multi-level partition(MLP) method,has been analyzed and compared.The comparison results indicate a sound performance of ANP algorithm,but to large-scale models,the computing time of ANP algorithm increases notably.This is because the ANP algorithm determines only one node based on the minimum weight and just adds the elements connected to the node into the sub-region during each iteration.To obtain the satisfied speed and the precision,an improved dynamic self-adaptive ANP(DSA-ANP) algorithm has been proposed.With consideration of model scale,complexity and sub-RP stage,the improved algorithm adaptively determines the number of nodes and selects those nodes with small enough weight,and then dynamically adds these connected elements.The proposed algorithm has been applied to the finite element analysis(FEA) of the electric field simulation of ARC.Compared with the traditional ANP algorithm,the computational efficiency of the proposed algorithm has been shortened approximately from 260 s to 13 s.This proves the superiority of the improved algorithm on computing time performance.

NUMERICAL SIMULATION ALGORITHM FOR RELIABILITY ANALYSIS OF COMPLEX STRUCTURAL SYSTEM BASED ON INTELLIGENT OPTIMIZATION

An efficient importance sampling algorithm is presented to analyze reliability of complex structural system with multiple failure modes and fuzzy-random uncertainties in basic variables and failure modes. In order to improve the sampling efficiency, the simulated annealing algorithm is adopted to optimize the density center of the importance sampling for each failure mode, and results that the more significant contribution the points make to fuzzy failure probability, the higher occurrence possibility the points are sampled. For the system with multiple fuzzy failure modes, a weighted and mixed importance sampling function is constructed. The contribution of each fuzzy failure mode to the system failure probability is represented by the appropriate factors, and the efficiency of sampling is improved furthermore. The variances and the coefficients of variation are derived for the failure probability estimations. Two examples are introduced to illustrate the rationality of the present method. Comparing with the direct Monte-Carlo method, the improved efficiency and the precision of the method are verified by the examples.

A Modified Inhomogeneous Stochastic Simulation Algorithm to Model Reactive Boundary Conditions

The present study proposes a stochastic simulation scheme to model reactive boundaries through a position jump process which can be readily implemented into the Inhomogeneous Stochastic Simulation Algorithm by modifying the propensity of the diffusive jump over the reactive boundary. As compared to the literature, the present approach does not require any correction factors for the propensity. Also, the current expression relaxes the constraint on the compartment size allowing the problem to be solved with a coarser grid and therefore saves considerable computational cost. The modified algorithm is then applied to simulate three reaction-diffusion systems with reactive boundaries.

Design and simulation for large parafoil fix line object homing algorithm

Traditional parafoil homing usually uses a point as object. As the mobility of parafoil is limited by its glide ratio and wind, in some cases when the parafoil scatter area is large, or the glide ratio of parafoil is small, the deviation of its landing point to object point will be arduous to control. Accordingly, during these situations, when parafoil is used in recovery of spacecraft or satellite, the landing area of parafoil can be set as a rectangle, and the object of parafoil can be set as a line segment. The thesis of this work is designing an algorithm for parafoil homing using line segment as object. The algorithm of wind velocity and direction calculation in different flying segments was also investigated. The algorithm designed navigates the parafoil to land into the predestined area and largely reduce the probability of recovery loads falling to unwanted area to damage houses and people.

Neural Network Based Algorithm and Simulation of Information Fusion in the Coal Mine

The concepts of information fusion and the basic principles of neural networks are introduced. Neural net-works were introduced as a way of building an information fusion model in a coal mine monitoring system. This assures the accurate transmission of the multi-sensor information that comes from the coal mine monitoring systems. The in-formation fusion mode was analyzed. An algorithm was designed based on this analysis and some simulation results were given. Finally,conclusions that could provide auxiliary decision making information to the coal mine dispatching officers were presented.

Simulation research on control algorithm of differential pressure casting process

To improve the precision of the filling pressure curve of differential pressure casting controlled with PID controller,the model of differential pressure casting process is established and two pressure-difference control systems using PID algorithm and Dahlin algorithm are separately designed in MATLAB. The scheduled pressure curves controlled with PID algorithm and Dahlin algorithm,respectively,are comparatively simulated in MATLAB. The simulated pressure curves obtained show that the control precision with Dahlin algorithm is higher than that with PID algorithm in the differential pressure casting process,and it was further verified by production practice.

Strengthened Dominance Relation NSGA-Ⅲ Algorithm Based on Differential Evolution to Solve Job Shop Scheduling Problem

The job shop scheduling problem is a classical combinatorial optimization challenge frequently encountered in manufacturing systems.It involves determining the optimal execution sequences for a set of jobs on various machines to maximize production efficiency and meet multiple objectives.The Non-dominated Sorting Genetic Algorithm Ⅲ(NSGA-Ⅲ)is an effective approach for solving the multi-objective job shop scheduling problem.Nevertheless,it has some limitations in solving scheduling problems,including inadequate global search capability,susceptibility to premature convergence,and challenges in balancing convergence and diversity.To enhance its performance,this paper introduces a strengthened dominance relation NSGA-Ⅲ algorithm based on differential evolution(NSGA-Ⅲ-SD).By incorporating constrained differential evolution and simulated binary crossover genetic operators,this algorithm effectively improves NSGA-Ⅲ’s global search capability while mitigating pre-mature convergence issues.Furthermore,it introduces a reinforced dominance relation to address the trade-off between convergence and diversity in NSGA-Ⅲ.Additionally,effective encoding and decoding methods for discrete job shop scheduling are proposed,which can improve the overall performance of the algorithm without complex computation.To validate the algorithm’s effectiveness,NSGA-Ⅲ-SD is extensively compared with other advanced multi-objective optimization algorithms using 20 job shop scheduling test instances.The experimental results demonstrate that NSGA-Ⅲ-SD achieves better solution quality and diversity,proving its effectiveness in solving the multi-objective job shop scheduling problem.

State simulation of water distribution networks based on DFP algorithm

The improved weighted-least-square model was used for state simulation of water distribution networks. And DFP algorithm was applied to get the model solution. In order to fit DFP algorithm,the initial model was transformed into a non-constrained optimization problem using mass conservation. Then,through one dimensional optimization and scale matrix establishment,the feasible direction of iteration was obtained,and the values of state variables could be calculated. After several iterations,the optimal estimates of state variables were worked out and state simulation of water distribution networks was achieved as a result. A program of DFP algorithm is developed with Delphi 7 for verification. By running on a designed network,which is composed of 55 nodes,94 pipes and 40 loops,it is proved that DFP algorithm can quickly get the convergence. After 36 iterations,the root mean square of all nodal head errors is reduced by 90.84% from 5.57 to 0.51 m,and the maximum error is only 1.30 m. Compared to Marquardt algorithm,the procedure of DFP algorithm is more stable,and the initial values have less influences on calculation accuracy. Therefore,DFP algorithm can be used for real-time simulation of water distribution networks.