数据库设计的工程化方法及应用

本文结合四川石油管理局管理信息系统开发分系统的数据库设计过程,介绍数据库设计的一种工程化方法。该方法综合了现有的设计方法,突出了设计过程的工程化、规范化和文档化。

基于产教深度融合的智能装备工程虚拟仿真实践与探索--以数字赋能中药制药智能装备工程能力培养高层次人才为例

虚拟仿真技术是数字赋能职业本科教育重要形式,它是构建校企文化、技术、设备、管理的融汇平台,使复杂的工艺过程、工作场景、智能设备等元素数字化,为培养能解决复杂设备、工艺问题的高层次人才提供路径,在职业本科教育领域的应用日益受到关注。为了探讨职业本科院校利用智能装备虚拟仿真教学模式培养中药制药高层次人才的实践和效果,通过仿真企业的“人机物法环”元素情景,以共建共享工程技术中心为桥梁,融入企业的人员、机械、物料、法则、环境的真实元素,使复杂工作场景与设备通过数字化形式呈现,“人机物法环”交汇传递多学科知识,探索以数字赋能中药制药智能装备工程能力培养高层次人才培养模式,为加快建设现代中药产业工程化体系,增强产业机械化、智能化、数字化的核心竞争力提供有力支撑。本研究为虚拟仿真与工程化元素融合,解决复杂工程智能装备操作、复杂工艺问题解决提供较好虚拟实训,为培养职业本科高层次工程能力的人才创建新模式。

An Improved Differential Evolution for Optimization of Chemical Process

Differential evolution （DE） is an evolutionary optimization method, which has been successfully used in many practical cases. However, DE involves large computation time, especially, when used to optimize the compurationally expensive objective function. To overcome this .difficulty, the concept of immunity based on vaccination is used to help proliferate excellent schemata and to restrain the degenerate phenomenon. To improve the effective- ness of vaccines, a new vaccine autonomous obtaining method, and a method of deciding the probability of vacci- nation are proposed. In addition, a method for modifying the search space dynamically is proposed to enhance the possibility of converging to the true global optimum. Experiments showed that the improved DE performs better than the classical DE significantly.

Multi-objective Evolutionary Algorithms for MILP and MINLP in Process Synthesis

Steady-state non-dominated sorting genetic algorithm (SNSGA), a new form of multi-objective genetic algorithm, is implemented by combining the steady-state idea in steady-state genetic algorithms (SSGA) and the fitness assignment strategy of non-dominated sorting genetic algorithm (NSGA). The fitness assignment strategy is improved and a new self-adjustment scheme of is proposed. This algorithm is proved to be very efficient both computationally and in terms of the quality of the Pareto fronts produced with five test problems including GA difficult problem and GA deceptive one. Finally, SNSGA is introduced to solve multi-objective mixed integer linear programming (MILP) and mixed integer non-linear programming (MINLP) problems in process synthesis.

Chemical process dynamic optimization based on hybrid differential evolution algorithm integrated with Alopex

To solve dynamic optimization problem of chemical process (CPDOP), a hybrid differential evolution algorithm, which is integrated with Alopex and named as Alopex-DE, was proposed. In Alopex-DE, each original individual has its own symbiotic individual, which consists of control parameters. Differential evolution operator is applied for the original individuals to search the global optimization solution. Alopex algorithm is used to co-evolve the symbiotic individuals during the original individual evolution and enhance the fitness of the original individuals. Thus, control parameters are self-adaptively adjusted by Alopex to obtain the real-time optimum values for the original population. To illustrate the whole performance of Alopex-DE, several varietal DEs were applied to optimize 13 benchmark functions. The results show that the whole performance of Alopex-DE is the best. Further, Alopex-DE was applied to solve 4 typical CPDOPs, and the effect of the discrete time degree on the optimization solution was analyzed. The satisfactory result is obtained.

A Genetic Fuzzy Analytical Hierarchy Process Based Projection Pursuit Method for Selecting Schemes of Water Transportation Projects

The optimal selection of schemes of water transportation projects is a process of choosing a relatively optimal scheme from a number of schemes of water transportation programming and management projects, which is of importance in both theory and practice in water resource systems engineering. In order to achieve consistency and eliminate the dimensions of fuzzy qualitative and fuzzy quantitative evaluation indexes, to determine the weights of the indexes objectively, and to increase the differences among the comprehensive evaluation index values of water transportation project schemes, a projection pursuit method, named FPRM-PP for short, was developed in this work for selecting the optimal water transportation project scheme based on the fuzzy preference relation matrix. The research results show that FPRM-PP is intuitive and practical, the correction range of the fuzzy rained is both stable and accurate; preference relation matrix A it produces is relatively small, and the result obtherefore FPRM-PP can be widely used in the optimal selection of different multi-factor decision-making schemes.

A New Method to Solve Robust Data Reconciliation in Nonlinear Process

