Multi-objective optimization and evaluation of supercritical CO_(2) Brayton cycle for nuclear power generation

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.

Solving Multi-Objective Linear Programming Problem by Statistical Averaging Method with the Help of Fuzzy Programming Method

A multi-objective linear programming problem is made from fuzzy linear programming problem. It is due the fact that it is used fuzzy programming method during the solution. The Multi objective linear programming problem can be converted into the single objective function by various methods as Chandra Sen’s method, weighted sum method, ranking function method, statistical averaging method. In this paper, Chandra Sen’s method and statistical averaging method both are used here for making single objective function from multi-objective function. Two multi-objective programming problems are solved to verify the result. One is numerical example and the other is real life example. Then the problems are solved by ordinary simplex method and fuzzy programming method. It can be seen that fuzzy programming method gives better optimal values than the ordinary simplex method.

Multi-Objective Image Optimization of Product Appearance Based on Improved NSGA-II

A second-generation fast Non-dominated Sorting Genetic Algorithm product shape multi-objective imagery optimization model based on degradation(DNSGA-II)strategy is proposed to make the product appearance optimization scheme meet the complex emotional needs of users for the product.First,the semantic differential method and K-Means cluster analysis are applied to extract the multi-objective imagery of users;then,the product multidimensional scale analysis is applied to classify the research objects,and again the reference samples are screened by the semantic differentialmethod,and the samples are parametrized in two dimensions by using elliptic Fourier analysis;finally,the fuzzy dynamic evaluation function is used as the objective function of the algorithm,and the coordinates of key points of product contours Finally,with the fuzzy dynamic evaluation function as the objective function of the algorithm and the coordinates of key points of the product profile as the decision variables,the optimal product profile solution set is solved by DNSGA-II.The validity of the model is verified by taking the optimization of the shape scheme of the hospital connection site as an example.For comparison with DNSGA-II,other multi-objective optimization algorithms are also presented.To evaluate the performance of each algorithm,the performance evaluation index values of the five multi-objective optimization algorithms are calculated in this paper.The results show that DNSGA-II is superior in improving individual diversity and has better overall performance.

Multi-objective optimization strategies using adjoint method and game theory in aerodynamics

There are currently three different game strategies originated in economics： （1） Cooperative games （Pareto front）, （2） Competitive games （Nash game） and （3） Hierarchical games （Stackelberg game）. Each game achieves different equilibria with different performance, and their players play different roles in the games. Here, we introduced game concept into aerodynamic design, and combined it with adjoint method to solve multi- criteria aerodynamic optimization problems. The performance distinction of the equilibria of these three game strategies was investigated by numerical experiments. We computed Pareto front, Nash and Stackelberg equilibria of the same optimization problem with two conflicting and hierarchical targets under different parameterizations by using the deterministic optimization method. The numerical results show clearly that all the equilibria solutions are inferior to the Pareto front. Non-dominated Pareto front solutions are obtained, however the CPU cost to capture a set of solutions makes the Pareto front an expensive tool to the designer.

New Ranking of Generalized Quadrilateral Shape Fuzzy Number Using Centroid Technique

The output of the fuzzy set is reduced by one for the defuzzification procedure.It is employed to provide a comprehensible outcome from a fuzzy inference process.This page provides further information about the defuzzifica-tion approach for quadrilateral fuzzy numbers,which may be used to convert them into discrete values.Defuzzification demonstrates how useful fuzzy ranking systems can be.Our major purpose is to develop a new ranking method for gen-eralized quadrilateral fuzzy numbers.The primary objective of the research is to provide a novel approach to the accurate evaluation of various kinds of fuzzy inte-gers.Fuzzy ranking properties are examined.Using the counterexamples of Lee and Chen demonstrates the fallacy of the ranking technique.So,a new approach has been developed for dealing with fuzzy risk analysis,risk management,indus-trial engineering and optimization,medicine,and artificial intelligence problems:the generalized quadrilateral form fuzzy number utilizing centroid methodology.As you can see,the aforementioned scenarios are all amenable to the solution pro-vided by the generalized quadrilateral shape fuzzy number utilizing centroid methodology.It’s laid out in a straightforward manner that’s easy to grasp for everyone.The rating method is explained in detail,along with numerical exam-ples to illustrate it.Last but not least,stability evaluations clarify why the Gener-alized quadrilateral shape fuzzy number obtained by the centroid methodology outperforms other ranking methods.

