NOVEL METHOD FOR DYNAMIC OPTIMIZATION OF STABILITY IN HIGH-SPEED MILLING SYSTEM

Considering the self-excited and forced vibrations in high-speed milling processes, a novel method for dynamic optimization of system stability is used to determine the cutting parameters and structural parameters by increasing the chatter free material removal rate （CF-MRR） and surface finish. The method is hased on the theory of the chatter stability and the semi-bandwidth of the resonant region. The objective function of the method is material removal rate（MRR）,the constraints are chatter stability and surface finish, and the optimizing variables are cutting and structural parameters. The optimization procedure is stated. The method is applied to a milling system and CF-MRR is increased 18.86%. It is shown that the influences of the chatter stability and the resonance are simultaneously considered in the dynamic optimization of the milling system for increasing CF-MRR and the surface finish.

PARAMETERIZED-PROTOTYPE-BASED DYNAMIC OPTIMIZATION DESIGN FOR CAM PROFILE

Aiming at the problems in current cam profile optimization processes, such as simple dynamics models, limited geometric accuracy and low design automatization level, a new dynamic optimization mode is put forward. Based on the parameterization modeling technique of MSC. ADAMS platform, the different steps in current mode are reorganized, thus obtaining an upgraded mode called the ＂parameterized-prototype-based cam profile dynamic optimization mode＂. A parameterized prototype（PP） of valve mechanism is constructed in the course of dynamic optimization for cam profiles. Practically, by utilizing PP and considering the flexibility of the parts in valve mechanism, geometric accuracy and design automatization are improved.

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 Hybrid Improved Genetic Algorithm and Its Application in Dynamic Optimization Problems of Chemical Processes

The solutions of dynamic optimization problems are usually very difficult due to their highly nonlinear and multidimensional nature. 13enetic algorithm （GA） has been proved to be a teasibte method when the gradient is difficult to calculate. Its advantage is that the control profiles at all time stages are optimized simultaneously, but its convergence is very slow in the later period of evolution and it is easily trapped in the local optimum. In this study, a hybrid improved genetic algorithm （HIGA） for solving dynamic optimization problems is proposed to overcome these defects. Simplex method （SM） is used to perform the local search in the neighborhood of the optimal solution. By using SM, the ideal searching direction of global optimal solution could be found as soon as possible and the convergence speed of the algorithm is improved. The hybrid algorithm presents some improvements, such as protecting the best individual, accepting immigrations, as well as employing adaptive crossover and Ganssian mutation operators. The efficiency of the proposed algorithm is demonstrated by solving several dynamic optimization problems. At last, HIGA is applied to the optimal production of secreted protein in a fed batch reactor and the optimal feed-rate found by HIGA is effective and relatively stable.

A dynamic optimization model of an integrated coal supply chain system and its application

Various nodes,logistics,capital flows,and information flows are required to make systematic decisions concerning the operation of an integrated coal supply system. We describe a quantitative analysis of such a system. A dynamic optimization model of the supply chain is developed. It has achieved optimal system profit under conditions guaranteeing a certain level of customer satisfaction. Applying this model to coal production of the Xuzhou coal mines allows recommendations for a more systematic use of washing and processing,transportation and sale resources for commercial coal production to be made. The results show that this model,which is scientific and effective,has an important value for making reasonable decisions related to complex coal enterprises.

Dynamic Optimization Method on Electromechanical Coupling System by Exponential Inertia Weight Particle Swarm Algorithm