Data reconciliation is an effective technique for providing accurate and consistent value for chemical process. However, the presence of gross errors can severely bias the reconciled results. Robust estimators can significantly reduce the effect of gross errors and yield less-biased results. In this article, a new method is proposed to solve the robust data reconciliation problem of nonlinear chemical process. By using several technologies including linearization method, penalty function, virtual observation equation, and equivalent weights method, the robust data reconciliation problem can be transformed into least squares estimator problem which leads to the convenience in computation. Simulation results in a nonlinear chemical process demonstrate the efficiency of the proposed method.

Modified Augmented Lagrange Multiplier Methods for Large-Scale Chemical Process Optimization

Chemical process optimization can be described as large-scale nonlinear constrained minimization. The modified augmented Lagrange multiplier methods (MALMM) for large-scale nonlinear constrained minimization are studied in this paper. The Lagrange function contains the penalty terms on equality and inequality constraints and the methods can be applied to solve a series of bound constrained sub-problems instead of a series of unconstrained sub-problems. The steps of the methods are examined in full detail. Numerical experiments are made for a variety of problems, from small to very large-scale, which show the stability and effectiveness of the methods in large-scale problems.

A modeling method of semiconductor fabrication flows with extended knowledge hybrid Petri nets

A modeling method of extended knowledge hybrid Petri nets （EKHPNs）, incorporating object-oriented methods into hybrid Petri nets （HPNs）, was presented and used for the representation ~d modeling of semiconductor wafer fabrication flows. To model the discrete and continuous parts of a complex semiconductor wafer fabrication flow, the HPNs were introduced into the EKHPNs. Object-oriented methods were combined into the EKHPNs for coping with the complexity of the fabrication flow. Knowledge anno- tations were introduced to solve input and output conflicts of the EKHPNs. Finally, to demonstrate the validity of the EKHPN method, a real semiconductor wafer fabrication case was used to illustrate the model- ing procedure. The modeling results indicate that the proposed method can be used to model a complex semiconductor wafer fabrication flow expediently.

Improved Hybrid Differential Evolution-Estimation of Distribution Algorithm with Feasibility Rules for NLP/MINLP Engineering Optimization Problems

In this paper, an improved hybrid differential evolution-estimation of distribution algorithm (IHDE-EDA) is proposed for nonlinear programming (NLP) and mixed integer nonlinear programming (MINLP) models in engineering optimization fields. In order to improve the global searching ability and convergence speed, IHDE-EDA takes full advantage of differential information and global statistical information extracted respectively from differential evolution algorithm and annealing mechanism-embedded estimation of distribution algorithm. Moreover, the feasibility rules are used to handle constraints, which do not require additional parameters and can guide the population to the feasible region quickly. The effectiveness of hybridization mechanism of IHDE-EDA is first discussed, and then simulation and comparison based on three benchmark problems demonstrate the efficiency, accuracy and robustness of IHDE-EDA. Finally, optimization on an industrial-size scheduling of two-pipeline crude oil blending problem shows the practical applicability of IHDE-EDA.

Design Hybrid Methods for Encoding Prior Knowledge in Feedforward Network with Application in Chemical Engineering

Three-layer feedforward networks have been widely used in modeling chemical engineering processes and prior-knowledge-based methods have been introduced to improve their performances.In this paper,we propose the methodology of designing better prior-knowledge-based hybrid methods by combining the existing ones. Then according to this methodology,two hybrid methods,interpolation-optimization (IO) method and interpolation penalty-function (IPF) method,are designed as examples.Finally,both methods are applied to modeling two cases in chemical engineering to investigate their effectiveness.Simulation results show that the performances of the hybrid methods are better than those of their parents.

Improved Kernel PLS-based Fault Detection Approach for Nonlinear Chemical Processes

In this paper, an improved nonlinear process fault detection method is proposed based on modified kernel partial least squares(KPLS). By integrating the statistical local approach(SLA) into the KPLS framework, two new statistics are established to monitor changes in the underlying model. The new modeling strategy can avoid the Gaussian distribution assumption of KPLS. Besides, advantage of the proposed method is that the kernel latent variables can be obtained directly through the eigen value decomposition instead of the iterative calculation, which can improve the computing speed. The new method is applied to fault detection in the simulation benchmark of the Tennessee Eastman process. The simulation results show superiority on detection sensitivity and accuracy in comparison to KPLS monitoring.

Multi-objective nonlinear model predictive control through switching cost functions and its applications to chemical processes

This paper proposes a switching multi-objective model predictive control(MOMPC) algorithm for constrained nonlinear continuous-time process systems.Different cost functions to be minimized in MPC are switched to satisfy different performance criteria imposed at different sampling times.In order to ensure recursive feasibility of the switching MOMPC and stability of the resulted closed-loop system,the dual-mode control method is used to design the switching MOMPC controller.In this method,a local control law with some free-parameters is constructed using the control Lyapunov function technique to enlarge the terminal state set of MOMPC.The correction term is computed if the states are out of the terminal set and the free-parameters of the local control law are computed if the states are in the terminal set.The recursive feasibility of the MOMPC and stability of the resulted closed-loop system are established in the presence of constraints and arbitrary switches between cost functions.Finally,implementation of the switching MOMPC controller is demonstrated with a chemical process example for the continuous stirred tank reactor.

