To improve the efficiency of gate reassignment and optimize the plan of gate reassignment,the concept of disruption management is introduced,and a multi-objective programming model for airport gate reassignment is pro...To improve the efficiency of gate reassignment and optimize the plan of gate reassignment,the concept of disruption management is introduced,and a multi-objective programming model for airport gate reassignment is proposed.Considering the interests of passengers and the airport,the model minimizes the total flight delay,the total passengers′walking distance and the number of flights reassigned to other gates different from the planned ones.According to the characteristics of the gate reassignment,the model is simplified.As the multi-objective programming model is hard to reach the optimal solutions simultaneously,a threshold of satisfactory solutions of the model is set.Then a simulated annealing algorithm is designed for the model.Case studies show that the model decreases the total flight delay to the satisfactory solutions,and minimizes the total passengers′walking distance.The least change of planned assignment is also reached.The results achieve the goals of disruption management.Therefore,the model is verified to be effective.展开更多
In this paper, some necessary and sufficient optimality conditions are obtained for a fractional multiple objective programming involving semilocal E-convex and related functions. Also, some dual results are establish...In this paper, some necessary and sufficient optimality conditions are obtained for a fractional multiple objective programming involving semilocal E-convex and related functions. Also, some dual results are established under this kind of generalized convex functions. Our results generalize the ones obtained by Preda[J Math Anal Appl, 288（2003） 365-382].展开更多
In this paper, we consider a method of centers for solving multi-objective programming problems, where the objective functions involved are concave functions and the set of feasible points is convex. The algorithm is ...In this paper, we consider a method of centers for solving multi-objective programming problems, where the objective functions involved are concave functions and the set of feasible points is convex. The algorithm is defined so that the sub-problems that must be solved during its execution may be solved by finite-step procedures. Conditions are given under which the algorithm generates sequences of feasible points and constraint multiplier vectors that have accumulation points satisfying the KKT conditions. Finally, we establish convergence of the proposed method of centers algorithm for solving multiobjective programming problems.展开更多
An important decision for policy makers is selecting strategic petroleum reserve sites. However, policy makers may not choose the most suitable and efficient locations for strategic petroleum reserve（SPR） due to the...An important decision for policy makers is selecting strategic petroleum reserve sites. However, policy makers may not choose the most suitable and efficient locations for strategic petroleum reserve（SPR） due to the complexity in the choice of sites. This paper proposes a multi-objective programming model to determine the optimal locations for China＇s SPR storage sites. This model considers not only the minimum response time but also the minimum transportation cost based on a series of reasonable assumptions and constraint conditions. The factors influencing SPR sites are identified to determine potential demand points and candidate storage sites. Estimation and suggestions are made for the selection of China＇s future SPR storage sites based on the results of this model. When the number of petroleum storage sites is less than or equals 25 and the maximum capacity of storage sites is restricted to 10 million tonnes, the model＇s result best fit for the current layout scheme selected thirteen storage sites in four scenarios. Considering the current status of SPR in China,Tianjin, Qingdao, Dalian, Daqing and Zhanjiang, Chengdu,Xi＇an, and Yueyang are suggested to be the candidate locations for the third phase of the construction plan. The locations of petroleum storage sites suggested in this work could be used as a reference for decision makers.展开更多
Intelligent production is an important development direction in intelligent manufacturing,with intelligent factories playing a crucial role in promoting intelligent production.Flexible job shops,as the main form of in...Intelligent production is an important development direction in intelligent manufacturing,with intelligent factories playing a crucial role in promoting intelligent production.Flexible job shops,as the main form of intelligent factories,constantly face dynamic disturbances during the production process,including machine failures and urgent orders.This paper discusses the basic models and research methods of job shop scheduling,emphasizing the important role of dynamic job shop scheduling and its response schemes in future research.A multi-objective flexible job shop dynamic scheduling mathematical model is established,highlighting its complex and multi-constraint characteristics under different interferences.A classification discussion is conducted on the dynamic response methods and optimization objectives under machine failures,emergency orders,fuzzy completion times,and mixed dynamic events.The development process of traditional scheduling rules and intelligent methods in dynamic scheduling are also analyzed.Finally,based on the current development status of job shop scheduling and the requirements of intelligent manufacturing,the future development trends of dynamic scheduling in flexible job shops are proposed.展开更多
For the deep understanding on combustion of ammonia/diesel,this study develops a reduced mechanism of ammonia/diesel with 227 species and 937 reactions.The sub-mechanism on ammonia/interactions of N-based and C-based ...For the deep understanding on combustion of ammonia/diesel,this study develops a reduced mechanism of ammonia/diesel with 227 species and 937 reactions.The sub-mechanism on ammonia/interactions of N-based and C-based species(N—C)/NOx is optimized using the Non-dominated Sorting Genetic Algorithm II(NSGA-II)with 200 generations.The optimized mechanism(named as 937b)is validated against combustion characteristics of ammonia/methane(which is used to examine the accuracy of N—C interactions)and ammonia/diesel blends.The ignition delay times(IDTs),the laminar flame speeds and most of key intermediate species during the combustion of ammonia/methane blends can be accurately simulated by 937b under a wide range of conditions.As for ammonia/diesel blends with various diesel energy fractions,reasonable predictions on the IDTs under pressures from 1.0 MPa to5.0 MPa as well as the laminar flame speeds are also achieved by 937b.In particular,with regard to the IDT simulations of ammonia/diesel blends,937b makes progress in both aspects of overall accuracy and computational efficiency,compared to a detailed ammonia/diesel mechanism.Further kinetic analysis reveals that the reaction pathway of ammonia during the combustion of ammonia/diesel blend mainly differs in the tendencies of oxygen additions to NH_2 and NH with different equivalence ratios.展开更多
The supercritical CO_(2) Brayton cycle is considered a promising energy conversion system for Generation IV reactors for its simple layout,compact structure,and high cycle efficiency.Mathematical models of four Brayto...The supercritical CO_(2) Brayton cycle is considered a promising energy conversion system for Generation IV reactors for its simple layout,compact structure,and high cycle efficiency.Mathematical models of four Brayton cycle layouts are developed in this study for different reactors to reduce the cost and increase the thermohydraulic performance of nuclear power generation to promote the commercialization of nuclear energy.Parametric analysis,multi-objective optimizations,and four decision-making methods are applied to obtain each Brayton scheme’s optimal thermohydraulic and economic indexes.Results show that for the same design thermal power scale of reactors,the higher the core’s exit temperature,the better the Brayton cycle’s thermo-economic performance.Among the four-cycle layouts,the recompression cycle(RC)has the best overall performance,followed by the simple recuperation cycle(SR)and the intercooling cycle(IC),and the worst is the reheating cycle(RH).However,RH has the lowest total cost of investment(C_(tot))of$1619.85 million,and IC has the lowest levelized cost of energy(LCOE)of 0.012$/(kWh).The nuclear Brayton cycle system’s overall performance has been improved due to optimization.The performance of the molten salt reactor combined with the intercooling cycle(MSR-IC)scheme has the greatest improvement,with the net output power(W_(net)),thermal efficiencyη_(t),and exergy efficiency(η_(e))improved by 8.58%,8.58%,and 11.21%,respectively.The performance of the lead-cooled fast reactor combined with the simple recuperation cycle scheme was optimized to increase C_(tot) by 27.78%.In comparison,the internal rate of return(IRR)increased by only 7.8%,which is not friendly to investors with limited funds.For the nuclear Brayton cycle,the molten salt reactor combined with the recompression cycle scheme should receive priority,and the gas-cooled fast reactor combined with the reheating cycle scheme should be considered carefully.展开更多
Titanium dioxide(TiO_(2))has attracted considerable research attentions for its promising applications in solar cells and photocatalytic devices.However,the intrinsic challenge lies in the relatively low energy conver...Titanium dioxide(TiO_(2))has attracted considerable research attentions for its promising applications in solar cells and photocatalytic devices.However,the intrinsic challenge lies in the relatively low energy conversion efficiency of TiO_(2),primarily attributed to the substantial band gaps(exceeding 3.0 eV)associated with its rutile and anatase phases.Leveraging multi-objective global optimization,we have identified two quasi-layered ternary Ti-O-S crystals,composed of titanium,oxygen,and sulfur.The calculations of formation energy,phonon dispersions,and thermal stability confirm the chemical,dynamical and thermal stability of these newly discovered phases.Employing the state-of-art hybrid density functional approach and many-body perturbation theory(quasiparticle GW approach and Bethe-Salpeter equation),we calculate the optical properties of both the TiOS phases.Significantly,both phases show favorable photocatalytic characteristics,featuring band gaps suitable for visible optical absorption and appropriate band alignments with water for effective charge carrier separation.Therefore,ternary compound TiOS holds the potential for achieving high-efficiency photochemical conversion,showing our multi-objective global optimization provides a new approach for novel environmental and energy materials design with multicomponent compounds.展开更多
In this paper,we study the minimax linear fractional programming problem on a non-empty bounded set,called problem(MLFP),and we design a branch and bound algorithm to find a globally optimal solution of(MLFP).Firstly,...In this paper,we study the minimax linear fractional programming problem on a non-empty bounded set,called problem(MLFP),and we design a branch and bound algorithm to find a globally optimal solution of(MLFP).Firstly,we convert the problem(MLFP)to a problem(EP2)that is equivalent to it.Secondly,by applying the convex relaxation technique to problem(EP2),a convex quadratic relaxation problem(CQRP)is obtained.Then,the overall framework of the algorithm is given and its convergence is proved,the worst-case iteration number is also estimated.Finally,experimental data are listed to illustrate the effectiveness of the algorithm.展开更多
Machining-features of the workplace are described by using of the object-oriented （O-O） technology. Geometrical machining-features are recognized in the given cut region by using the maximum membership priciple abou...Machining-features of the workplace are described by using of the object-oriented （O-O） technology. Geometrical machining-features are recognized in the given cut region by using the maximum membership priciple about the fuzzy set. Depending on the IF-THEN rule and the fuzzy matching method, the rough information of the machining-process for high-speed milling （HSM） is extracted based on the database of machining-process for HSM. The optimization model of machining-process scheme is established to obtain shorter cut time, lower cost or higher surface quality. It is helpful to form successful cases for HSM. NC programming for HSM is realized according to optimized machining-process data from HSM cases selected by the optimization model and the extracted information of machining-process.展开更多
Frequency sampling is one of the popular methods in FIR digital filter design. In the frequency sampling method the value of transition band samples, which are usually obtained by consulting a table, must be determi...Frequency sampling is one of the popular methods in FIR digital filter design. In the frequency sampling method the value of transition band samples, which are usually obtained by consulting a table, must be determined in order to make the attenuation within the stopband maximal. However, the value obtained by searching for table can not be ensured to be optimal. Evolutionary programming (EP), a multi agent stochastic optimization technique, can lead to global optimal solutions for complex problems. In this paper a new application of EP to frequency sampling method is introduced. Two examples of lowpass and bandpass FIR filters are presented, and the steps of EP realization and experimental results are given. Experimental results show that the value of transition band samples obtained by EP can be ensured to be optimal and the performance of the filter is improved.展开更多
Hanson and Mond have grven sets of necessary and sufficient conditions for optimality in constrained optimization by introducing classes of generalized functions, called type Ⅰ functions. Recently, Bector definded un...Hanson and Mond have grven sets of necessary and sufficient conditions for optimality in constrained optimization by introducing classes of generalized functions, called type Ⅰ functions. Recently, Bector definded univex functions, a new class of functions that unifies several concepts of generalized convexity. In this paper, additional conditions are attached to the Kuhn Tucker conditions giving a set of conditions which are both necessary and sufficient for optimality in constrained optimization, under appropriate constraint qualifications.展开更多
The uniform design and response surface methodology （RSM） are applied to the multi-objective optimization of a 2-D mixed compression scramjet inlet. The set of experimental design points on the design space is selec...The uniform design and response surface methodology （RSM） are applied to the multi-objective optimization of a 2-D mixed compression scramjet inlet. The set of experimental design points on the design space is selected by the uniform design, and the inlet performance is analyzed by computational fluid dynamics （CFD）. Then complete quadratic polynomial response surface approximation models are constructed based on the performance analysis results and then used to replace theoriginal complex inlet performance model. The optimization is conducted using a multi-objective genetic algorithm NSGA-Ⅱ, and the Pareto optimal solution set is obtained. Results show that the uniform design and RSM can reduce the computational complexity of numerical simulation and improve the optimization efficiency.展开更多
Based on the analysis to the random sear ch algorithm of LUUS, a modified random directed integer search algorithm (MRDI SA) is given for first time. And a practical example is given to show that the adva ntage of th...Based on the analysis to the random sear ch algorithm of LUUS, a modified random directed integer search algorithm (MRDI SA) is given for first time. And a practical example is given to show that the adva ntage of this kind of algorithm is the reliability can’t be infuenced by the ini tial value X (0) and the start search domain R (0) . Besides, i t can be applied to solve the higher dimensional constrained nonlinear integer p rogramming problem.展开更多
Multi-objective optimization for the optimum shape design is introduced in aerodynamics using the Game theory. Based on the control theory, the employed optimizer and the negative feedback are used to implement the co...Multi-objective optimization for the optimum shape design is introduced in aerodynamics using the Game theory. Based on the control theory, the employed optimizer and the negative feedback are used to implement the constraints. All the constraints are satisfied implicitly and automatically in the design. Furthermore,the above methodology is combined with a formulation derived from the Game theory to treat multi-point airfoil optimization. Airfoil shapes are optimized according to various aerodynamics criteria. In the symmetric Nash game, each “player” is responsible for one criterion, and the Nash equilibrium provides a solution to the multipoint optimization. Design results confirm the efficiency of the method.展开更多
The intelligent optimization of a multi-objective evolutionary algorithm is combined with a gradient algorithm. The hybrid multi-objective gradient algorithm is framed by the real number. Test functions are used to an...The intelligent optimization of a multi-objective evolutionary algorithm is combined with a gradient algorithm. The hybrid multi-objective gradient algorithm is framed by the real number. Test functions are used to analyze the efficiency of the algorithm. In the simulation case of the water phantom, the algorithm is applied to an inverse planning process of intensity modulated radiation treatment （IMRT）. The objective functions of planning target volume （PTV） and normal tissue （NT） are based on the average dose distribution. The obtained intensity profile shows that the hybrid multi-objective gradient algorithm saves the computational time and has good accuracy, thus meeting the requirements of practical applications.展开更多
In the flexible job-shop scheduling problem （FJSP）, each operation has to be assigned to a machine from a set of capable machines before alocating the assigned operations on all machines. To solve the multi-objectiv...In the flexible job-shop scheduling problem （FJSP）, each operation has to be assigned to a machine from a set of capable machines before alocating the assigned operations on all machines. To solve the multi-objective FJSP, the Grantt graph oriented string representation （GOSR） and the basic manipulation of the genetic algorithm operator are presented. An integrated operator genetic algorithm （IOGA） and its process are described. Comparison between computational results and the latest research shows that the proposed algorithm is effective in reducing the total workload of all machines, the makespan and the critical machine workload.展开更多
In classical nonlinear programming, it is a general method of developing optimality conditions that a nonlinear programming problem is linearized as a linear programming problem by using first order approximations of ...In classical nonlinear programming, it is a general method of developing optimality conditions that a nonlinear programming problem is linearized as a linear programming problem by using first order approximations of the functions at a given feasible point. The linearized procedure for differentiable nonlinear programming problems can be naturally generalized to the quasi differential case. As in classical case so called constraint qualifications have to be imposed on the constraint functions to guarantee that for a given local minimizer of the original problem the nullvector is an optimal solution of the corresponding 'quasilinearized' problem. In this paper, constraint qualifications for inequality constrained quasi differentiable programming problems of type min {f(x)|g(x)≤0} are considered, where f and g are qusidifferentiable functions in the sense of Demyanov. Various constraint qualifications for this problem are presented and a new one is proposed. The relations among these conditions are investigated. Moreover, a Wolf dual problem for this problem is introduced, and the corresponding dual theorems are given.展开更多
In this paper, we present a nonmonotone smoothing Newton algorithm for solving the circular cone programming(CCP) problem in which a linear function is minimized or maximized over the intersection of an affine space w...In this paper, we present a nonmonotone smoothing Newton algorithm for solving the circular cone programming(CCP) problem in which a linear function is minimized or maximized over the intersection of an affine space with the circular cone. Based on the relationship between the circular cone and the second-order cone(SOC), we reformulate the CCP problem as the second-order cone problem(SOCP). By extending the nonmonotone line search for unconstrained optimization to the CCP, a nonmonotone smoothing Newton method is proposed for solving the CCP. Under suitable assumptions, the proposed algorithm is shown to be globally and locally quadratically convergent. Some preliminary numerical results indicate the effectiveness of the proposed algorithm for solving the CCP.展开更多
The penalty function method, presented many years ago, is an important nu- merical method for the mathematical programming problems. In this article, we propose a dual-relax penalty function approach, which is signifi...The penalty function method, presented many years ago, is an important nu- merical method for the mathematical programming problems. In this article, we propose a dual-relax penalty function approach, which is significantly different from penalty func- tion approach existing for solving the bilevel programming, to solve the nonlinear bilevel programming with linear lower level problem. Our algorithm will redound to the error analysis for computing an approximate solution to the bilevel programming. The error estimate is obtained among the optimal objective function value of the dual-relax penalty problem and of the original bilevel programming problem. An example is illustrated to show the feasibility of the proposed approach.展开更多
基金Supported by the National Natural Science Foundation of China(71103034)the Natural Science Foundation of Jiangsu Province(bk2011084)
文摘To improve the efficiency of gate reassignment and optimize the plan of gate reassignment,the concept of disruption management is introduced,and a multi-objective programming model for airport gate reassignment is proposed.Considering the interests of passengers and the airport,the model minimizes the total flight delay,the total passengers′walking distance and the number of flights reassigned to other gates different from the planned ones.According to the characteristics of the gate reassignment,the model is simplified.As the multi-objective programming model is hard to reach the optimal solutions simultaneously,a threshold of satisfactory solutions of the model is set.Then a simulated annealing algorithm is designed for the model.Case studies show that the model decreases the total flight delay to the satisfactory solutions,and minimizes the total passengers′walking distance.The least change of planned assignment is also reached.The results achieve the goals of disruption management.Therefore,the model is verified to be effective.
基金Foundation item： Supported by Hunan Provincial Natural Science Foundation of China（05JJ40103） Supported by Soft Science Research Fund of Hunan Province（2006ZK3028） Supported by Scientific Research Fund of Hunan Provincial Education Department（105B0707, 08C470）
文摘In this paper, some necessary and sufficient optimality conditions are obtained for a fractional multiple objective programming involving semilocal E-convex and related functions. Also, some dual results are established under this kind of generalized convex functions. Our results generalize the ones obtained by Preda[J Math Anal Appl, 288（2003） 365-382].
文摘In this paper, we consider a method of centers for solving multi-objective programming problems, where the objective functions involved are concave functions and the set of feasible points is convex. The algorithm is defined so that the sub-problems that must be solved during its execution may be solved by finite-step procedures. Conditions are given under which the algorithm generates sequences of feasible points and constraint multiplier vectors that have accumulation points satisfying the KKT conditions. Finally, we establish convergence of the proposed method of centers algorithm for solving multiobjective programming problems.
基金supported by the National Natural Science Foundation of China (Nos. 71273277/71373285/71303258)the Philosophy and Social Sciences Major Research Project of the Ministry of Education (No. 11JZD048)
文摘An important decision for policy makers is selecting strategic petroleum reserve sites. However, policy makers may not choose the most suitable and efficient locations for strategic petroleum reserve（SPR） due to the complexity in the choice of sites. This paper proposes a multi-objective programming model to determine the optimal locations for China＇s SPR storage sites. This model considers not only the minimum response time but also the minimum transportation cost based on a series of reasonable assumptions and constraint conditions. The factors influencing SPR sites are identified to determine potential demand points and candidate storage sites. Estimation and suggestions are made for the selection of China＇s future SPR storage sites based on the results of this model. When the number of petroleum storage sites is less than or equals 25 and the maximum capacity of storage sites is restricted to 10 million tonnes, the model＇s result best fit for the current layout scheme selected thirteen storage sites in four scenarios. Considering the current status of SPR in China,Tianjin, Qingdao, Dalian, Daqing and Zhanjiang, Chengdu,Xi＇an, and Yueyang are suggested to be the candidate locations for the third phase of the construction plan. The locations of petroleum storage sites suggested in this work could be used as a reference for decision makers.
基金supported by the National Key Research and Development Program Project(No.2021YFB3301300).
文摘Intelligent production is an important development direction in intelligent manufacturing,with intelligent factories playing a crucial role in promoting intelligent production.Flexible job shops,as the main form of intelligent factories,constantly face dynamic disturbances during the production process,including machine failures and urgent orders.This paper discusses the basic models and research methods of job shop scheduling,emphasizing the important role of dynamic job shop scheduling and its response schemes in future research.A multi-objective flexible job shop dynamic scheduling mathematical model is established,highlighting its complex and multi-constraint characteristics under different interferences.A classification discussion is conducted on the dynamic response methods and optimization objectives under machine failures,emergency orders,fuzzy completion times,and mixed dynamic events.The development process of traditional scheduling rules and intelligent methods in dynamic scheduling are also analyzed.Finally,based on the current development status of job shop scheduling and the requirements of intelligent manufacturing,the future development trends of dynamic scheduling in flexible job shops are proposed.
基金the National Natural Science Foundation of China(project code:52202470)Jilin Province Natural Science Foundation(project codes:20220101205JC,20220101212JC)+2 种基金Jilin Province Specific Project of Industrial Technology Research&Development(project code:2020C025-2)2021 Interdisciplinary Integration and Innovation Project of Jilin University(project code:XJRCYB07)Free Exploration Project of Changsha Automotive Innovation Research Institute of Jilin University(project code:CAIRIZT20220202)。
文摘For the deep understanding on combustion of ammonia/diesel,this study develops a reduced mechanism of ammonia/diesel with 227 species and 937 reactions.The sub-mechanism on ammonia/interactions of N-based and C-based species(N—C)/NOx is optimized using the Non-dominated Sorting Genetic Algorithm II(NSGA-II)with 200 generations.The optimized mechanism(named as 937b)is validated against combustion characteristics of ammonia/methane(which is used to examine the accuracy of N—C interactions)and ammonia/diesel blends.The ignition delay times(IDTs),the laminar flame speeds and most of key intermediate species during the combustion of ammonia/methane blends can be accurately simulated by 937b under a wide range of conditions.As for ammonia/diesel blends with various diesel energy fractions,reasonable predictions on the IDTs under pressures from 1.0 MPa to5.0 MPa as well as the laminar flame speeds are also achieved by 937b.In particular,with regard to the IDT simulations of ammonia/diesel blends,937b makes progress in both aspects of overall accuracy and computational efficiency,compared to a detailed ammonia/diesel mechanism.Further kinetic analysis reveals that the reaction pathway of ammonia during the combustion of ammonia/diesel blend mainly differs in the tendencies of oxygen additions to NH_2 and NH with different equivalence ratios.
基金This work was supported of National Natural Science Foundation of China Fund(No.52306033)State Key Laboratory of Engines Fund(No.SKLE-K2022-07)the Jiangxi Provincial Postgraduate Innovation Special Fund(No.YC2022-s513).
文摘The supercritical CO_(2) Brayton cycle is considered a promising energy conversion system for Generation IV reactors for its simple layout,compact structure,and high cycle efficiency.Mathematical models of four Brayton cycle layouts are developed in this study for different reactors to reduce the cost and increase the thermohydraulic performance of nuclear power generation to promote the commercialization of nuclear energy.Parametric analysis,multi-objective optimizations,and four decision-making methods are applied to obtain each Brayton scheme’s optimal thermohydraulic and economic indexes.Results show that for the same design thermal power scale of reactors,the higher the core’s exit temperature,the better the Brayton cycle’s thermo-economic performance.Among the four-cycle layouts,the recompression cycle(RC)has the best overall performance,followed by the simple recuperation cycle(SR)and the intercooling cycle(IC),and the worst is the reheating cycle(RH).However,RH has the lowest total cost of investment(C_(tot))of$1619.85 million,and IC has the lowest levelized cost of energy(LCOE)of 0.012$/(kWh).The nuclear Brayton cycle system’s overall performance has been improved due to optimization.The performance of the molten salt reactor combined with the intercooling cycle(MSR-IC)scheme has the greatest improvement,with the net output power(W_(net)),thermal efficiencyη_(t),and exergy efficiency(η_(e))improved by 8.58%,8.58%,and 11.21%,respectively.The performance of the lead-cooled fast reactor combined with the simple recuperation cycle scheme was optimized to increase C_(tot) by 27.78%.In comparison,the internal rate of return(IRR)increased by only 7.8%,which is not friendly to investors with limited funds.For the nuclear Brayton cycle,the molten salt reactor combined with the recompression cycle scheme should receive priority,and the gas-cooled fast reactor combined with the reheating cycle scheme should be considered carefully.
基金Project supported by the Natural Science Foundation of WIUCAS (Grant Nos.WIUCASQD2023004 and WIUCASQD2022025)the National Natural Science Foundation of China (Grant Nos.12304006,12104452,12022508,12074394,and 12374061)+1 种基金the Shanghai Science and Technology Innovation Action Plan (Grant No.23JC1401400)the Natural Science Foundation of Wenzhou (Grant No.L2023005)。
文摘Titanium dioxide(TiO_(2))has attracted considerable research attentions for its promising applications in solar cells and photocatalytic devices.However,the intrinsic challenge lies in the relatively low energy conversion efficiency of TiO_(2),primarily attributed to the substantial band gaps(exceeding 3.0 eV)associated with its rutile and anatase phases.Leveraging multi-objective global optimization,we have identified two quasi-layered ternary Ti-O-S crystals,composed of titanium,oxygen,and sulfur.The calculations of formation energy,phonon dispersions,and thermal stability confirm the chemical,dynamical and thermal stability of these newly discovered phases.Employing the state-of-art hybrid density functional approach and many-body perturbation theory(quasiparticle GW approach and Bethe-Salpeter equation),we calculate the optical properties of both the TiOS phases.Significantly,both phases show favorable photocatalytic characteristics,featuring band gaps suitable for visible optical absorption and appropriate band alignments with water for effective charge carrier separation.Therefore,ternary compound TiOS holds the potential for achieving high-efficiency photochemical conversion,showing our multi-objective global optimization provides a new approach for novel environmental and energy materials design with multicomponent compounds.
基金Supported by the National Natural Science Foundation of China(Grant Nos.12071133 and 11871196).
文摘In this paper,we study the minimax linear fractional programming problem on a non-empty bounded set,called problem(MLFP),and we design a branch and bound algorithm to find a globally optimal solution of(MLFP).Firstly,we convert the problem(MLFP)to a problem(EP2)that is equivalent to it.Secondly,by applying the convex relaxation technique to problem(EP2),a convex quadratic relaxation problem(CQRP)is obtained.Then,the overall framework of the algorithm is given and its convergence is proved,the worst-case iteration number is also estimated.Finally,experimental data are listed to illustrate the effectiveness of the algorithm.
文摘Machining-features of the workplace are described by using of the object-oriented （O-O） technology. Geometrical machining-features are recognized in the given cut region by using the maximum membership priciple about the fuzzy set. Depending on the IF-THEN rule and the fuzzy matching method, the rough information of the machining-process for high-speed milling （HSM） is extracted based on the database of machining-process for HSM. The optimization model of machining-process scheme is established to obtain shorter cut time, lower cost or higher surface quality. It is helpful to form successful cases for HSM. NC programming for HSM is realized according to optimized machining-process data from HSM cases selected by the optimization model and the extracted information of machining-process.
文摘Frequency sampling is one of the popular methods in FIR digital filter design. In the frequency sampling method the value of transition band samples, which are usually obtained by consulting a table, must be determined in order to make the attenuation within the stopband maximal. However, the value obtained by searching for table can not be ensured to be optimal. Evolutionary programming (EP), a multi agent stochastic optimization technique, can lead to global optimal solutions for complex problems. In this paper a new application of EP to frequency sampling method is introduced. Two examples of lowpass and bandpass FIR filters are presented, and the steps of EP realization and experimental results are given. Experimental results show that the value of transition band samples obtained by EP can be ensured to be optimal and the performance of the filter is improved.
文摘Hanson and Mond have grven sets of necessary and sufficient conditions for optimality in constrained optimization by introducing classes of generalized functions, called type Ⅰ functions. Recently, Bector definded univex functions, a new class of functions that unifies several concepts of generalized convexity. In this paper, additional conditions are attached to the Kuhn Tucker conditions giving a set of conditions which are both necessary and sufficient for optimality in constrained optimization, under appropriate constraint qualifications.
文摘The uniform design and response surface methodology （RSM） are applied to the multi-objective optimization of a 2-D mixed compression scramjet inlet. The set of experimental design points on the design space is selected by the uniform design, and the inlet performance is analyzed by computational fluid dynamics （CFD）. Then complete quadratic polynomial response surface approximation models are constructed based on the performance analysis results and then used to replace theoriginal complex inlet performance model. The optimization is conducted using a multi-objective genetic algorithm NSGA-Ⅱ, and the Pareto optimal solution set is obtained. Results show that the uniform design and RSM can reduce the computational complexity of numerical simulation and improve the optimization efficiency.
文摘Based on the analysis to the random sear ch algorithm of LUUS, a modified random directed integer search algorithm (MRDI SA) is given for first time. And a practical example is given to show that the adva ntage of this kind of algorithm is the reliability can’t be infuenced by the ini tial value X (0) and the start search domain R (0) . Besides, i t can be applied to solve the higher dimensional constrained nonlinear integer p rogramming problem.
文摘Multi-objective optimization for the optimum shape design is introduced in aerodynamics using the Game theory. Based on the control theory, the employed optimizer and the negative feedback are used to implement the constraints. All the constraints are satisfied implicitly and automatically in the design. Furthermore,the above methodology is combined with a formulation derived from the Game theory to treat multi-point airfoil optimization. Airfoil shapes are optimized according to various aerodynamics criteria. In the symmetric Nash game, each “player” is responsible for one criterion, and the Nash equilibrium provides a solution to the multipoint optimization. Design results confirm the efficiency of the method.
基金Supported by the National Basic Research Program of China ("973" Program)the National Natural Science Foundation of China (60872112, 10805012)+1 种基金the Natural Science Foundation of Zhejiang Province(Z207588)the College Science Research Project of Anhui Province (KJ2008B268)~~
文摘The intelligent optimization of a multi-objective evolutionary algorithm is combined with a gradient algorithm. The hybrid multi-objective gradient algorithm is framed by the real number. Test functions are used to analyze the efficiency of the algorithm. In the simulation case of the water phantom, the algorithm is applied to an inverse planning process of intensity modulated radiation treatment （IMRT）. The objective functions of planning target volume （PTV） and normal tissue （NT） are based on the average dose distribution. The obtained intensity profile shows that the hybrid multi-objective gradient algorithm saves the computational time and has good accuracy, thus meeting the requirements of practical applications.
文摘In the flexible job-shop scheduling problem （FJSP）, each operation has to be assigned to a machine from a set of capable machines before alocating the assigned operations on all machines. To solve the multi-objective FJSP, the Grantt graph oriented string representation （GOSR） and the basic manipulation of the genetic algorithm operator are presented. An integrated operator genetic algorithm （IOGA） and its process are described. Comparison between computational results and the latest research shows that the proposed algorithm is effective in reducing the total workload of all machines, the makespan and the critical machine workload.
文摘In classical nonlinear programming, it is a general method of developing optimality conditions that a nonlinear programming problem is linearized as a linear programming problem by using first order approximations of the functions at a given feasible point. The linearized procedure for differentiable nonlinear programming problems can be naturally generalized to the quasi differential case. As in classical case so called constraint qualifications have to be imposed on the constraint functions to guarantee that for a given local minimizer of the original problem the nullvector is an optimal solution of the corresponding 'quasilinearized' problem. In this paper, constraint qualifications for inequality constrained quasi differentiable programming problems of type min {f(x)|g(x)≤0} are considered, where f and g are qusidifferentiable functions in the sense of Demyanov. Various constraint qualifications for this problem are presented and a new one is proposed. The relations among these conditions are investigated. Moreover, a Wolf dual problem for this problem is introduced, and the corresponding dual theorems are given.
基金supported by the National Natural Science Foundation of China(11401126,71471140 and 11361018)Guangxi Natural Science Foundation(2016GXNSFBA380102 and 2014GXNSFFA118001)+2 种基金Guangxi Key Laboratory of Cryptography and Information Security(GCIS201618)Guangxi Key Laboratory of Automatic Detecting Technology and Instruments(YQ15112 and YQ16112)China
文摘In this paper, we present a nonmonotone smoothing Newton algorithm for solving the circular cone programming(CCP) problem in which a linear function is minimized or maximized over the intersection of an affine space with the circular cone. Based on the relationship between the circular cone and the second-order cone(SOC), we reformulate the CCP problem as the second-order cone problem(SOCP). By extending the nonmonotone line search for unconstrained optimization to the CCP, a nonmonotone smoothing Newton method is proposed for solving the CCP. Under suitable assumptions, the proposed algorithm is shown to be globally and locally quadratically convergent. Some preliminary numerical results indicate the effectiveness of the proposed algorithm for solving the CCP.
基金supported by the National Science Foundation of China (70771080)Social Science Foundation of Ministry of Education (10YJC630233)
文摘The penalty function method, presented many years ago, is an important nu- merical method for the mathematical programming problems. In this article, we propose a dual-relax penalty function approach, which is significantly different from penalty func- tion approach existing for solving the bilevel programming, to solve the nonlinear bilevel programming with linear lower level problem. Our algorithm will redound to the error analysis for computing an approximate solution to the bilevel programming. The error estimate is obtained among the optimal objective function value of the dual-relax penalty problem and of the original bilevel programming problem. An example is illustrated to show the feasibility of the proposed approach.