Weakness Ranking Method for Subsystems of Heavy-Duty Machine Tools Based on FMECA Information

Heavy-duty machine tools are composed of many subsystems with different functions,and their reliability is governed by the reliabilities of these subsystems.It is important to rank the weaknesses of subsystems and identify the weakest subsystem to optimize products and improve their reliabilities.However,traditional ranking methods based on failure mode effect and critical analysis(FMECA)does not consider the complex maintenance of products.Herein,a weakness ranking method for the subsystems of heavy-duty machine tools is proposed based on generalized FMECA information.In this method,eight reliability indexes,including maintainability and maintenance cost,are considered in the generalized FMECA information.Subsequently,the cognition best worst method is used to calculate the weight of each screened index,and the weaknesses of the subsystems are ranked using a technique for order preference by similarity to an ideal solution.Finally,based on the failure data collected from certain domestic heavy-duty horizontal lathes,the weakness ranking result of the subsystems is obtained to verify the effectiveness of the proposed method.An improved weakness ranking method that can comprehensively analyze and identify weak subsystems is proposed herein for designing and improving the reliability of complex electromechanical products.

Multi-objective reentry trajectory optimization method via GVD for hypersonic vehicles

In the constrained reentry trajectory design of hypersonic vehicles, multiple objectives with priorities bring about more difficulties to find the optimal solution. Therefore, a multi-objective reentry trajectory optimization (MORTO) approach via generalized varying domain (GVD) is proposed. Using the direct collocation approach, the trajectory optimization problem involving multiple objectives is discretized into a nonlinear multi-objective programming with priorities. In terms of fuzzy sets, the objectives are fuzzified into three types of fuzzy goals, and their constant tolerances are substituted by the varying domains. According to the principle that the objective with higher priority has higher satisfactory degree, the priority requirement is modeled as the order constraints of the varying domains. The corresponding two-side, single-side, and hybrid-side varying domain models are formulated for three fuzzy relations respectively. By regulating the parameter, the optimal reentry trajectory satisfying priorities can be achieved. Moreover, the performance about the parameter is analyzed, and the algorithm to find its specific value for maximum priority difference is proposed. The simulations demonstrate the effectiveness of the proposed method for hypersonic vehicles, and the comparisons with the traditional methods and sensitivity analysis are presented.

Method of Searching for Earthquake Disaster Evacuation Routes Using Multi-Objective GA and GIS

This study treats the determination of routes for evacuation on foot in earthquake disasters as a multi-objective optimization problem, and aims to propose a method for quantitatively searching for evacuation routes using a multi-objective genetic algorithm (multi-objective GA) and GIS. The conclusions can be summarized in the following three points. 1) A GA was used to design and create an evacuation route search algorithm which solves the problem of the optimization of earthquake disaster evacuation routes by treating it as an optimization problem with multiple objectives, such as evacuation distance and evacuation time. 2) In this method, goodness of fit is set by using a Pareto ranking method to determine the ranking of individuals based on their relative superiorities and inferiorities. 3) In this method, searching for evacuation routes based on the information on present conditions allows evacuation routes to be derived based on present building and road locations.?Further, this method is based on publicly available information;therefore, obtaining geographic information similar to that of this study enables this method to be effective regardless of what region it is applied to, or whether the data regards the past or the future. Therefore, this method has high degree of spatial and temporal reproducibility.

A Study on the Multi-Objective Optimization Method of Brackets in Ship Structures

