The Internet of Things (IoT) integrates diverse devices into the Internet infrastructure, including sensors, meters, and wearable devices. Designing efficient IoT networks with these heterogeneous devices requires the...The Internet of Things (IoT) integrates diverse devices into the Internet infrastructure, including sensors, meters, and wearable devices. Designing efficient IoT networks with these heterogeneous devices requires the selection of appropriate routing protocols, which is crucial for maintaining high Quality of Service (QoS). The Internet Engineering Task Force’s Routing Over Low Power and Lossy Networks (IETF ROLL) working group developed the IPv6 Routing Protocol for Low Power and Lossy Networks (RPL) to meet these needs. While the initial RPL standard focused on single-metric route selection, ongoing research explores enhancing RPL by incorporating multiple routing metrics and developing new Objective Functions (OFs). This paper introduces a novel Objective Function (OF), the Reliable and Secure Objective Function (RSOF), designed to enhance the reliability and trustworthiness of parent selection at both the node and link levels within IoT and RPL routing protocols. The RSOF employs an adaptive parent node selection mechanism that incorporates multiple metrics, including Residual Energy (RE), Expected Transmission Count (ETX), Extended RPL Node Trustworthiness (ERNT), and a novel metric that measures node failure rate (NFR). In this mechanism, nodes with a high NFR are excluded from the parent selection process to improve network reliability and stability. The proposed RSOF was evaluated using random and grid topologies in the Cooja Simulator, with tests conducted across small, medium, and large-scale networks to examine the impact of varying node densities. The simulation results indicate a significant improvement in network performance, particularly in terms of average latency, packet acknowledgment ratio (PAR), packet delivery ratio (PDR), and Control Message Overhead (CMO), compared to the standard Minimum Rank with Hysteresis Objective Function (MRHOF).展开更多
Well production optimization is a complex and time-consuming task in the oilfield development.The combination of reservoir numerical simulator with optimization algorithms is usually used to optimize well production.T...Well production optimization is a complex and time-consuming task in the oilfield development.The combination of reservoir numerical simulator with optimization algorithms is usually used to optimize well production.This method spends most of computing time in objective function evaluation by reservoir numerical simulator which limits its optimization efficiency.To improve optimization efficiency,a well production optimization method using streamline features-based objective function and Bayesian adaptive direct search optimization(BADS)algorithm is established.This new objective function,which represents the water flooding potential,is extracted from streamline features.It only needs to call the streamline simulator to run one time step,instead of calling the simulator to calculate the target value at the end of development,which greatly reduces the running time of the simulator.Then the well production optimization model is established and solved by the BADS algorithm.The feasibility of the new objective function and the efficiency of this optimization method are verified by three examples.Results demonstrate that the new objective function is positively correlated with the cumulative oil production.And the BADS algorithm is superior to other common algorithms in convergence speed,solution stability and optimization accuracy.Besides,this method can significantly accelerate the speed of well production optimization process compared with the objective function calculated by other conventional methods.It can provide a more effective basis for determining the optimal well production for actual oilfield development.展开更多
With the development of automation in smart grids,network reconfiguration is becoming a feasible approach for improving the operation of distribution systems.A novel reconfiguration strategy was presented to get the o...With the development of automation in smart grids,network reconfiguration is becoming a feasible approach for improving the operation of distribution systems.A novel reconfiguration strategy was presented to get the optimal configuration of improving economy of the system,and then identifying the important nodes.In this strategy,the objectives increase the node importance degree and decrease the active power loss subjected to operational constraints.A compound objective function with weight coefficients is formulated to balance the conflict of the objectives.Then a novel quantum particle swarm optimization based on loop switches hierarchical encoded was employed to address the compound objective reconfiguration problem.Its main contribution is the presentation of the hierarchical encoded scheme which is used to generate the population swarm particles of representing only radial connected solutions.Because the candidate solutions are feasible,the search efficiency would improve dramatically during the optimization process without tedious topology verification.To validate the proposed strategy,simulations are carried out on the test systems.The results are compared with other techniques in order to evaluate the performance of the proposed method.展开更多
In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a （weakly） LU-efficient solution in the considered nonsmooth multiobjective programming problem with the mult...In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a （weakly） LU-efficient solution in the considered nonsmooth multiobjective programming problem with the multiple interval-objective function. Further, the sufficient optimality conditions for a （weakly） LU-efficient solution and several duality results in Mond-Weir sense are proved under assumptions that the functions constituting the considered nondifferentiable multiobjective programming problem with the multiple interval- objective function are convex.展开更多
To assist readers to have a comprehensive understanding, the classical and intelligent methods roundly based on precursory research achievements are summarized in this paper. First, basic conception and description ab...To assist readers to have a comprehensive understanding, the classical and intelligent methods roundly based on precursory research achievements are summarized in this paper. First, basic conception and description about multi-objective (MO) optimization are introduced. Then some definitions and related terminologies are given. Furthermore several MO optimization methods including classical and current intelligent methods are discussed one by one succinctly. Finally evaluations on advantages and disadvantages about these methods are made at the end of the paper.展开更多
It is believed that whether the instantaneous objective function curves of plug-flow-reactor (PFR) and continuous-stirred-tank-reactor (CSTR) overlap or not, they have a consistent changing trend for complex reactions...It is believed that whether the instantaneous objective function curves of plug-flow-reactor (PFR) and continuous-stirred-tank-reactor (CSTR) overlap or not, they have a consistent changing trend for complex reactions (steady state, isothermal and constant volume). As a result of the relation of the objective functions (selectivity or yield) to the instantaneous objective functions (instantaneous selectivity or instantaneous reaction rate), the optimal reactor network configuration can be determined according to the changing trend of the instantaneous objective function curves. Further, a recent partition strategy for the reactor network synthesis based on the instantaneous objective function characteristic curves is proposed by extending the attainable region partition strategy from the concentration space to the instantaneous objective function-unreacted fraction of key reactant space. In this paper, the instantaneous objective function is closed to be the instantaneous selectivity and several samples are examined to illustrate the proposed method. The comparison with the previous work indicates it is a very convenient and practical systematic tool of the reactor network synthesis and seems also promising for overcoming the dimension limit of the attainable region partition strategy in the concentration space.展开更多
The vibration failure of pipe system of aeroengine seriously influences the safety of aircraft.Its damping design is determined by the selection of the design target,method and their feasibility.Five objective functio...The vibration failure of pipe system of aeroengine seriously influences the safety of aircraft.Its damping design is determined by the selection of the design target,method and their feasibility.Five objective functions for the vibration design of a pipeline or pipe system are introduced,namely,the frequency,amplitude,transfer ratio,curvature and deformation energy as options for the optimization process.The genetic algorithms(GA)are adopted as the opti- mization method,in which the selection of the adaptive genetic operators and the method of implementation of the GA process are crucial.The optimization procedure for all the above ob- jective functions is carried out using GA on the basis of finite element software-MSC/NASTRAN. The optimal solutions of these functions and the stress distribution on the structure are calculated and compared through an example,and their characteristics are analyzed.Finally we put forward two new objective functions,curvature and deformation energy for pipe system optimization.The calculations show that using the curvature as the objective function can reflect the case of minimal stress,and the optimization results using the deformation energy represent lesser and more uni- form stress distribution.The calculation results and process showed that the genetic algorithms can effectively implement damping design of engine pipelines and satisfy the efficient engineering design requirement.展开更多
A method of fuzzy identification based on a new objective function is proposed. The method could deal with the issue that input variables of a system have an effect on the input space while output variables of the sys...A method of fuzzy identification based on a new objective function is proposed. The method could deal with the issue that input variables of a system have an effect on the input space while output variables of the system do not exert an influence on the input space in the proposed objective functions of fuzzy clustering. The method could simultaneously solve the problems about structure identification and parameter estimation; thus it makes the fuzzy model become optimal. Simulation example demonstrates that the method could identify non linear systems and obviously improve modeling accuracy.展开更多
High performance of parallel computing on a message-passing multicomputer System relies on the balance of the workloads located on the processing elements of the System and the minimum communication ovcrheads among th...High performance of parallel computing on a message-passing multicomputer System relies on the balance of the workloads located on the processing elements of the System and the minimum communication ovcrheads among them. Mapping is the technology to partition the problem domain wellbalanced into multiple distinct execution tasks based on some measures. In mapping, a good objective function is the criterion to guarantce the distinct execution tasks equitable. In this paper, we evaluate five categories of those existed objective functions with three different problem subjects using experiments and find an objective function is much suitable for all kinds of problems.展开更多
We are investigating the distributed optimization problem,where a network of nodes works together to minimize a global objective that is a finite sum of their stored local functions.Since nodes exchange optimization p...We are investigating the distributed optimization problem,where a network of nodes works together to minimize a global objective that is a finite sum of their stored local functions.Since nodes exchange optimization parameters through the wireless network,large-scale training models can create communication bottlenecks,resulting in slower training times.To address this issue,CHOCO-SGD was proposed,which allows compressing information with arbitrary precision without reducing the convergence rate for strongly convex objective functions.Nevertheless,most convex functions are not strongly convex(such as logistic regression or Lasso),which raises the question of whether this algorithm can be applied to non-strongly convex functions.In this paper,we provide the first theoretical analysis of the convergence rate of CHOCO-SGD on non-strongly convex objectives.We derive a sufficient condition,which limits the fidelity of compression,to guarantee convergence.Moreover,our analysis demonstrates that within the fidelity threshold,this algorithm can significantly reduce transmission burden while maintaining the same convergence rate order as its no-compression equivalent.Numerical experiments further validate the theoretical findings by demonstrating that CHOCO-SGD improves communication efficiency and keeps the same convergence rate order simultaneously.And experiments also show that the algorithm fails to converge with low compression fidelity and in time-varying topologies.Overall,our study offers valuable insights into the potential applicability of CHOCO-SGD for non-strongly convex objectives.Additionally,we provide practical guidelines for researchers seeking to utilize this algorithm in real-world scenarios.展开更多
The traditional linear programming model is deterministic. The way that uncertainty is handled is to compute the range of optimality. After the optimal solution is obtained, typically by the simplex method, one consid...The traditional linear programming model is deterministic. The way that uncertainty is handled is to compute the range of optimality. After the optimal solution is obtained, typically by the simplex method, one considers the effect of varying each objective function coefficient, one at a time. This yields the range of optimality within which the decision variables remain constant. This sensitivity analysis is useful for helping the analyst get a sense for the problem. However, it is unrealistic because objective function coefficients tend not to stand still. They are typically profit contributions from products sold and are subject to randomly varying selling prices. In this paper, a realistic linear program is created for simultaneously randomizing the coefficients from any probability distribution. Furthermore, we present a novel approach for designing a copula of random objective function coefficients according to a specified rank correlation. The corresponding distribution of objective function values is created. This distribution is examined directly for central tendency, spread, skewness and extreme values for the purpose of risk analysis. This enables risk analysis and business analytics, emerging topics in education and preparation for the knowledge economy.展开更多
Dear Editor,This letter addresses the impulse game problem for a general scope of deterministic,multi-player,nonzero-sum differential games wherein all participants adopt impulse controls.Our objective is to formulate...Dear Editor,This letter addresses the impulse game problem for a general scope of deterministic,multi-player,nonzero-sum differential games wherein all participants adopt impulse controls.Our objective is to formulate this impulse game problem with the modified objective function including interaction costs among the players in a discontinuous fashion,and subsequently,to derive a verification theorem for identifying the feedback Nash equilibrium strategy.展开更多
Dear Editor,This letter investigates predefined-time optimization problems(OPs) of multi-agent systems(MASs), where the agent of MASs is subject to inequality constraints, and the team objective function accounts for ...Dear Editor,This letter investigates predefined-time optimization problems(OPs) of multi-agent systems(MASs), where the agent of MASs is subject to inequality constraints, and the team objective function accounts for impulse effects. Firstly, to address the inequality constraints,the penalty method is introduced. Then, a novel optimization strategy is developed, which only requires that the team objective function be strongly convex.展开更多
Dear Editor,This letter addresses distributed optimization for resource allocation problems with time-varying objective functions and time-varying constraints.Inspired by the distributed average tracking(DAT)approach,...Dear Editor,This letter addresses distributed optimization for resource allocation problems with time-varying objective functions and time-varying constraints.Inspired by the distributed average tracking(DAT)approach,a distributed control protocol is proposed for optimal resource allocation.The convergence to a time-varying optimal solution within a predefined time is proved.Two numerical examples are given to illustrate the effectiveness of the proposed approach.展开更多
Full-waveform inversion(FWI)utilizes optimization methods to recover an optimal Earth model to best fit the observed seismic record in a sense of a predefined norm.Since FWI combines mathematic inversion and full-wave...Full-waveform inversion(FWI)utilizes optimization methods to recover an optimal Earth model to best fit the observed seismic record in a sense of a predefined norm.Since FWI combines mathematic inversion and full-wave equations,it has been recognized as one of the key methods for seismic data imaging and Earth model building in the fields of global/regional and exploration seismology.Unfortunately,conventional FWI fixes background velocity mainly relying on refraction and turning waves that are commonly rich in large offsets.By contrast,reflections in the short offsets mainly contribute to the reconstruction of the high-resolution interfaces.Restricted by acquisition geometries,refractions and turning waves in the record usually have limited penetration depth,which may not reach oil/gas reservoirs.Thus,reflections in the record are the only source that carries the information of these reservoirs.Consequently,it is meaningful to develop reflection-waveform inversion(RWI)that utilizes reflections to recover background velocity including the deep part of the model.This review paper includes:analyzing the weaknesses of FWI when inverting reflections;overviewing the principles of RWI,including separation of the tomography and migration components,the objective functions,constraints;summarizing the current status of the technique of RWI;outlooking the future of RWI.展开更多
Abstract A first study on the continuous adjoint formulation for aerodynamic optimization design of high pressure turbines based on S2 surface governed by the Euler equations with source terms is presented. The object...Abstract A first study on the continuous adjoint formulation for aerodynamic optimization design of high pressure turbines based on S2 surface governed by the Euler equations with source terms is presented. The objective function is defined as an integral function along the boundaries, and the adjoint equations and the boundary conditions are derived by introducing the adjoint variable vec- tors. The gradient expression of the objective function then includes only the terms related to phys- ical shape variations. The numerical solution of the adjoint equation is conducted by a finite- difference method with the Jameson spatial scheme employing the first and the third order dissipa- tive fluxes. A gradient-based aerodynamic optimization system is established by integrating the blade stagger angles, the stacking lines and the passage perturbation parameterization with the quasi-Newton method of Broyden Fletcher Goldfarb-Shanno （BFGS）. The application of the continuous adjoint method is validated through a single stage high pressure turbine optimization case. The adiabatic efficiency increases from 0.8875 to 0.8931, whilst the mass flow rate and the pressure ratio remain almost unchanged. The optimization design is shown to reduce the passage vortex loss as well as the mixing loss due to the cooling air injection.展开更多
The kinematic redundancy in a robot leads to an infinite number of solutions for inverse kinematics, which implies the possibility to select a 'best' solution according to an optimization criterion. In this pa...The kinematic redundancy in a robot leads to an infinite number of solutions for inverse kinematics, which implies the possibility to select a 'best' solution according to an optimization criterion. In this paper, two optimization objective functions are proposed, aiming at either minimizing extra degrees of freedom (DOFs) or minimizing the total potential energy of a multilink redundant robot. Physical constraints of either equality or inequality types are taken into consideration in the objective functions. Since the closed-form solutions do not exist in general for highly nonlinear and constrained optimization problems, we adopt and develop two numerical methods, which are verified to be effective and precise in solving the two optimization problems associated with the redundant inverse kinematics. We first verify that the well established trajectory following method can precisely solve the two optimization problems, but is computation intensive. To reduce the computation time, a sequential approach that combines the sequential quadratic programming and iterative Newton-Raphson algorithm is developed. A 4-DOF Fujitsu Hoap-1 humanoid robot arm is used as a prototype to validate the effectiveness of the proposed optimization solutions.展开更多
The dynamic finite element model （FEM） of a prestressed concrete continuous box-girder bridge, called the Tongyang Canal Bridge, is built and updated based on the results of ambient vibration testing （AVT） using a...The dynamic finite element model （FEM） of a prestressed concrete continuous box-girder bridge, called the Tongyang Canal Bridge, is built and updated based on the results of ambient vibration testing （AVT） using a real-coded accelerating genetic algorithm （RAGA）. The objective functions are defined based on natural frequency and modal assurance criterion （MAC） metrics to evaluate the updated FEM. Two objective functions are defined to fully account for the relative errors and standard deviations of the natural frequencies and MAC between the AVT results and the updated FEM predictions. The dynamically updated FEM of the bridge can better represent its structural dynamics and serve as a baseline in long-term health monitoring, condition assessment and damage identification over the service life of the bridge .展开更多
In structural simulation and design,an accurate computational model directly determines the effectiveness of performance evaluation.To establish a high-fidelity dynamic model of a complex assembled structure,a Hierarc...In structural simulation and design,an accurate computational model directly determines the effectiveness of performance evaluation.To establish a high-fidelity dynamic model of a complex assembled structure,a Hierarchical Model Updating Strategy(HMUS)is developed for Finite Element(FE)model updating with regard to uncorrelated modes.The principle of HMUS is first elaborated by integrating hierarchical modeling concept,model updating technology with proper uncorrelated mode treatment,and parametric modeling.In the developed strategy,the correct correlated mode pairs amongst the uncorrelated modes are identified by an error minimization procedure.The proposed updating technique is validated by the dynamic FE model updating of a simple fixed–fixed beam.The proposed HMUS is then applied to the FE model updating of an aeroengine stator system(casings)to demonstrate its effectiveness.Our studies reveal that(A)parametric modeling technique is able to build an efficient equivalent model by simplifying complex structure in geometry while ensuring the consistency of mechanical characteristics;(B)the developed model updating technique efficiently processes the uncorrelated modes and precisely identifies correct Correlated Mode Pairs(CMPs)between FE model and experiment;(C)the proposed HMUS is accurate and efficient in the FE model updating of complex assembled structures such as aeroengine casings with large-scale model,complex geometry,high-nonlinearity and numerous parameters;(D)it is appropriate to update a complex structural FE model parameterized.The efforts of this study provide an efficient updating strategy for the dynamic model updating of complex assembled structures with experimental test data,which is promising to promote the precision and feasibility of simulation-based design optimization and performance evaluation of complex structures.展开更多
the routing protocol for low-power and lossy networks(RPL) has been used in advanced metering infrastructure(AMI)which could provide two-way communication between smart meters and city utilities.To improve the network...the routing protocol for low-power and lossy networks(RPL) has been used in advanced metering infrastructure(AMI)which could provide two-way communication between smart meters and city utilities.To improve the network performance of AMI networks, this paper proposed an improved algorithm of RPL based on triangle module operator(IAR-TMO). IAR-TMO proposes membership functions of the following five typical routing metrics: end-to-end delay, number of hops, expected transmission count(ETX),node remaining energy, and child node count.Moreover, IAR-TMO uses triangle module operator to fuse membership functions of these routing metrics. Then, IAR-TMO selects preferred parents(the next hop) based on the triangle module operator. Theoretical analysis and simulation results show that IAR-TMO has a great improvement when compared with two recent representative algorithms: ETXOF(ETX Objective Function) and OF-FL(Objective Function based on Fuzzy Logic), in terms of network lifetime, average end-to-end delay,etc. Consequently, the network performances of AMI networks can be improved effectively.展开更多
文摘The Internet of Things (IoT) integrates diverse devices into the Internet infrastructure, including sensors, meters, and wearable devices. Designing efficient IoT networks with these heterogeneous devices requires the selection of appropriate routing protocols, which is crucial for maintaining high Quality of Service (QoS). The Internet Engineering Task Force’s Routing Over Low Power and Lossy Networks (IETF ROLL) working group developed the IPv6 Routing Protocol for Low Power and Lossy Networks (RPL) to meet these needs. While the initial RPL standard focused on single-metric route selection, ongoing research explores enhancing RPL by incorporating multiple routing metrics and developing new Objective Functions (OFs). This paper introduces a novel Objective Function (OF), the Reliable and Secure Objective Function (RSOF), designed to enhance the reliability and trustworthiness of parent selection at both the node and link levels within IoT and RPL routing protocols. The RSOF employs an adaptive parent node selection mechanism that incorporates multiple metrics, including Residual Energy (RE), Expected Transmission Count (ETX), Extended RPL Node Trustworthiness (ERNT), and a novel metric that measures node failure rate (NFR). In this mechanism, nodes with a high NFR are excluded from the parent selection process to improve network reliability and stability. The proposed RSOF was evaluated using random and grid topologies in the Cooja Simulator, with tests conducted across small, medium, and large-scale networks to examine the impact of varying node densities. The simulation results indicate a significant improvement in network performance, particularly in terms of average latency, packet acknowledgment ratio (PAR), packet delivery ratio (PDR), and Control Message Overhead (CMO), compared to the standard Minimum Rank with Hysteresis Objective Function (MRHOF).
基金supported partly by the National Science and Technology Major Project of China(Grant No.2016ZX05025-001006)Major Science and Technology Project of CNPC(Grant No.ZD2019-183-007)
文摘Well production optimization is a complex and time-consuming task in the oilfield development.The combination of reservoir numerical simulator with optimization algorithms is usually used to optimize well production.This method spends most of computing time in objective function evaluation by reservoir numerical simulator which limits its optimization efficiency.To improve optimization efficiency,a well production optimization method using streamline features-based objective function and Bayesian adaptive direct search optimization(BADS)algorithm is established.This new objective function,which represents the water flooding potential,is extracted from streamline features.It only needs to call the streamline simulator to run one time step,instead of calling the simulator to calculate the target value at the end of development,which greatly reduces the running time of the simulator.Then the well production optimization model is established and solved by the BADS algorithm.The feasibility of the new objective function and the efficiency of this optimization method are verified by three examples.Results demonstrate that the new objective function is positively correlated with the cumulative oil production.And the BADS algorithm is superior to other common algorithms in convergence speed,solution stability and optimization accuracy.Besides,this method can significantly accelerate the speed of well production optimization process compared with the objective function calculated by other conventional methods.It can provide a more effective basis for determining the optimal well production for actual oilfield development.
基金Project(61102039)supported by the National Natural Science Foundation of ChinaProject(2014AA052600)supported by National Hi-tech Research and Development Plan,China
文摘With the development of automation in smart grids,network reconfiguration is becoming a feasible approach for improving the operation of distribution systems.A novel reconfiguration strategy was presented to get the optimal configuration of improving economy of the system,and then identifying the important nodes.In this strategy,the objectives increase the node importance degree and decrease the active power loss subjected to operational constraints.A compound objective function with weight coefficients is formulated to balance the conflict of the objectives.Then a novel quantum particle swarm optimization based on loop switches hierarchical encoded was employed to address the compound objective reconfiguration problem.Its main contribution is the presentation of the hierarchical encoded scheme which is used to generate the population swarm particles of representing only radial connected solutions.Because the candidate solutions are feasible,the search efficiency would improve dramatically during the optimization process without tedious topology verification.To validate the proposed strategy,simulations are carried out on the test systems.The results are compared with other techniques in order to evaluate the performance of the proposed method.
文摘In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a （weakly） LU-efficient solution in the considered nonsmooth multiobjective programming problem with the multiple interval-objective function. Further, the sufficient optimality conditions for a （weakly） LU-efficient solution and several duality results in Mond-Weir sense are proved under assumptions that the functions constituting the considered nondifferentiable multiobjective programming problem with the multiple interval- objective function are convex.
文摘To assist readers to have a comprehensive understanding, the classical and intelligent methods roundly based on precursory research achievements are summarized in this paper. First, basic conception and description about multi-objective (MO) optimization are introduced. Then some definitions and related terminologies are given. Furthermore several MO optimization methods including classical and current intelligent methods are discussed one by one succinctly. Finally evaluations on advantages and disadvantages about these methods are made at the end of the paper.
基金Supported by the National Natural Science Foundation of China (No. 29776028, No. 29836140).
文摘It is believed that whether the instantaneous objective function curves of plug-flow-reactor (PFR) and continuous-stirred-tank-reactor (CSTR) overlap or not, they have a consistent changing trend for complex reactions (steady state, isothermal and constant volume). As a result of the relation of the objective functions (selectivity or yield) to the instantaneous objective functions (instantaneous selectivity or instantaneous reaction rate), the optimal reactor network configuration can be determined according to the changing trend of the instantaneous objective function curves. Further, a recent partition strategy for the reactor network synthesis based on the instantaneous objective function characteristic curves is proposed by extending the attainable region partition strategy from the concentration space to the instantaneous objective function-unreacted fraction of key reactant space. In this paper, the instantaneous objective function is closed to be the instantaneous selectivity and several samples are examined to illustrate the proposed method. The comparison with the previous work indicates it is a very convenient and practical systematic tool of the reactor network synthesis and seems also promising for overcoming the dimension limit of the attainable region partition strategy in the concentration space.
基金Project supported by Shenyang Aviation Engine Institute of Aviation Industrial Group(No.2483-9704).
文摘The vibration failure of pipe system of aeroengine seriously influences the safety of aircraft.Its damping design is determined by the selection of the design target,method and their feasibility.Five objective functions for the vibration design of a pipeline or pipe system are introduced,namely,the frequency,amplitude,transfer ratio,curvature and deformation energy as options for the optimization process.The genetic algorithms(GA)are adopted as the opti- mization method,in which the selection of the adaptive genetic operators and the method of implementation of the GA process are crucial.The optimization procedure for all the above ob- jective functions is carried out using GA on the basis of finite element software-MSC/NASTRAN. The optimal solutions of these functions and the stress distribution on the structure are calculated and compared through an example,and their characteristics are analyzed.Finally we put forward two new objective functions,curvature and deformation energy for pipe system optimization.The calculations show that using the curvature as the objective function can reflect the case of minimal stress,and the optimization results using the deformation energy represent lesser and more uni- form stress distribution.The calculation results and process showed that the genetic algorithms can effectively implement damping design of engine pipelines and satisfy the efficient engineering design requirement.
文摘A method of fuzzy identification based on a new objective function is proposed. The method could deal with the issue that input variables of a system have an effect on the input space while output variables of the system do not exert an influence on the input space in the proposed objective functions of fuzzy clustering. The method could simultaneously solve the problems about structure identification and parameter estimation; thus it makes the fuzzy model become optimal. Simulation example demonstrates that the method could identify non linear systems and obviously improve modeling accuracy.
文摘High performance of parallel computing on a message-passing multicomputer System relies on the balance of the workloads located on the processing elements of the System and the minimum communication ovcrheads among them. Mapping is the technology to partition the problem domain wellbalanced into multiple distinct execution tasks based on some measures. In mapping, a good objective function is the criterion to guarantce the distinct execution tasks equitable. In this paper, we evaluate five categories of those existed objective functions with three different problem subjects using experiments and find an objective function is much suitable for all kinds of problems.
基金supported in part by the Shanghai Natural Science Foundation under the Grant 22ZR1407000.
文摘We are investigating the distributed optimization problem,where a network of nodes works together to minimize a global objective that is a finite sum of their stored local functions.Since nodes exchange optimization parameters through the wireless network,large-scale training models can create communication bottlenecks,resulting in slower training times.To address this issue,CHOCO-SGD was proposed,which allows compressing information with arbitrary precision without reducing the convergence rate for strongly convex objective functions.Nevertheless,most convex functions are not strongly convex(such as logistic regression or Lasso),which raises the question of whether this algorithm can be applied to non-strongly convex functions.In this paper,we provide the first theoretical analysis of the convergence rate of CHOCO-SGD on non-strongly convex objectives.We derive a sufficient condition,which limits the fidelity of compression,to guarantee convergence.Moreover,our analysis demonstrates that within the fidelity threshold,this algorithm can significantly reduce transmission burden while maintaining the same convergence rate order as its no-compression equivalent.Numerical experiments further validate the theoretical findings by demonstrating that CHOCO-SGD improves communication efficiency and keeps the same convergence rate order simultaneously.And experiments also show that the algorithm fails to converge with low compression fidelity and in time-varying topologies.Overall,our study offers valuable insights into the potential applicability of CHOCO-SGD for non-strongly convex objectives.Additionally,we provide practical guidelines for researchers seeking to utilize this algorithm in real-world scenarios.
文摘The traditional linear programming model is deterministic. The way that uncertainty is handled is to compute the range of optimality. After the optimal solution is obtained, typically by the simplex method, one considers the effect of varying each objective function coefficient, one at a time. This yields the range of optimality within which the decision variables remain constant. This sensitivity analysis is useful for helping the analyst get a sense for the problem. However, it is unrealistic because objective function coefficients tend not to stand still. They are typically profit contributions from products sold and are subject to randomly varying selling prices. In this paper, a realistic linear program is created for simultaneously randomizing the coefficients from any probability distribution. Furthermore, we present a novel approach for designing a copula of random objective function coefficients according to a specified rank correlation. The corresponding distribution of objective function values is created. This distribution is examined directly for central tendency, spread, skewness and extreme values for the purpose of risk analysis. This enables risk analysis and business analytics, emerging topics in education and preparation for the knowledge economy.
基金supported in part by the National Natural Science Foundation of China(62173051)the Fundamental Research Funds for the Central Universities(2024CDJCGJ012,2023CDJXY-010)+1 种基金the Chongqing Technology Innovation and Application Development Special Key Project(CSTB2022TIADCUX0015,CSTB2022TIAD-KPX0162)the China Postdoctoral Science Foundation(2024M763865)
文摘Dear Editor,This letter addresses the impulse game problem for a general scope of deterministic,multi-player,nonzero-sum differential games wherein all participants adopt impulse controls.Our objective is to formulate this impulse game problem with the modified objective function including interaction costs among the players in a discontinuous fashion,and subsequently,to derive a verification theorem for identifying the feedback Nash equilibrium strategy.
基金supported in part by the National Natural Science Foundation of China(62276119)the Natural Science Foundation of Jiangsu Province(BK20241764)the Postgraduate Research & Practice Innovation Program of Jiangsu Province(KYCX22_2860)
文摘Dear Editor,This letter investigates predefined-time optimization problems(OPs) of multi-agent systems(MASs), where the agent of MASs is subject to inequality constraints, and the team objective function accounts for impulse effects. Firstly, to address the inequality constraints,the penalty method is introduced. Then, a novel optimization strategy is developed, which only requires that the team objective function be strongly convex.
基金supported by National Key Research and Development Program of China(2024YFE0214000)National Natural Science Foundation of China(62173308)+3 种基金Natural Science Foundation of Zhejiang Province of China(LRG25F030002)Zhejiang Province Leading Geese Plan(2025C01056)Jinhua Science and Technology Project(2022-1-042)Natural Science Foundation of Jiangsu Province(BK20240009).
文摘Dear Editor,This letter addresses distributed optimization for resource allocation problems with time-varying objective functions and time-varying constraints.Inspired by the distributed average tracking(DAT)approach,a distributed control protocol is proposed for optimal resource allocation.The convergence to a time-varying optimal solution within a predefined time is proved.Two numerical examples are given to illustrate the effectiveness of the proposed approach.
基金supported by National Key R&D Program of China(No.2018YFA0702502)NSFC(Grant No.41974142)Science Foundation of China University of petroleum,Beijing(No.2462019YJRC005).
文摘Full-waveform inversion(FWI)utilizes optimization methods to recover an optimal Earth model to best fit the observed seismic record in a sense of a predefined norm.Since FWI combines mathematic inversion and full-wave equations,it has been recognized as one of the key methods for seismic data imaging and Earth model building in the fields of global/regional and exploration seismology.Unfortunately,conventional FWI fixes background velocity mainly relying on refraction and turning waves that are commonly rich in large offsets.By contrast,reflections in the short offsets mainly contribute to the reconstruction of the high-resolution interfaces.Restricted by acquisition geometries,refractions and turning waves in the record usually have limited penetration depth,which may not reach oil/gas reservoirs.Thus,reflections in the record are the only source that carries the information of these reservoirs.Consequently,it is meaningful to develop reflection-waveform inversion(RWI)that utilizes reflections to recover background velocity including the deep part of the model.This review paper includes:analyzing the weaknesses of FWI when inverting reflections;overviewing the principles of RWI,including separation of the tomography and migration components,the objective functions,constraints;summarizing the current status of the technique of RWI;outlooking the future of RWI.
基金funded by the Aeronautical Science Foundation of China–China(No.2010ZB51023)
文摘Abstract A first study on the continuous adjoint formulation for aerodynamic optimization design of high pressure turbines based on S2 surface governed by the Euler equations with source terms is presented. The objective function is defined as an integral function along the boundaries, and the adjoint equations and the boundary conditions are derived by introducing the adjoint variable vec- tors. The gradient expression of the objective function then includes only the terms related to phys- ical shape variations. The numerical solution of the adjoint equation is conducted by a finite- difference method with the Jameson spatial scheme employing the first and the third order dissipa- tive fluxes. A gradient-based aerodynamic optimization system is established by integrating the blade stagger angles, the stacking lines and the passage perturbation parameterization with the quasi-Newton method of Broyden Fletcher Goldfarb-Shanno （BFGS）. The application of the continuous adjoint method is validated through a single stage high pressure turbine optimization case. The adiabatic efficiency increases from 0.8875 to 0.8931, whilst the mass flow rate and the pressure ratio remain almost unchanged. The optimization design is shown to reduce the passage vortex loss as well as the mixing loss due to the cooling air injection.
文摘The kinematic redundancy in a robot leads to an infinite number of solutions for inverse kinematics, which implies the possibility to select a 'best' solution according to an optimization criterion. In this paper, two optimization objective functions are proposed, aiming at either minimizing extra degrees of freedom (DOFs) or minimizing the total potential energy of a multilink redundant robot. Physical constraints of either equality or inequality types are taken into consideration in the objective functions. Since the closed-form solutions do not exist in general for highly nonlinear and constrained optimization problems, we adopt and develop two numerical methods, which are verified to be effective and precise in solving the two optimization problems associated with the redundant inverse kinematics. We first verify that the well established trajectory following method can precisely solve the two optimization problems, but is computation intensive. To reduce the computation time, a sequential approach that combines the sequential quadratic programming and iterative Newton-Raphson algorithm is developed. A 4-DOF Fujitsu Hoap-1 humanoid robot arm is used as a prototype to validate the effectiveness of the proposed optimization solutions.
基金National Natural Science Foundation of China Under Grant No.50575101Transportation Science Research Item of Jiangsu Province Under Grant No.06Y20
文摘The dynamic finite element model （FEM） of a prestressed concrete continuous box-girder bridge, called the Tongyang Canal Bridge, is built and updated based on the results of ambient vibration testing （AVT） using a real-coded accelerating genetic algorithm （RAGA）. The objective functions are defined based on natural frequency and modal assurance criterion （MAC） metrics to evaluate the updated FEM. Two objective functions are defined to fully account for the relative errors and standard deviations of the natural frequencies and MAC between the AVT results and the updated FEM predictions. The dynamically updated FEM of the bridge can better represent its structural dynamics and serve as a baseline in long-term health monitoring, condition assessment and damage identification over the service life of the bridge .
基金co-supported by National Natural Science Foundation of China(No.51975124)Shanghai International Cooperation Project of One Belt and One Road of China(No.20110741700)Major Research Special Project of Aeroengine and Gas Turbine of China(No.J2019-IV-0016)。
文摘In structural simulation and design,an accurate computational model directly determines the effectiveness of performance evaluation.To establish a high-fidelity dynamic model of a complex assembled structure,a Hierarchical Model Updating Strategy(HMUS)is developed for Finite Element(FE)model updating with regard to uncorrelated modes.The principle of HMUS is first elaborated by integrating hierarchical modeling concept,model updating technology with proper uncorrelated mode treatment,and parametric modeling.In the developed strategy,the correct correlated mode pairs amongst the uncorrelated modes are identified by an error minimization procedure.The proposed updating technique is validated by the dynamic FE model updating of a simple fixed–fixed beam.The proposed HMUS is then applied to the FE model updating of an aeroengine stator system(casings)to demonstrate its effectiveness.Our studies reveal that(A)parametric modeling technique is able to build an efficient equivalent model by simplifying complex structure in geometry while ensuring the consistency of mechanical characteristics;(B)the developed model updating technique efficiently processes the uncorrelated modes and precisely identifies correct Correlated Mode Pairs(CMPs)between FE model and experiment;(C)the proposed HMUS is accurate and efficient in the FE model updating of complex assembled structures such as aeroengine casings with large-scale model,complex geometry,high-nonlinearity and numerous parameters;(D)it is appropriate to update a complex structural FE model parameterized.The efforts of this study provide an efficient updating strategy for the dynamic model updating of complex assembled structures with experimental test data,which is promising to promote the precision and feasibility of simulation-based design optimization and performance evaluation of complex structures.
基金supported by the Beijing Laboratory of Advanced Information Networks
文摘the routing protocol for low-power and lossy networks(RPL) has been used in advanced metering infrastructure(AMI)which could provide two-way communication between smart meters and city utilities.To improve the network performance of AMI networks, this paper proposed an improved algorithm of RPL based on triangle module operator(IAR-TMO). IAR-TMO proposes membership functions of the following five typical routing metrics: end-to-end delay, number of hops, expected transmission count(ETX),node remaining energy, and child node count.Moreover, IAR-TMO uses triangle module operator to fuse membership functions of these routing metrics. Then, IAR-TMO selects preferred parents(the next hop) based on the triangle module operator. Theoretical analysis and simulation results show that IAR-TMO has a great improvement when compared with two recent representative algorithms: ETXOF(ETX Objective Function) and OF-FL(Objective Function based on Fuzzy Logic), in terms of network lifetime, average end-to-end delay,etc. Consequently, the network performances of AMI networks can be improved effectively.