Dynamic optimization of electromechanical coupling system is a significant engineering problem in the field of mechatronics. The performance improvement of electromechanical equipment depends on the system design parameters. Aiming at the spindle unit of refitted machine tool for solid rocket, the vibration acceleration of tool is taken as objective function, and the electromechanical system design parameters are appointed as design variables. Dynamic optimization model is set up by adopting Lagrange-Maxwell equations, Park transform and electromechanical system energy equations. In the procedure of seeking high efficient optimization method, exponential function is adopted to be the weight function of particle swarm optimization algorithm. Exponential inertia weight particle swarm algorithm（EPSA）, is formed and applied to solve the dynamic optimization problem of electromechanical system. The probability density function of EPSA is presented and used to perform convergence analysis. After calculation, the optimized design parameters of the spindle unit are obtained in limited time period. The vibration acceleration of the tool has been decreased greatly by the optimized design parameters. The research job in the paper reveals that the problem of dynamic optimization of electromechanical system can be solved by the method of combining system dynamic analysis with reformed swarm particle optimizati on. Such kind of method can be applied in the design of robots, NC machine, and other electromechanical equipments.

Solution of Chemical Dynamic Optimization Using the Simultaneous Strategies

An approach of simultaneous strategies with two novel techniques is proposed to improve the solution accuracy of chemical dynamic optimization problems. The first technique is to handle constraints on control vari- ables based on the finite-element collocation so as to control the approximation error for discrete optimal problems, where a set of control constraints at dement knots are integrated with the procedure for optimization leading to a significant gain in the accuracy of the simultaneous strategies. The second technique is to make the mesh refine- ment more feasible and reliable by introducing length constraints and guideline in designing appropriate element length boundaries, so that the proposed approach becomes more efficient in adjusting dements to track optimal control profile breakpoints and ensure accurate state and centrol profiles. Four classic benchmarks of dynamic op- timization problems are used as illustrations, and the proposed approach is compared with literature reports. The research results reveal that the proposed approach is preferz,ble in improving the solution accuracy of chemical dy- namic optimization problem.

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.

Harmony search algorithm with differential evolution based control parameter co-evolution and its application in chemical process dynamic optimization

A modified harmony search algorithm with co-evolutional control parameters(DEHS), applied through differential evolution optimization, is proposed. In DEHS, two control parameters, i.e., harmony memory considering rate and pitch adjusting rate, are encoded as a symbiotic individual of an original individual(i.e., harmony vector). Harmony search operators are applied to evolving the original population. DE is applied to co-evolving the symbiotic population based on feedback information from the original population. Thus, with the evolution of the original population in DEHS, the symbiotic population is dynamically and self-adaptively adjusted, and real-time optimum control parameters are obtained. The proposed DEHS algorithm has been applied to various benchmark functions and two typical dynamic optimization problems. The experimental results show that the performance of the proposed algorithm is better than that of other HS variants. Satisfactory results are obtained in the application.

An Improved Control Vector Iteration Approach for Nonlinear Dynamic Optimization. II. Problems with Path Constraints

This paper considers dealing with path constraints in the framework of the improved control vector iteration （CVI） approach. Two available ways for enforcing equality path constraints are presented, which can be directly incorporated into the improved CVI approach. Inequality path constraints are much more difficult to deal with, even for small scale problems, because the time intervals where the inequality path constraints are active are unknown in advance. To overcome the challenge, the ll penalty function and a novel smoothing technique are in-troduced, leading to a new effective approach. Moreover, on the basis of the relevant theorems, a numerical algo-rithm is proposed for nonlinear dynamic optimization problems with inequality path constraints. Results obtained from the classic batch reaCtor operation problem are in agreement with the literature reoorts, and the comoutational efficiency is also high.

Solving chemical dynamic optimization problems with ranking-based differential evolution algorithms

Dynamic optimization problems(DOPs) described by differential equations are often encountered in chemical engineering. Deterministic techniques based on mathematic programming become invalid when the models are non-differentiable or explicit mathematical descriptions do not exist. Recently, evolutionary algorithms are gaining popularity for DOPs as they can be used as robust alternatives when the deterministic techniques are invalid. In this article, a technology named ranking-based mutation operator(RMO) is presented to enhance the previous differential evolution(DE) algorithms to solve DOPs using control vector parameterization. In the RMO, better individuals have higher probabilities to produce offspring, which is helpful for the performance enhancement of DE algorithms. Three DE-RMO algorithms are designed by incorporating the RMO. The three DE-RMO algorithms and their three original DE algorithms are applied to solve four constrained DOPs from the literature. Our simulation results indicate that DE-RMO algorithms exhibit better performance than previous non-ranking DE algorithms and other four evolutionary algorithms.