The shape and size optimization of brackets in hull structures was conducted to achieve the simultaneous reduction of mass and high stress,where the parametric finite element model was built based on Patran Command Language codes.The optimization procedure was executed on Isight platform,on which the linear dimensionless method was introduced to establish the weighted multi-objective function.The extreme processing method was applied and proved effective to normalize the objectives.The bracket was optimized under the typical single loads and design waves,accompanied by the different proportions of weights in the objective function,in which the safety factor function was further established,including yielding,buckling,and fatigue strength,and the weight minimization and safety maximization of the bracket were obtained.The findings of this study illustrate that the dimensionless objectives share equal contributions to the multi-objective function,which enhances the role of weights in the optimization.

METHOD OF CENTERS ALGORITHM FORMULTI-OBJECTIVE PROGRAMMING PROBLEMS

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.

Multi-objective Evolutionary Algorithm Based on Target Space Partitioning Method

Considering the defects of conventional optimization methods, a novel optimization algorithm is introduced in this paper. Target space partitioning method is used in this algorithm to solve multi-objective optimization problem, thus achieve the coherent solution which can meet the requirements of all target functions, and improve the population's overall evolution level. The algorithm which guarantees diversity preservation and fast convergence to the Pareto set is applied to structural optimization problems. The empirical analysis supports the algorithm and gives an example with program.

An Enhanced Difference Method for Multi-objective Model of Cellular Base Station Antenna Configurations

In this paper, we propose a fine-grained grid-based multi-objective model which aims at optimizing base station antennas' configurations, such as transmit power, antenna tilt and antenna azimuth, in order to upgrading network performance in cellular networks. As the model is non-convex, non-smooth and discrete and computationally expensive, we use decomposition method to solve the MOP problem. We mainly focus on addressing the scalarized sub-problem after decomposition. For the scalarized sub-problem, we propose an enhanced difference method. First, difference of each component is calculated, which provides the guidance of optimization. Then an OPSO is applied to search the optimal step length. The method is applied to GSM network optimization on an area in Beijing. The effect of the application shows that proposed method has a good performance, and is effective/efficient to solve mobile network optimization problems.

Distributed Alternating Direction Method of Multipliers for Multi-Objective Optimization

In this paper, a distributed algorithm is proposed to solve a kind of multi-objective optimization problem based on the alternating direction method of multipliers. Compared with the centralized algorithms, this algorithm does not need a central node. Therefore, it has the characteristics of low communication burden and high privacy. In addition, numerical experiments are provided to validate the effectiveness of the proposed algorithm.

Solving Fuzzy Multi-Objective Linear Programming Problem by Applying Statistical Method

In this paper, the statistical averaging method and the new statistical averaging methods have been used to solve the fuzzy multi-objective linear programming problems. These methods have been applied to form a single objective function from the fuzzy multi-objective linear programming problems. At first, a numerical example of solving fuzzy multi-objective linear programming problem has been provided to validate the maximum risk reduction by the proposed method. The proposed method has been applied to assess the risk of damage due to natural calamities like flood, cyclone, sidor, and storms at the coastal areas in Bangladesh. The proposed method of solving the fuzzy multi-objective linear programming problems by the statistical method has been compared with the Chandra Sen’s method. The numerical results show that the proposed method maximizes the risk reduction capacity better than Chandra Sen’s method.

HYBRID MULTI-OBJECTIVE GRADIENT ALGORITHM FOR INVERSE PLANNING OF IMRT

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.

一种基于潜变量的Ranking模型构造算法

现有的Ranking算法获得的模型全部来自训练数据,因为很多模型的有用信息并不能完全从训练数据中得到,因此这样得到的模型不够精确,对此,提出一种基于潜变量的Ranking算法。该算法以结构化SVM为学习工具,将除训练数据外的其他有用信息以潜变量形式引入算法的框架中,并在此基础上定义了面向NDCG的目标函数。针对该目标函数非凸非平滑,首先使用"凹-凸过程"进行逼近,然后用"近似Bundle法"展开优化计算。基准数据集上的实验结果表明:相比完全依靠训练数据的Ranking算法,本文算法获得的模型更为精确。

