Temperature control is the key of Ruhrstahl-Heraeus (RH) process in steelmaking plant. The accuracy of RH control model greatly affects the molten steel temperature fluctuation. To obtain RH control model with higher ...Temperature control is the key of Ruhrstahl-Heraeus (RH) process in steelmaking plant. The accuracy of RH control model greatly affects the molten steel temperature fluctuation. To obtain RH control model with higher accuracy, an improved case-based reasoning (CBR) model based on attribute weights optimized by genetic algorithm (GA) was proposed. The fitness function in GA was determined according to the prediction accuracy of end temperature of molten steel in RH;then, GA is used to optimize all the attribute weights based on known case base. An improved CBR model that contains the optimized attribute weights was applied to predict end temperature of molten steel in RH, and the prediction accuracy wascalculated. Four methods, CBR based on attribute weights optimized by GA (CBR-GA), ordinary CBR, back propagation neural network (BPNN) and multiple linear regression (MLR) method were employed for comparison. The results show that in the error range of [- 3 ℃, 3 ℃],[- 5 ℃, 5 ℃],[- 7 ℃, 7 ℃] and [- 10 ℃, 10 ℃], the prediction accuracy of CBR-GA was improved by 19.99%, 28.19%, 27.11% and 16.3%, respectively, than that of MLR. Compared with BPNN, the prediction accuracy increased by 3.22%, 7.44%, 5.29% and 2.40%, respectively. Compared with ordinary CBR, the accuracy increased by 5.43%, 5.80%, 4.66% and 2.27%, respectively.展开更多
There is instability in the distributed energy storage cloud group end region on the power grid side.In order to avoid large-scale fluctuating charging and discharging in the power grid environment and make the capaci...There is instability in the distributed energy storage cloud group end region on the power grid side.In order to avoid large-scale fluctuating charging and discharging in the power grid environment and make the capacitor components showa continuous and stable charging and discharging state,a hierarchical time-sharing configuration algorithm of distributed energy storage cloud group end region on the power grid side based on multi-scale and multi feature convolution neural network is proposed.Firstly,a voltage stability analysis model based onmulti-scale and multi feature convolution neural network is constructed,and the multi-scale and multi feature convolution neural network is optimized based on Self-OrganizingMaps(SOM)algorithm to analyze the voltage stability of the cloud group end region of distributed energy storage on the grid side under the framework of credibility.According to the optimal scheduling objectives and network size,the distributed robust optimal configuration control model is solved under the framework of coordinated optimal scheduling at multiple time scales;Finally,the time series characteristics of regional power grid load and distributed generation are analyzed.According to the regional hierarchical time-sharing configuration model of“cloud”,“group”and“end”layer,the grid side distributed energy storage cloud group end regional hierarchical time-sharing configuration algorithm is realized.The experimental results show that after applying this algorithm,the best grid side distributed energy storage configuration scheme can be determined,and the stability of grid side distributed energy storage cloud group end region layered timesharing configuration can be improved.展开更多
This study presents a two-echelon inventory routing problem (2E-IRP) with an end-of-tour replenishment (ETR) policy whose distribution network consists of a supplier, several distribution centers (DCs) and several ret...This study presents a two-echelon inventory routing problem (2E-IRP) with an end-of-tour replenishment (ETR) policy whose distribution network consists of a supplier, several distribution centers (DCs) and several retailers on a multi-period planning horizon. A formulation of the problem based on vehicle indices is proposed in the form of a mixed integer linear program (MILP). The mathematical model of the problem is solved using a branch and cut (B&C) algorithm. The results of the tests are compared to the results of a branch and price (B&P) algorithm from the literature on 2E-IRP with a classical distribution policy. The results of the tests show that the B&C algorithm solves 197 out of 200 instances (98.5%). The comparison of the B&C and B&P results shows that 185 best solutions are obtained with the B&C algorithm on 197 instances (93.9%). Overall, the B&C algorithm achieves cost reductions ranging from 0.26% to 41.44% compared to the classic 2E-IRP results solved with the B&P algorithm, with an overall average reduction of 18.08%.展开更多
“Minimizing path delay” is one of the challenges in low Earth orbit (LEO) satellite network routing algo-rithms. Many authors focus on propagation delays with the distance vector but ignore the status information an...“Minimizing path delay” is one of the challenges in low Earth orbit (LEO) satellite network routing algo-rithms. Many authors focus on propagation delays with the distance vector but ignore the status information and processing delays of inter-satellite links. For this purpose, a new discrete-time traffic and topology adap-tive routing (DT-TTAR) algorithm is proposed in this paper. This routing algorithm incorporates both inher-ent dynamics of network topology and variations of traffic load in inter-satellite links. The next hop decision is made by the adaptive link cost metric, depending on arrival rates, time slots and locations of source-destination pairs. Through comprehensive analysis, we derive computation formulas of the main per-formance indexes. Meanwhile, the performances are evaluated through a set of simulations, and compared with other static and adaptive routing mechanisms as a reference. The results show that the proposed DT-TTAR algorithm has better performance of end-to-end delay than other algorithms, especially in high traffic areas.展开更多
This study involves the development of an analytical model for understanding the behavior of the extended, stiffened end-plate moment connections with eight high strength bolts. Modeling of the connection as an assemb...This study involves the development of an analytical model for understanding the behavior of the extended, stiffened end-plate moment connections with eight high strength bolts. Modeling of the connection as an assemblage of finite elements (FE) used for load deformation analysis, with material, and contact nonlinearities are developed. Results from the FE mathematical model are verified with results from the ANSYS computer program as well as with the test results. Sensitivity and feasibility studies are carried out. Significant geometry and force related variables are introduced;and by varying the geometric variables of the connections within a practical range, a matrix of test cases is obtained. Maximum end-plate separation, maximum bending stresses in the end-plate, and the forces from the connection bolts for these test cases are obtained. From the FE analysis, a database is produced to collect results for the artificial neural network analysis. Finally, salient features of the optimized Artificial Neural Network (ANN) via Genetic Algorithm (GA) analysis are introduced and implemented with the aim of predicting the overall behavior of the connection.展开更多
Nested-loop secondary linear doubly-fed machine(NLS-LDFM) is a novel linear machine evolved from rotary brushless doubly-fed induction machine, which has a good application prospect in linear metro. In order to analyz...Nested-loop secondary linear doubly-fed machine(NLS-LDFM) is a novel linear machine evolved from rotary brushless doubly-fed induction machine, which has a good application prospect in linear metro. In order to analyze the performance of NLS-LDFM, the mechanism and action rules of end effects are investigated in this paper. Firstly, the mechanism of static and dynamic end effects is analyzed in aspect of direct coupling, winding asymmetry and transient secondary current. Furthermore, based on the winding theory for short primary linear machines, the machine parameters are established qualitatively considering pulsating magnetic field of NLS-LDFM. Finally, the NLS-LDFM performance analysis is supplemented by the finite element algorithm(FEA) simulation and experiments under different operating conditions.展开更多
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 spec...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.展开更多
Milling Process Simulation is one of the important re search areas in manufacturing science. For the purpose of improving the prec ision of simulation and extending its usability, numerical algorithm is more and more ...Milling Process Simulation is one of the important re search areas in manufacturing science. For the purpose of improving the prec ision of simulation and extending its usability, numerical algorithm is more and more used in the milling modeling areas. But simulative efficiency is decreasin g with increase of its complexity. As a result, application of the method is lim ited. Aimed at above question, high-efficient algorithm for milling process sim ulation is studied. It is important for milling process simulation’s applicatio n. Parallel computing is widely used to solve the large-scale computation question s. Its advantages include system flexibility, robust, high-efficient computing capability and high ratio of performance to price. With the development of compu ter network, utilizing the computing resource in the Internet, a virtual computi ng environment with powerful computing capability can be consisted by microc omputers, and the difficulty of building hardware environment which is used to s upport parallel computing is reduced. How to use network technology and parallel algorithm to improve simulative effic iency for milling forces simulation is investigated in the paper. In order to pr edict milling forces, a simplified local milling forces model is used in the pap er. End milling cutter is assumed to be divided by r number of differential elem ents along the axial direction of the cutter. For a given time, the total cuttin g forces can be obtained by summarizing the resultant cutting force produced by each differential cutter disc. Divide the whole simulative time into some segmen ts, send these program’s segments to microcomputers in the Internet and obtain the result of the program’s segments, all of the result of program’s segments a re composed the final result. For implementing the algorithm, a distributed Parallel computing framework is de signed in the paper. In the framework, web server plays a role of controller. Us ing Java RMI(remote method interface), the computing processes in computing serv er are called by web server. There are lots of control processes in web server a nd control the computing servers. The codes of simulative algorithm can be dynam ic sent to the computing servers, and milling forces at the different time are c omputed through utilizing the local computer’s resource. The results that are ca lculated by every computing servers are sent to the web server, and composed the final result. The framework can be used by different simulative algorithm. Comp ared with the algorithm running single machine, the efficiency of provided algor ithm is higher than that of single machine.展开更多
Some new concepts of effective incidence matrix,ascending order adjacency matrix andend-result vertex are introduced,and some improvements of the maximum weight matchingalgorithm are made.With this method a computer p...Some new concepts of effective incidence matrix,ascending order adjacency matrix andend-result vertex are introduced,and some improvements of the maximum weight matchingalgorithm are made.With this method a computer program in FORTRAN language is realized onthe computers FELIX C-512 and IBM-PC.Good results are obtained in practical operations.展开更多
Reaction wheel or reaction thruster is employed to maintain the attitude of the base of space robot fixed in attitude control of free flying space robot. However, in this method, a large amount of fuel will be consume...Reaction wheel or reaction thruster is employed to maintain the attitude of the base of space robot fixed in attitude control of free flying space robot. However, in this method, a large amount of fuel will be consumed, and it will shorten the on orbit life span of space robot, it also vibrate the system and make the system unsteady. The restricted minimum disturbance map (RMDM) based algorithm of attitude control is presented to keep the attitude of the base fixed during the movement of the manipulator. In this method it is realized by planning motion trajectory of the end effector of manipulator without using reaction wheel or reaction thruster. In order to verify the feasibility and effectiveness of the algorithm attitude control presented in this paper, computer simulation experiments have been made and the experimental results demonstrate that this algorithm is feasible.展开更多
基金financially supported by National Key Research and Development Program of China(No.2016YFB0601301)National Natural Science Foundation of China(No.51574032)Fundamental Research Funds for the Central Universities(No.FRF-TP-16-081A1).
文摘Temperature control is the key of Ruhrstahl-Heraeus (RH) process in steelmaking plant. The accuracy of RH control model greatly affects the molten steel temperature fluctuation. To obtain RH control model with higher accuracy, an improved case-based reasoning (CBR) model based on attribute weights optimized by genetic algorithm (GA) was proposed. The fitness function in GA was determined according to the prediction accuracy of end temperature of molten steel in RH;then, GA is used to optimize all the attribute weights based on known case base. An improved CBR model that contains the optimized attribute weights was applied to predict end temperature of molten steel in RH, and the prediction accuracy wascalculated. Four methods, CBR based on attribute weights optimized by GA (CBR-GA), ordinary CBR, back propagation neural network (BPNN) and multiple linear regression (MLR) method were employed for comparison. The results show that in the error range of [- 3 ℃, 3 ℃],[- 5 ℃, 5 ℃],[- 7 ℃, 7 ℃] and [- 10 ℃, 10 ℃], the prediction accuracy of CBR-GA was improved by 19.99%, 28.19%, 27.11% and 16.3%, respectively, than that of MLR. Compared with BPNN, the prediction accuracy increased by 3.22%, 7.44%, 5.29% and 2.40%, respectively. Compared with ordinary CBR, the accuracy increased by 5.43%, 5.80%, 4.66% and 2.27%, respectively.
基金supported by State Grid Corporation Limited Science and Technology Project Funding(Contract No.SGCQSQ00YJJS2200380).
文摘There is instability in the distributed energy storage cloud group end region on the power grid side.In order to avoid large-scale fluctuating charging and discharging in the power grid environment and make the capacitor components showa continuous and stable charging and discharging state,a hierarchical time-sharing configuration algorithm of distributed energy storage cloud group end region on the power grid side based on multi-scale and multi feature convolution neural network is proposed.Firstly,a voltage stability analysis model based onmulti-scale and multi feature convolution neural network is constructed,and the multi-scale and multi feature convolution neural network is optimized based on Self-OrganizingMaps(SOM)algorithm to analyze the voltage stability of the cloud group end region of distributed energy storage on the grid side under the framework of credibility.According to the optimal scheduling objectives and network size,the distributed robust optimal configuration control model is solved under the framework of coordinated optimal scheduling at multiple time scales;Finally,the time series characteristics of regional power grid load and distributed generation are analyzed.According to the regional hierarchical time-sharing configuration model of“cloud”,“group”and“end”layer,the grid side distributed energy storage cloud group end regional hierarchical time-sharing configuration algorithm is realized.The experimental results show that after applying this algorithm,the best grid side distributed energy storage configuration scheme can be determined,and the stability of grid side distributed energy storage cloud group end region layered timesharing configuration can be improved.
文摘This study presents a two-echelon inventory routing problem (2E-IRP) with an end-of-tour replenishment (ETR) policy whose distribution network consists of a supplier, several distribution centers (DCs) and several retailers on a multi-period planning horizon. A formulation of the problem based on vehicle indices is proposed in the form of a mixed integer linear program (MILP). The mathematical model of the problem is solved using a branch and cut (B&C) algorithm. The results of the tests are compared to the results of a branch and price (B&P) algorithm from the literature on 2E-IRP with a classical distribution policy. The results of the tests show that the B&C algorithm solves 197 out of 200 instances (98.5%). The comparison of the B&C and B&P results shows that 185 best solutions are obtained with the B&C algorithm on 197 instances (93.9%). Overall, the B&C algorithm achieves cost reductions ranging from 0.26% to 41.44% compared to the classic 2E-IRP results solved with the B&P algorithm, with an overall average reduction of 18.08%.
文摘“Minimizing path delay” is one of the challenges in low Earth orbit (LEO) satellite network routing algo-rithms. Many authors focus on propagation delays with the distance vector but ignore the status information and processing delays of inter-satellite links. For this purpose, a new discrete-time traffic and topology adap-tive routing (DT-TTAR) algorithm is proposed in this paper. This routing algorithm incorporates both inher-ent dynamics of network topology and variations of traffic load in inter-satellite links. The next hop decision is made by the adaptive link cost metric, depending on arrival rates, time slots and locations of source-destination pairs. Through comprehensive analysis, we derive computation formulas of the main per-formance indexes. Meanwhile, the performances are evaluated through a set of simulations, and compared with other static and adaptive routing mechanisms as a reference. The results show that the proposed DT-TTAR algorithm has better performance of end-to-end delay than other algorithms, especially in high traffic areas.
文摘This study involves the development of an analytical model for understanding the behavior of the extended, stiffened end-plate moment connections with eight high strength bolts. Modeling of the connection as an assemblage of finite elements (FE) used for load deformation analysis, with material, and contact nonlinearities are developed. Results from the FE mathematical model are verified with results from the ANSYS computer program as well as with the test results. Sensitivity and feasibility studies are carried out. Significant geometry and force related variables are introduced;and by varying the geometric variables of the connections within a practical range, a matrix of test cases is obtained. Maximum end-plate separation, maximum bending stresses in the end-plate, and the forces from the connection bolts for these test cases are obtained. From the FE analysis, a database is produced to collect results for the artificial neural network analysis. Finally, salient features of the optimized Artificial Neural Network (ANN) via Genetic Algorithm (GA) analysis are introduced and implemented with the aim of predicting the overall behavior of the connection.
基金supported in part by the National Natural Science Foundations of China under Grants 52277050 and 51877093the fund from Science,Technology,Shenzhen International Collaboration under Grant GJHZ20210705142539007+1 种基金the Key Research and Development Program of Sichuan Province under Grant 2021YFG0081the fund from Science,Technology and Innovation Commission of Shenzhen Municipality under Grant JCYJ20190809101205546。
文摘Nested-loop secondary linear doubly-fed machine(NLS-LDFM) is a novel linear machine evolved from rotary brushless doubly-fed induction machine, which has a good application prospect in linear metro. In order to analyze the performance of NLS-LDFM, the mechanism and action rules of end effects are investigated in this paper. Firstly, the mechanism of static and dynamic end effects is analyzed in aspect of direct coupling, winding asymmetry and transient secondary current. Furthermore, based on the winding theory for short primary linear machines, the machine parameters are established qualitatively considering pulsating magnetic field of NLS-LDFM. Finally, the NLS-LDFM performance analysis is supplemented by the finite element algorithm(FEA) simulation and experiments under different operating conditions.
文摘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.
文摘Milling Process Simulation is one of the important re search areas in manufacturing science. For the purpose of improving the prec ision of simulation and extending its usability, numerical algorithm is more and more used in the milling modeling areas. But simulative efficiency is decreasin g with increase of its complexity. As a result, application of the method is lim ited. Aimed at above question, high-efficient algorithm for milling process sim ulation is studied. It is important for milling process simulation’s applicatio n. Parallel computing is widely used to solve the large-scale computation question s. Its advantages include system flexibility, robust, high-efficient computing capability and high ratio of performance to price. With the development of compu ter network, utilizing the computing resource in the Internet, a virtual computi ng environment with powerful computing capability can be consisted by microc omputers, and the difficulty of building hardware environment which is used to s upport parallel computing is reduced. How to use network technology and parallel algorithm to improve simulative effic iency for milling forces simulation is investigated in the paper. In order to pr edict milling forces, a simplified local milling forces model is used in the pap er. End milling cutter is assumed to be divided by r number of differential elem ents along the axial direction of the cutter. For a given time, the total cuttin g forces can be obtained by summarizing the resultant cutting force produced by each differential cutter disc. Divide the whole simulative time into some segmen ts, send these program’s segments to microcomputers in the Internet and obtain the result of the program’s segments, all of the result of program’s segments a re composed the final result. For implementing the algorithm, a distributed Parallel computing framework is de signed in the paper. In the framework, web server plays a role of controller. Us ing Java RMI(remote method interface), the computing processes in computing serv er are called by web server. There are lots of control processes in web server a nd control the computing servers. The codes of simulative algorithm can be dynam ic sent to the computing servers, and milling forces at the different time are c omputed through utilizing the local computer’s resource. The results that are ca lculated by every computing servers are sent to the web server, and composed the final result. The framework can be used by different simulative algorithm. Comp ared with the algorithm running single machine, the efficiency of provided algor ithm is higher than that of single machine.
文摘Some new concepts of effective incidence matrix,ascending order adjacency matrix andend-result vertex are introduced,and some improvements of the maximum weight matchingalgorithm are made.With this method a computer program in FORTRAN language is realized onthe computers FELIX C-512 and IBM-PC.Good results are obtained in practical operations.
文摘Reaction wheel or reaction thruster is employed to maintain the attitude of the base of space robot fixed in attitude control of free flying space robot. However, in this method, a large amount of fuel will be consumed, and it will shorten the on orbit life span of space robot, it also vibrate the system and make the system unsteady. The restricted minimum disturbance map (RMDM) based algorithm of attitude control is presented to keep the attitude of the base fixed during the movement of the manipulator. In this method it is realized by planning motion trajectory of the end effector of manipulator without using reaction wheel or reaction thruster. In order to verify the feasibility and effectiveness of the algorithm attitude control presented in this paper, computer simulation experiments have been made and the experimental results demonstrate that this algorithm is feasible.
