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 ...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.展开更多
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. Bas...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.展开更多
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 individua...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.展开更多
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 ...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.展开更多
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....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 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 para...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.展开更多
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- ab...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.展开更多
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 w...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.展开更多
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 rat...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.展开更多
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 dir...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.展开更多
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-di...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.展开更多
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 inv...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.展开更多
Recently,genetic algorithms(GAs) have been applied to multi-modal dynamic optimization(MDO).In this kind of optimization,an algorithm is required not only to find the multiple optimal solutions but also to locate a dy...Recently,genetic algorithms(GAs) have been applied to multi-modal dynamic optimization(MDO).In this kind of optimization,an algorithm is required not only to find the multiple optimal solutions but also to locate a dynamically changing optimum.Our fuzzy genetic sharing(FGS) approach is based on a novel genetic algorithm with dynamic niche sharing(GADNS).FGS finds the optimal solutions,while maintaining the diversity of the population.For this,FGS uses several strategies.First,an unsupervised fuzzy clustering method is used to track multiple optima and perform GADNS.Second,a modified tournament selection is used to control selection pressure.Third,a novel mutation with an adaptive mutation rate is used to locate unexplored search areas.The effectiveness of FGS in dynamic environments is demonstrated using the generalized dynamic benchmark generator(GDBG).展开更多
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 flexibl...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.展开更多
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 t...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.展开更多
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 r...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.展开更多
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 ...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.展开更多
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 appli...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.展开更多
Cloud computing has become an essential technology for the management and processing of large datasets,offering scalability,high availability,and fault tolerance.However,optimizing data replication across multiple dat...Cloud computing has become an essential technology for the management and processing of large datasets,offering scalability,high availability,and fault tolerance.However,optimizing data replication across multiple data centers poses a significant challenge,especially when balancing opposing goals such as latency,storage costs,energy consumption,and network efficiency.This study introduces a novel Dynamic Optimization Algorithm called Dynamic Multi-Objective Gannet Optimization(DMGO),designed to enhance data replication efficiency in cloud environments.Unlike traditional static replication systems,DMGO adapts dynamically to variations in network conditions,system demand,and resource availability.The approach utilizes multi-objective optimization approaches to efficiently balance data access latency,storage efficiency,and operational costs.DMGO consistently evaluates data center performance and adjusts replication algorithms in real time to guarantee optimal system efficiency.Experimental evaluations conducted in a simulated cloud environment demonstrate that DMGO significantly outperforms conventional static algorithms,achieving faster data access,lower storage overhead,reduced energy consumption,and improved scalability.The proposed methodology offers a robust and adaptable solution for modern cloud systems,ensuring efficient resource consumption while maintaining high performance.展开更多
基金Supported by the National Key Basic Research Program of China("973"Project)(2009CB724401)the China Postdoctoral Science Foundation(20070420208)the Postdoctoral Innovation Foundation of Shandong Province(200702023)~~
文摘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.
文摘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.
基金Project(2013CB733600) supported by the National Basic Research Program of ChinaProject(21176073) supported by the National Natural Science Foundation of China+2 种基金Project(20090074110005) supported by Doctoral Fund of Ministry of Education of ChinaProject(NCET-09-0346) supported by Program for New Century Excellent Talents in University of ChinaProject(09SG29) supported by "Shu Guang", China
文摘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.
基金Supported by Major State Basic Research Development Program of China （2012CB720500）, National Natural Science Foundation of China （Key Program： Ul162202）, National Science Fund for Outstanding Young Scholars （61222303）, National Natural Science Foundation of China （21276078, 21206037） and the Fundamental Research Funds for the Central Universities.
文摘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.
文摘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.
基金supported by National Natural Science Foundation of China (Grant No. 50675095)
文摘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.
基金Supported by the Joint Funds of NSFC-CNPC of China(U1162130)the International Cooperation and Exchange Project of Science and Technology Department of Zhejiang Province(2009C34008)+1 种基金the National High Technology Research and Development Program of China(2006AA05Z226)the Zhejiang Provincial Natural Science Foundation for Distinguished Young Scientists(R4100133)
文摘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.
基金Supported by the Major State Basic Research Development Program of China(2012CB720500)the National Natural Science Foundation of China(Key Program:U1162202)+2 种基金the National Science Fund for Outstanding Young Scholars(61222303)the National Natural Science Foundation of China(61174118,21206037)Shanghai Leading Academic Discipline Project(B504)
文摘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.
基金Project(2013CB733605)supported by the National Basic Research Program of ChinaProject(21176073)supported by the National Natural Science Foundation of China
文摘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.
基金Supported by the National Natural Science Foundation of China(U1162130)the National High Technology Research and Development Program of China(2006AA05Z226)Outstanding Youth Science Foundation of Zhejiang Province(R4100133)
文摘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.
基金Supported by the National Natural Science Foundation of China(61333010,61134007and 21276078)“Shu Guang”project of Shanghai Municipal Education Commission,the Research Talents Startup Foundation of Jiangsu University(15JDG139)China Postdoctoral Science Foundation(2016M591783)
文摘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.
基金Supported by the National Natural Science Foundation of China(61174114)the Research Fund for the Doctoral Program of Higher Education in China(20120101130016)the Scholarship Award for Excellent Doctoral Student granted by Ministry of Education
文摘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.
文摘Recently,genetic algorithms(GAs) have been applied to multi-modal dynamic optimization(MDO).In this kind of optimization,an algorithm is required not only to find the multiple optimal solutions but also to locate a dynamically changing optimum.Our fuzzy genetic sharing(FGS) approach is based on a novel genetic algorithm with dynamic niche sharing(GADNS).FGS finds the optimal solutions,while maintaining the diversity of the population.For this,FGS uses several strategies.First,an unsupervised fuzzy clustering method is used to track multiple optima and perform GADNS.Second,a modified tournament selection is used to control selection pressure.Third,a novel mutation with an adaptive mutation rate is used to locate unexplored search areas.The effectiveness of FGS in dynamic environments is demonstrated using the generalized dynamic benchmark generator(GDBG).
基金supported by the Foundation of National Key Laboratory of Rotorcraft Aeromechanics,Nanjing University of Aeronautics and Astronautics(No.614222004030917)。
文摘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.
基金Supported by the National Natural Science Foundation of China (U1162130)the National High Technology Research and Development Program of China (2006AA05Z226)the Outstanding Youth Science Foundation,Zhejiang Province (R4100133)
文摘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.
基金supported by the Australian Research Council Discovery Project(Grant Nos.DP210102939).
文摘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.
文摘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.
文摘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.
文摘Cloud computing has become an essential technology for the management and processing of large datasets,offering scalability,high availability,and fault tolerance.However,optimizing data replication across multiple data centers poses a significant challenge,especially when balancing opposing goals such as latency,storage costs,energy consumption,and network efficiency.This study introduces a novel Dynamic Optimization Algorithm called Dynamic Multi-Objective Gannet Optimization(DMGO),designed to enhance data replication efficiency in cloud environments.Unlike traditional static replication systems,DMGO adapts dynamically to variations in network conditions,system demand,and resource availability.The approach utilizes multi-objective optimization approaches to efficiently balance data access latency,storage efficiency,and operational costs.DMGO consistently evaluates data center performance and adjusts replication algorithms in real time to guarantee optimal system efficiency.Experimental evaluations conducted in a simulated cloud environment demonstrate that DMGO significantly outperforms conventional static algorithms,achieving faster data access,lower storage overhead,reduced energy consumption,and improved scalability.The proposed methodology offers a robust and adaptable solution for modern cloud systems,ensuring efficient resource consumption while maintaining high performance.