基于pairwise的改进ranking算法

传统基于pairwise的ranking算法,学习后得到的模型在用NDCG这样的ranking标准评价时效果并不好,对此提出了一种新型ranking算法。该算法也是使用样本对作为训练数据,但定义了一个面向NDCG评估标准的目标函数。针对此目标函数非平滑、难以直接优化的特点,提出使用割平面算法进行学习,不仅解决了上述问题,而且使算法迭代的次数不再依赖于训练样本对数。最后基于基准数据集的实验证明了算法的有效性。

Cooperative task allocation for heterogeneous multi-UAV using multi-objective optimization algorithm

The application of multiple UAVs in complicated tasks has been widely explored in recent years.Due to the advantages of flexibility,cheapness and consistence,the performance of heterogeneous multi-UAVs with proper cooperative task allocation is superior to over the single UAV.Accordingly,several constraints should be satisfied to realize the efficient cooperation,such as special time-window,variant equipment,specified execution sequence.Hence,a proper task allocation in UAVs is the crucial point for the final success.The task allocation problem of the heterogeneous UAVs can be formulated as a multi-objective optimization problem coupled with the UAV dynamics.To this end,a multi-layer encoding strategy and a constraint scheduling method are designed to handle the critical logical and physical constraints.In addition,four optimization objectives:completion time,target reward,UAV damage,and total range,are introduced to evaluate various allocation plans.Subsequently,to efficiently solve the multi-objective optimization problem,an improved multi-objective quantum-behaved particle swarm optimization(IMOQPSO)algorithm is proposed.During this algorithm,a modified solution evaluation method is designed to guide algorithmic evolution;both the convergence and distribution of particles are considered comprehensively;and boundary solutions which may produce some special allocation plans are preserved.Moreover,adaptive parameter control and mixed update mechanism are also introduced in this algorithm.Finally,both the proposed model and algorithm are verified by simulation experiments.

Ranking environmental projects model based on multicriteria decision-making and the weight sensitivity analysis

With the fast growth of Chinese economic, more and more capital will be invested in environmental projects. How to select the environmental investment projects （alternatives） for obtaining the best environmental quality and economic benefits is an important problem for the decision makers. The purpose of this paper is to develop a decision-making model to rank a finite number of alternatives with several and sometimes conflicting criteria. A model for ranking the projects of municipal sewage treatment plants is proposed by using exports＇ information and the data of the real projects. And, the ranking result is given based on the PROMETHEE method. Furthermore, by means of the concept of the weight stability intervals （WSI）, the sensitivity of the ranking results to the size of criteria values and the change of weights value of criteria are discussed. The result shows that some criteria, such as “proportion of benefit to project cost”, will influence the ranking result of alternatives very strong while others not. The influence are not only from the value of criterion but also from the changing the weight of criterion. So, some criteria such as “proportion of benefit to project cost” are key critera for ranking the projects. Decision makers must be cautious to them.

Shuffled complex evolution coupled with stochastic ranking for reservoir scheduling problems

This paper introduces an optimization method(SCE-SR)that combines shuffled complex evolution(SCE)and stochastic ranking(SR)to solve constrained reservoir scheduling problems,ranking individuals with both objectives and constrains considered.A specialized strategy is used in the evolution process to ensure that the optimal results are feasible individuals.This method is suitable for handling multiple conflicting constraints,and is easy to implement,requiring little parameter tuning.The search properties of the method are ensured through the combination of deterministic and probabilistic approaches.The proposed SCE-SR was tested against hydropower scheduling problems of a single reservoir and a multi-reservoir system,and its performance is compared with that of two classical methods(the dynamic programming and genetic algorithm).The results show that the SCE-SR method is an effective and efficient method for optimizing hydropower generation and locating feasible regions quickly,with sufficient global convergence properties and robustness.The operation schedules obtained satisfy the basic scheduling requirements of reservoirs.