Fault Prediction Based on Dynamic Model and Grey Time Series Model in Chemical Processes

This paper combines grey model with time series model and then dynamic model for rapid and in-depth fault prediction in chemical processes. Two combination methods are proposed. In one method, historical data is introduced into the grey time series model to predict future trend of measurement values in chemical process. These predicted measurements are then used in the dynamic model to retrieve the change of fault parameters by model based diagnosis algorithm. In another method, historical data is introduced directly into the dynamic model to retrieve historical fault parameters by model based diagnosis algorithm. These parameters are then predicted by the grey time series model. The two methods are applied to a gravity tank example. The case study demonstrates that the first method is more accurate for fault prediction.

Stability analysis of underground engineering based on multidisciplinary design optimization

Aiming at characteristics of underground engineering,analyzed the feasibility of Multidisciplinary Design Optimization (MDO) used in underground engineering,and put forward a modularization-based MDO method and the idea of MDO to resolve problems in stability analysis,proving the validity and feasibility of using MDO in underground engi- neering.Characteristics of uncertainty,complexity and nonlinear become bottle-neck to carry on underground engineering stability analysis by MDO.Therefore,the application of MDO in underground engineering stability analysis is still at a stage of exploration,which need some deep research.

Optimization of assembly line balancing using genetic algorithm

In a manufacturing industry, mixed model assembly line(MMAL) is preferred in order to meet the variety in product demand. MMAL balancing helps in assembling products with similar characteristics in a random fashion. The objective of this work aims in reducing the number of workstations, work load index between stations and within each station. As manual contribution of workers in final assembly line is more, ergonomics is taken as an additional objective function. Ergonomic risk level of a workstation is evaluated using a parameter called accumulated risk posture(ARP), which is calculated using rapid upper limb assessment(RULA) check sheet. This work is based on the case study of an MMAL problem in Rane(Madras) Ltd.(India), in which a problem based genetic algorithm(GA) has been proposed to minimize the mentioned objectives. The working of the genetic operators such as selection, crossover and mutation has been modified with respect to the addressed MMAL problem. The results show that there is a significant impact over productivity and the process time of the final assembled product, i.e., the rate of production is increased by 39.5% and the assembly time for one particular model is reduced to 13 min from existing 18 min. Also, the space required using the proposed assembly line is only 200 m2 against existing 350 m2. Further, the algorithm helps in reducing workers fatigue(i.e., ergonomic friendly).

Novel Control Vector Parameterization Method with Differential Evolution Algorithm and Its Application in Dynamic Optimization of Chemical Processes

Two general approaches are adopted in solving dynamic optimization problems in chemical processes, namely, the analytical and numerical methods. The numerical method, which is based on heuristic algorithms, has been widely used. An approach that combines differential evolution （DE） algorithm and control vector parameteri- zation （CVP） is proposed in this paper. In the proposed CVP, control variables are approximated with polynomials based on state variables and time in the entire time interval. Region reduction strategy is used in DE to reduce the width of the search region, which improves the computing efficiency. The results of the case studies demonstrate the feasibility and efficiency of the oroposed methods.

Modified Recursive Least Squares Algorithm with Variable Parameters and Resetting for Time-Varying System

Based on the idea of the set-membership identification, a modified recursive least squares algorithm with variable gain, variable forgetting factor and resetting is presented. The concept of the error tolerance level is proposed. The selection criteria of the error tolerance level are also given according to the min-max principle. The algorithm is particularly suitable for tracing time-varying systems and is similar in computational complexity to the standard recursive least squares algorithm. The superior performance of the algorithm is verified ma simulation studies on a dynamic fermentation process.

Localization and navigation using a novel artificial landmark for indoor mobile robots

This paper presents a practical topological navigation system for indoor mobile robots, making use of a novel artificial landmark which is called MR code. This new kind of paper-made landmarks earl be easi- ly attached on the ceilings or on the walls, lmealization algorithms for the two cases are given respective- ly. A docking control algorithm is also described, which a robot employs to approach its current goal. A simple topological navigation algorithm is proposed. Experiment results show the effectiveness of the method in real environment.

Analysis of Cutting Force by End Milling Using Artificial ntelligence

The cutting forces during end milling process by using Genetic Algorithm are investigated in this paper. However, automated CNC （computer numerical control） programming by milling machine is intended to use for special required conditions of programming of tool path length, and analysis of cutting force and optimization of main parameters are presented. Some effective simplification of automated programming is done for cutting force. The cutting force is modelled and analyzed into mathematical simulations in order to optimize the main cutting parameters, also in this case tool path length, it is get as free trajectory. Optimization is carried out by using the Matlab/Genetic Algorithm method that excessively reduce the time and to optimize the main cutting parameters of machining. The number of experiments, measurements and results of cutting force （F~）, are presented in 3D as well as in tables. In order to verify the accuracy of the 3 D simulation with optimization method, the results are compared in experimental and theoretical way. In other word, these results indicate directly that the optimized parameters are capable of machining the workpiece. Achieved results that are presented in this paper may in general help the new researcher as well as manufacturing industries of metal cutting.