Multiple objectives to be optimized simultaneously are prevalent in real-life problems. This paper develops a new Pareto Method for bi-objective optimization which yields analytical solutions. The Pareto optimal front...Multiple objectives to be optimized simultaneously are prevalent in real-life problems. This paper develops a new Pareto Method for bi-objective optimization which yields analytical solutions. The Pareto optimal front is obtained in closed-form, enabling the derivation of various solutions in a convenient and efficient way. The advantage of analytical solution is the possibility of deriving accurate, exact and well-understood solutions, which is especially useful for policy analysis. An extension of the method to include multiple objectives is provided with the objectives being classified into two types. Such an extension expands the applicability of the developed techniques.展开更多
In this article, a novel scalarization technique, called the improved objective-constraint approach, is introduced to find efficient solutions of a given multiobjective programming problem. The presented scalarized pr...In this article, a novel scalarization technique, called the improved objective-constraint approach, is introduced to find efficient solutions of a given multiobjective programming problem. The presented scalarized problem extends the objective-constraint problem. It is demonstrated that how adding variables to the scalarized problem, can lead to find conditions for (weakly, properly) Pareto optimal solutions. Applying the obtained necessary and sufficient conditions, two algorithms for generating the Pareto front approximation of bi-objective and three-objective programming problems are designed. These algorithms are easy to implement and can achieve an even approximation of (weakly, properly) Pareto optimal solutions. These algorithms can be generalized for optimization problems with more than three criterion functions, too. The effectiveness and capability of the algorithms are demonstrated in test problems.展开更多
A multi-objective optimal operation model of water-sedimentation-power in reservoir is established with power-generation, sedimentation and water storage taken into account. Moreover, the inertia weight self-adjusting...A multi-objective optimal operation model of water-sedimentation-power in reservoir is established with power-generation, sedimentation and water storage taken into account. Moreover, the inertia weight self-adjusting mechanism and Pareto-optimal archive are introduced into the particle swarm optimization and an improved multi-objective particle swarm optimization (IMOPSO) is proposed. The IMOPSO is employed to solve the optimal model and obtain the Pareto-optimal front. The multi-objective optimal operation of Wanjiazhai Reservoir during the spring breakup was investigated with three typical flood hydrographs. The results show that the former method is able to obtain the Pareto-optimal front with a uniform distribution property. Different regions (A, B, C) of the Pareto-optimal front correspond to the optimized schemes in terms of the objectives of sediment deposition, sediment deposition and power generation, and power generation, respectively. The level hydrographs and outflow hydrographs show the operation of the reservoir in details. Compared with the non-dominated sorting genetic algorithm-II (NSGA-II), IMOPSO has close global op- timization capability and is suitable for multi-objective optimization problems.展开更多
In this study, we visualize Pareto-optimum solutions derived from multiple-objective optimization using spherical self-organizing maps (SOMs) that lay out SOM data in three dimensions. There have been a wide range of ...In this study, we visualize Pareto-optimum solutions derived from multiple-objective optimization using spherical self-organizing maps (SOMs) that lay out SOM data in three dimensions. There have been a wide range of studies involving plane SOMs where Pareto-optimal solutions are mapped to a plane. However, plane SOMs have an issue that similar data differing in a few specific variables are often placed at far ends of the map, compromising intuitiveness of the visualization. We show in this study that spherical SOMs allow us to find similarities in data otherwise undetectable with plane SOMs. We also implement and evaluate the performance using parallel sphere processing with several GPU environments.展开更多
In this papert the theory of major efficiency for multiobjective programmingis established.The major-efficient solutions and weakly major-efficient solutions of multiobjective programming given here are Pareto efficie...In this papert the theory of major efficiency for multiobjective programmingis established.The major-efficient solutions and weakly major-efficient solutions of multiobjective programming given here are Pareto efficient solutions of the same multiobjectiveprogramming problem, but the converse is not true. In a ceratin sense , these solutionsare in fact better than any other Pareto efficient solutions. Some basic theorems whichcharacterize major-efficient solutions and weakly major-efficient solutions of multiobjective programming are stated and proved. Furthermore,the existence and some geometricproperties of these solutions are studied.展开更多
文摘Multiple objectives to be optimized simultaneously are prevalent in real-life problems. This paper develops a new Pareto Method for bi-objective optimization which yields analytical solutions. The Pareto optimal front is obtained in closed-form, enabling the derivation of various solutions in a convenient and efficient way. The advantage of analytical solution is the possibility of deriving accurate, exact and well-understood solutions, which is especially useful for policy analysis. An extension of the method to include multiple objectives is provided with the objectives being classified into two types. Such an extension expands the applicability of the developed techniques.
文摘In this article, a novel scalarization technique, called the improved objective-constraint approach, is introduced to find efficient solutions of a given multiobjective programming problem. The presented scalarized problem extends the objective-constraint problem. It is demonstrated that how adding variables to the scalarized problem, can lead to find conditions for (weakly, properly) Pareto optimal solutions. Applying the obtained necessary and sufficient conditions, two algorithms for generating the Pareto front approximation of bi-objective and three-objective programming problems are designed. These algorithms are easy to implement and can achieve an even approximation of (weakly, properly) Pareto optimal solutions. These algorithms can be generalized for optimization problems with more than three criterion functions, too. The effectiveness and capability of the algorithms are demonstrated in test problems.
基金National Science Fund for Distinguished Young Scholars (No.50725929)National Natural Science Foundation ofChina (No.50539060,50679052)
文摘A multi-objective optimal operation model of water-sedimentation-power in reservoir is established with power-generation, sedimentation and water storage taken into account. Moreover, the inertia weight self-adjusting mechanism and Pareto-optimal archive are introduced into the particle swarm optimization and an improved multi-objective particle swarm optimization (IMOPSO) is proposed. The IMOPSO is employed to solve the optimal model and obtain the Pareto-optimal front. The multi-objective optimal operation of Wanjiazhai Reservoir during the spring breakup was investigated with three typical flood hydrographs. The results show that the former method is able to obtain the Pareto-optimal front with a uniform distribution property. Different regions (A, B, C) of the Pareto-optimal front correspond to the optimized schemes in terms of the objectives of sediment deposition, sediment deposition and power generation, and power generation, respectively. The level hydrographs and outflow hydrographs show the operation of the reservoir in details. Compared with the non-dominated sorting genetic algorithm-II (NSGA-II), IMOPSO has close global op- timization capability and is suitable for multi-objective optimization problems.
文摘In this study, we visualize Pareto-optimum solutions derived from multiple-objective optimization using spherical self-organizing maps (SOMs) that lay out SOM data in three dimensions. There have been a wide range of studies involving plane SOMs where Pareto-optimal solutions are mapped to a plane. However, plane SOMs have an issue that similar data differing in a few specific variables are often placed at far ends of the map, compromising intuitiveness of the visualization. We show in this study that spherical SOMs allow us to find similarities in data otherwise undetectable with plane SOMs. We also implement and evaluate the performance using parallel sphere processing with several GPU environments.
文摘In this papert the theory of major efficiency for multiobjective programmingis established.The major-efficient solutions and weakly major-efficient solutions of multiobjective programming given here are Pareto efficient solutions of the same multiobjectiveprogramming problem, but the converse is not true. In a ceratin sense , these solutionsare in fact better than any other Pareto efficient solutions. Some basic theorems whichcharacterize major-efficient solutions and weakly major-efficient solutions of multiobjective programming are stated and proved. Furthermore,the existence and some geometricproperties of these solutions are studied.
文摘对计及经济、环境因素的电力系统发电调度问题(Economic Environmental Dispatching,EED)进行研究,提出一种采用改进多目标灰狼算法的发电调度规划方案。构建基于发电燃料成本、污染气体排放量和节点电压偏移量等指标的多目标EED模型,并采用改进的多目标灰狼算法进行求解,以得到更优的Pareto前沿和折中解。设计多度量自适应FCM算法对灰狼算法(Gray Wolf Algorithm,GWA)种群多样性进行分析,重新定义狼群层级结构和Pareto前沿规模控制策略,并在此基础上提出反向学习和变异进化策略,以提升GWA全局收敛性能。仿真结果表明,改进的GWA具有优秀全局寻优能力,而且基于改进多目标灰狼算法得到的Pareto前沿和折中解更具可行性和优越性。
文摘大规模稀疏多目标优化问题(Sparse Multiobjective Optimization Problems,SMOPs)广泛存在于现实世界。为大规模SMOPs提出通用的解决方法,对于进化计算、控制论和机器学习等领域中的问题解决都具有推动作用。由于SMOPs具有高维决策空间和Pareto最优解稀疏的特性,现有的进化算法在解决SMOPs时,很容易陷入维数灾难的困境。针对这个问题,以稀疏分布的学习为切入点,提出了一种基于在线学习稀疏特征的大规模多目标进化算法(Large-scale Multiobjective Evolutio-nary Algorithm Based on Online Learning of Sparse Features,MOEA/OLSF)。具体地,首先设计了一种在线学习稀疏特征的方法来挖掘非零变量;然后提出了一种稀疏遗传算子,用于非零变量的进一步搜索和子代解的生成,在非零变量搜索过程中,其二进制交叉和变异算子也用于控制解的稀疏性和多样性。与最新的优秀算法在不同规模的测试问题上的对比结果表明,所提算法在收敛速度和性能方面均更优。