中心问题与中位问题的研究现状

P-中心问题与p-中位问题是两类基本的选址问题，在选址问题的研究中占有十分重要的地位。本文从问题的性质、算法设计思想与计算复杂性等方面总结了现有的研究成果，并指出了进一步研究的方向。     

Societal problems more complex than presumed: The Compram methodology

Complex societal problems are often wrongly addressed by politicians as mono-disciplinary, relatively easy to solve problems. By directly jumping to conclusions politicians overlook the complexity of the problems in their decision making process. Complex societal problems are generally interdisciplinary problems and should be addressed in a multi-disciplinary way considering the multiple actors and their interactions, the many variables involved, as well as the emotions that the problems provokes. These many interactions are the cause of the complexity of the problem handling process. It is high time that complex societal problems are addressed by the politicians in the right way using the methodology, methods and tools of the field of Methodology of Societal Complexity so the problems can be handled in an adequate, transparent, efficient and proper way, mitigating the damage the problems are causing. The field of Methodology of Societal Complexity developed ways to guide the problem handling process of complex societal problems for analysing, decision making and implementing interventions in an adequate, democratic and efficient way. The Compram methodology is a major methodology in this field and directs in a structured, democratic, and efficient way, the problem handling process of complex societal problems by using a multi-disciplinary, multi actor approach including emotional aspects. The OECD (2006) advised governments to handle complex societal problems that threaten global safety according to the Compram methodology. The universities should include issues of the field of Societal Complexity into their disciplines so that future managers are aware how complex societal problems should be handled.     

Concise review of relaxations and approximation algorithms for nonidentical parallel-machine scheduling to minimize total weighted completion times

A class of nonidentical parallel machine scheduling problems are considered in which the goal is to minimize the total weighted completion time. Models and relaxations are collected. Most of these problems are NP-hard, in the strong sense, or open problems, therefore approximation algorithms are studied. The review reveals that there exist some potential areas worthy of further research.     

Concise review of relaxations and approximation algorithms for nonidentical parallel-machine scheduling to minimize total weighted completion times

A class of nonidentical parallel machine scheduling problems are considered in which the goal is to minimize the total weighted completion time.Models and relaxations are collected.Most of these problems are NP-hard,in the strong sense,or open problems,therefore approximation algorithms are studied.The review reveals that there exist some potential areas worthy of further research.     

标准遗传算法的改进方案——加速遗传算法

针对标准遗传算法在实际应用中存在的问题 ,设计了简单遗传算法的一种改进形式——加速遗传算法 ( AGA) ,并对 AGA的有效性和可行性进行了理论分析和实例分析 .     

A Measure of the Structured Degree for Decision Problems

ＡＭｅａｓｕｒｅｏｆｔｈｅＳｔｒｕｃｔｕｒｅｄＤｅｇｒｅｆｏｒＤｅｃｉｓｉｏｎＰｒｏｂｌｅｍｓＸＩＡＯＲｅｎｂｉｎＨｕａｚｈｏｎｇＵｎｉｖｅｒｓｉｔｙｏｆＳｃｉｅｎｃｅａｎｄＴｅｃｈｎｏｌｏｇｙ，Ｗｕｈａｎ，Ｈｕｂｅｉ，４３００７４，ＣｈｉｎａＡｂ...     

面向复杂决策问题的结构计算方法研究

决策问题的复杂性与决策问题的结构化程度是高度相关的,对于决策问题复杂性的研究,主要体现在对策问题结构化的研究上。借鉴复杂系统分层递阶结构的特点,对复杂决策问题的层次结构进行形式化定义,描述了复杂决策问题的结构集成,提出问题结构集成的关键在于支配决策单元的相对权重的获得,运用梯度向量法对复杂决策问题进行层次结构分析,并结合算例验证了该方法的有效性。     

非光滑多目标Stackelberg问题的最优性条件

本文研究非光滑多目标Ｓｔａｃｋｅｌｂｅｒｇ问题，给出其有关性质及最优性必要条件，并对若干特例进行了讨论．     

高阶FD-WENO格式用于Richtmyer-Meshkov不稳定性数值模拟

用双曲守恒律组的高阶加权本质上无振荡有限差分格式(FD-WENO)求解在众多领域有着重要应用的高马赫数二维流体界面Richtmyer-Meshkov不稳定性问题及激波与气泡相互作用问题,获得了较为理想的数值结果。表明高阶FD-WENO格式的确特别适合于求解这类既具有激波有具有复杂流动结构的流体动力学问题,它比通常的二阶Godunov格式(如PPM等)更为优越。     

大规模不可分组合优化问题的双环迭代算法

对于一类大规模、不可分的非线性组合优化问题,直接求解困难很大．本文把原问题嵌入到可分的参数规划问题中,并证明了原问题的最优解包含在可分的参数规划问题的最优解集中．然后从最优解集中挑出原问题的最优解．这种算法为三级算法．本文证明了算法的收敛性并建立了其理论基础,仿真效果好．     