A two-level measurement-based dynamic optimization strategy for a bioreactor in penicillin fermentation process

One measurement-based dynamic optimization scheme can achieve optimality under uncertainties by tracking the necessary condition of optimality(NCO-tracking), with a basic assumption that the solution model remains invariant in the presence of all kinds of uncertainties. This assumption is not satisfied in some cases and the standard NCO-tracking scheme is infeasible. In this paper, a novel two-level NCO-tracking scheme is proposed to deal with this problem. A heuristic criterion is given for triggering outer level compensation procedure to update the solution model once any change is detected via online measurement and estimation. The standard NCO-tracking process is carried out at the inner level based on the updated solution model. The proposed approach is illustrated via a bioreactor in penicillin fermentation process.

Structural Dynamic Optimization for Flexible Beam of Helicopter Rotor Based on GA

As one of the most important steps in the design of bearing-less rotor systems,the design of flexible beam has received much research attention.Because of the very complex working environment of helicopter,the flexible beam should satisfy both the strength and dynamic requirements.However,traditional optimization research focused only on either the strength or dynamical characteristics.To sufficiently improve the performance of the flexible beam,both aspects must be considered.This paper proposes a two-stage optimization method based on the Hamilton variational principle:Variational asymptotic beam section analysis(VABS)program and genetic algorithm(GA).Consequently,a two-part analysis model based on the Hamilton variational principle and VABS is established to calculate section characteristics and structural dynamics characteristics,respectively.Subsequently,the two parts are combined to establish a two-stage optimization process and search with GA to obtain the best dynamic characteristics combinations.Based on the primary optimization results,the section characteristics of the flexible beam are further optimized using GA.The optimization results show that the torsional stiffness decreases by 36.1%compared with the full 0°laying scheme without optimization and the dynamic requirements are achieved.The natural frequencies of flapping and torsion meet the requirements(0.5 away from the passing frequencies of the blade,0.25 away from the excitation force frequency,and the flapping and torsion frequencies keep a corresponding distance).The results indicate that the optimization method can significantly improve the performance of the flexible beam.

An Improved Control Vector Iteration Approach for Nonlinear Dynamic Optimization (Ⅰ) Problems Without Path Constraints

This study proposes an efficient indirect approach for general nonlinear dynamic optimization problems without path constraints. The approach incorporates the virtues both from indirect and direct methods: it solves the optimality conditions like the traditional indirect methods do, but uses a discretization technique inspired from direct methods. Compared with other indirect approaches, the proposed approach has two main advantages: (1) the discretized optimization problem only employs unconstrained nonlinear programming (NLP) algorithms such as BFGS (Broyden-Fletcher-Goldfarb-Shanno), rather than constrained NLP algorithms, therefore the computational efficiency is increased; (2) the relationship between the number of the discretized time intervals and the integration error of the four-step Adams predictor-corrector algorithm is established, thus the minimal number of time intervals that under desired integration tolerance can be estimated. The classic batch reactor problem is tested and compared in detail with literature reports, and the results reveal the effectiveness of the proposed approach. Dealing with path constraints requires extra techniques, and will be studied in the second paper.

Modified Differential Evolution Algorithm for Solving Dynamic Optimization with Existence of Infeasible Environments

Dynamic constrained optimization is a challenging research topic in which the objective function and/or constraints change over time.In such problems,it is commonly assumed that all problem instances are feasible.In reality some instances can be infeasible due to various practical issues,such as a sudden change in resource requirements or a big change in the availability of resources.Decision-makers have to determine whether a particular instance is feasible or not,as infeasible instances cannot be solved as there are no solutions to implement.In this case,locating the nearest feasible solution would be valuable information for the decision-makers.In this paper,a differential evolution algorithm is proposed for solving dynamic constrained problems that learns from past environments and transfers important knowledge from them to use in solving the current instance and includes a mechanism for suggesting a good feasible solution when an instance is infeasible.To judge the performance of the proposed algorithm,13 well-known dynamic test problems were solved.The results indicate that the proposed algorithm outperforms existing recent algorithms with a margin of 79.40%over all the environments and it can also find a good,but infeasible solution,when an instance is infeasible.