Chaotic Neural Network Technique for "0-1" Programming Problems

0-1 programming is a special case of the integer programming, which is commonly encountered in many optimization problems. Neural network and its general energy function are presented for 0-1 optimization problem. Then, the 0-1 optimization problems are solved by a neural network model with transient chaotic dynamics (TCNN). Numerical simulations of two typical 0-1 optimization problems show that TCNN can overcome HNN's main drawbacks that it suffers from the local minimum and can search for the global optimal solutions in to solveing 0-1 optimization problems.     

Exponential distribution-based genetic algorithm for solving mixed-integer bilevel programming problems

Two classes of mixed-integer nonlinear bilevel programming problems are discussed. One is that the follower＇s functions are separable with respect to the follower＇s variables, and the other is that the follower＇s functions are convex if the follower＇s variables are not restricted to integers. A genetic algorithm based on an exponential distribution is proposed for the aforementioned problems. First, for each fixed leader＇s variable x, it is proved that the optimal solution y of the follower＇s mixed-integer programming can be obtained by solving associated relaxed problems, and according to the convexity of the functions involved, a simplified branch and bound approach is given to solve the follower＇s programming for the second class of problems. Furthermore, based on an exponential distribution with a parameter λ, a new crossover operator is designed in which the best individuals are used to generate better offspring of crossover. The simulation results illustrate that the proposed algorithm is efficient and robust.     

神经网络与专家系统

本文通过对专家系统与神经网络各自特点的考察，探讨了将两者结合起来并保留各自优点的可行途径，进一步指出了有待解决的问题。同时通过对电力系统中ＮＮ应用状况的回顾，展望了这一技术在电力系统中的应用前景。     

QUENCHING PHENOMENA FOR SYSTEMS OF SEMILINEAR PARABOLIC EQUATIONS I

1.IntroductionConsiderthefollowinginitial-boundaryvalueproblemforthesystemsofsemilinearparabolicequationsWhereG.~(--a,a)x(0,Ta),r.~({--a,a}x[0,Ta))U([--a,a]x{0}),andf(z)andg(z)satisfy(FGI)f(z):(--co,ba)-R ,g(z):(--co,bl)-R ,f(0)>0,andg(0)>0;(FG2)i(z)andg(…     

具有主从结构的非光滑两层优化问题

本文研究一类具有主从结构的非光滑两层化问题。基于Ｃｌａｒｋｅ意义下的非光滑分析理论，给出了该类问题的最优性条件，并对模型的求解方法进行了讨论。     

复杂性科学几个新兴的应用研究方向

介绍了复杂性科学几个新兴的应用研究方向，包括人造复杂工程系统、国际安全与军备控制、电子信息系统等复杂系统中的复杂性问题。分析了各自的研究现状、需要解决的主要问题和未来的发展方向，并对其可能的研究方法和研究思路进行了讨论。复杂性科学的应用不仅使这几个领域的研究极有可能出现新的理论与技术突破，而且从这些应用领域提出的问题也将会进一步丰富复杂性科学的内涵，并推动复杂性科学的发展。     

Research on evaluations of several grey relational models adapt to grey relational axioms

Grey relational analysis is an important part of the grey systems theory, and it is the basis of the grey clustering analysis, grey decision-making and grey controlling. To research whether grey relational models satisfy the four grey relational theorems, several kinds of grey relational models are commented. Some problems including the properties of normality, pair symmetry and wholeness are discussed. The phenomenon that the lower value of almost each grey relational model is not equal to zero is proved. The contradiction problems between the properties of wholeness and pair symmetry are verified. Finally, several propositions are constructed to explain the above problems.     

复杂液压系统动态特性仿真中的刚性问题研究

针对复杂液压系统动态特性仿真中出现的刚性问题，从基本波压元件的建模入手研究了降低系统模型刚性问题的方法。基于里兹近似法，从分布参数模型出发得到了液压管路的精确近似的集中参数模型；引入了分段的阀口流量计算公式，解决了传统紊流流量方程存在奇点的问题；采用迭代计算、模型降阶和线性化处理的方法，避免了小液压容腔和小阀芯质量引入系统模型时带来的刚性问题。     

Sample average approximation method for a class of stochastic variational inequality problems

This paper considers a class of stochastic variational inequality problems. As proposed by Jiang and Xu (2008), by using the so-called regularized gap function, the authors formulate the problems as constrained optimization problems and then propose a sample average approximation method for solving the problems. Under some moderate conditions, the authors investigate the limiting behavior of the optimal values and the optimal solutions of the approximation problems. Finally, some numerical results are reported to show efficiency of the proposed method.     

遗传算法求解旅行商问题时的基因片段保序

针对基于遗传算法的 TSP问题求解 ,尝试了多种遗传操作 ,分析了这些操作在遗传算法中的作用 ,讨论了基因片段保序在利用遗传算法求解 TSP问题中的重要性 .