Dynamic Optimization Algorithm for Flying Trajectory of a Free flying Space Robot

A new method of dynamic optimization for the flying trajectory of a free flying space robot based on its flying motion characteristics is presented. The continuous flying trajectory is broken into a number of segment and the control efforts and the duration of the segment are chosen as the optimization parameters. The objective function is made by using the weighted sum of the fuel used and the time spent, and the constraint equations are selected. Finally, the internal point punishment function method is adopted in the optimization program, and the results of computer simulation are given.

Decision-Making Model for Farmer Choosing Land Use Based upon Dynamic Optimization Theory

Using the dynamic optimization theory, we described a decision-making model for farmer choosing land use when there are several different kinds of uses for land. To obtain an empirical model that could be easily applied, decision rules for farmer with a single static expectation were given.

Multi-Objective Multi-Variable Large-Size Fan Aerodynamic Optimization by Using Multi-Model Ensemble Optimization Algorithm

The constrained multi-objective multi-variable optimization of fans usually needs a great deal of computational fluid dynamics(CFD)calculations and is time-consuming.In this study,a new multi-model ensemble optimization algorithm is proposed to tackle such an expensive optimization problem.The multi-variable and multi-objective optimization are conducted with a new flexible multi-objective infill criterion.In addition,the search direction is determined by the multi-model ensemble assisted evolutionary algorithm and the feature extraction by the principal component analysis is used to reduce the dimension of optimization variables.First,the proposed algorithm and other two optimization algorithms which prevail in fan optimizations were compared by using test functions.With the same number of objective function evaluations,the proposed algorithm shows a fast convergency rate on finding the optimal objective function values.Then,this algorithm was used to optimize the rotor and stator blades of a large axial fan,with the efficiencies as the objectives at three flow rates,the high,the design and the low flow rate.Forty-two variables were included in the optimization process.The results show that compared with the prototype fan,the total pressure efficiencies of the optimized fan at the high,the design and the low flow rate were increased by 3.35%,3.07%and 2.89%,respectively,after CFD simulations for 500 fan candidates with the constraint for the design pressure.The optimization results validate the effectiveness and feasibility of the proposed algorithm.

Dynamic Manipulability and Optimization of a Two DOF Parallel Mechanism

The dynamic dexterity is an important issue for manipulator design, some indices were proposed for analyzing dynamic dexterity, but they can evaluate the dynamic performance just at one pose in the workspaee of the manipulator, and can＇t be applied to dynamic design expediently. Much work has been done in the kinematic optimization, but the work in the dynamic optimization is much less. A global dynamic condition number index is proposed and applied to the dynamic optimization design the parallel manipulator. This paper deals with the dynamic manipulability and dynamic optimization of a two degree-of-freedom （DOF） parallel manipulator. The particular velocity and particular angular velocity matrices of each moving part about the part＇s pivot point are derived fi＇om the kinematic formulation of the manipulator, and the inertial force and inertial movement are obtained utilizing Newton-Euler formulation, then the inverse dynamic model of the parallel manipulator is proposed based on the virtual work principle. The general inertial ellipsoid and dynamic manipulability ellipsoid are applied to evaluate the dynamic performance of the manipulator, a global dynamic condition number index based on the condition number of general inertial matrix in the workspace is proposed, and then the link lengths of the manipulator is redesigned to optimize the dynamic manipulability by this index. The dynamic manipulability of the origin mechanism and the optimized mechanism are compared, the result shows that the optimized one is much better. The global dynamic condition number index has good effect in evaluating the dynamic dexterity of the whole workspace, and is efficient in the dynamic optimal design of the parallel manipulator.