多种燃料锅炉效率曲线的辨识方法

多种燃料锅炉的运行优化是钢铁联合企业节约能源的一个主要方法,但是这种锅炉的效率曲线的辨识却是一个复杂而困难的非线性最小二乘问题。借鉴大系统递阶算法的思想,本文提出了一种新的两级递阶辨识的算法。这种算法通过预估关联量,将非线性最小二乘问题转化为两级线性最小二乘问题。实验的结果证明:这种算法是一种有效的算法。     

递阶智能控制系统的一般结构

研究递阶智能控制系统的结构问题,介绍了递阶智能机器的一般结构,讨论了与组织级模型有关的决策段结构,并研究了协调级和执行级的控制结构模型。     

城市供水系统优化调度

基于大系统分解协调原理,本文对城市供水系统提出了两级递阶优化调度算法。对某市实际供水系统的计算表明,该方法能满足在线优化要求,有较好的经济效益。     

基于HGA的最小旅行时间多旅行商问题研究

为了解决最小化旅行时间的多旅行商一类问题,提出了一种递阶遗传算法和矩阵解码方法。该算法根据问题的特点,采用一种递阶编码方案,此编码与多旅行商问题一一对应。用递阶遗传算法优化多旅行商问题不需设计专门的遗传算子,操作简单,并且解码方法适于求解距离矩阵对称和距离矩阵非对称的多旅行商问题。计算结果表明,递阶遗传算法是有效的,能适用于优化最小化完成时间的多旅行商问题。     

基于递阶遗传算法的多旅行商问题优化*

旅行商问题是一个经典的NP问题,对多人旅行商问题的求解则更具有意义。为了解决所有旅行商路径总和最小为优化标准的多旅行商一类问题,提出了一种递阶遗传算法和矩阵解码方法。该算法根据问题的特点,采用一种递阶编码方案,此编码与多旅行商问题一一对应。用递阶遗传算法优化多旅行商问题无须设计专门的遗传算子,操作简单,并且解码方法适于求解距离对称和距离非对称的多旅行商问题。计算结果表明,递阶遗传算法是有效的,能适用于优化多旅行商问题。     

多智能体系统一致性的递阶结构设计

针对多智能体系统的一致性协作,研究了以提高群体一致性收敛速度为目标的多层递阶拓扑结构设计问题.首先讨论了满足物理拓扑约束并具有更优性能的递阶拓扑结构存在的可能性.在此基础上,根据一致性问题的收敛时间性能指标,将递阶结构设计转化为一个与多层递阶系统中所有子图拉普拉斯矩阵特征值相关的优化问题.通过将连通图转换为若干点导出子图和它们之间的关联图,提出一个该优化问题的双层拓扑结构设计算法,并基于该算法发展了满足物理拓扑结构约束的多层递阶结构设计算法.仿真算例表明由此设计的递阶协作过程可有效加快多智能体群体一致性的收敛速度.     

基于递阶遗传算法的并行多机调度优化

针对最小化完工时间的等同和非等同并行多机调度一类问题，提出了一种递阶遗传算法。该算法根据问题的特点，采用一种递阶编码方案，此编码与调度方案一一对应。用递阶遗传算法优化并行多机调度不需设计专门的遗传算子，操作简单。计算结果表明，递阶遗传算法是有效的，能适用于大规模等同和非等同并行多机调度问题。     

基于集散递阶管控的滩海油田测控系统

针对现在海上平台监控系统中存在的问题，提出了利用分级递阶思想的集散递阶管控的滩海油田测控系统设计。该设计结合了集散控制系统的集散性和智能控制系统的递阶性，把系统分为组织级、协调/监控级、执行级、采用现代通信网络技术将计算机与PLC有机结合的模式予以实现。工程实例表明，该设计方案是行之有效的，具有在滩海油田测控系统应用推广的价值。     

递阶动态规划在大规模火力规划中的应用

在基本火力规划模型的基础上,建立了一种大规模火力规划问题的递阶模型,并运用大系统的递阶优化算法和动态规划优化算法,提出了一种新的求解该模型的递阶动态规划算法。该方法层次清晰,降低了计算复杂程度,并且适合并行计算,能迅速找到火力规划问题的最优火力分配方案和最优解。仿真算例表明了该方法的实用性。     

一类非线性两层规划问题的递阶优化解法

提出一种求解一类非线性两层规划问题的新方法．通过引入解耦向量将非线性两层规划问题分解为独立且易于求解的子问题，利用两级递阶结构第1级求解若干优化的子问题，而在第2级利用第1级求解的结果调整解耦向量．所提出的方法借助于分解一协调原理并按迭代方式最终求得问题的最优解．对于含整数的规划问题，通过连续化处理后也可按该方法方便地求解．算例表明所提出的算法是简便而有效的．     

求解双层规划优化问题的层次风驱动优化算法

针对双层规划的求解问题, 提出一种层次风驱动优化算法. 初始化上层优化变量后, 首先对下层规划进行求解, 满足约束条件的同时, 更新下层规划中的空气质点速度和位置; 然后, 利用风驱动优化算法对上层规划问题进行求解; 最后, 在优化解集合中, 选择上下层规划目标值次序之和最小的解作为最终优化解. 实验结果表明, 所提出的层次风驱动算法是一种有效的求解双层规划问题的方法.

     

Semantic network array processor and its applications to image understanding

The problems in computer vision range from edge detection and segmentation at the lowest level to the problem of cognition at the highest level. This correspondence describes the organization and operation of a semantic network array processor (SNAP) as applicable to high level computer vision problems. The architecture consists of an array of identical cells each containing a content addressable memory, microprogram control, and a communication unit. The applications discussed in this correspondence are the two general techniques, discrete relaxation and dynamic programming. While the discrete relaxation is discussed with reference to scene labeling and edge interpretation, the dynamic programming is tuned for stereo.     

一类区间系数二次双层规划问题的遗传算法

针对上下层均含区间系数的二次双层规划,提出了一种基于两个适应度评估的遗传算法。将下层目标系数区间作为遗传算法的搜索空间,对于每一个确定的个体,下层问题不含区间系数;利用二次规划的最优性条件,将个体所对应的问题转化为两个确定的二次规划;利用基枚举方法求解这两个二次规划问题,相应的最优值作为个体的两个适应度。算法通过两个适应度的比较,获得问题的最好最优解和最差最优解。数值仿真结果表明,该算法是可行有效的。     

Hierarchy of processing equipment configuration design problems for multiproduct chemical plants

A procedure for performing one stage of designing multiproduct chemical plant—definition of the processing equipment configuration is proposed. At this stage, a three-level hierarchical structure of problems is formed—at the upper level, the parameters of the operational mode of the chemical engineering system that ensures the desired output of each product are found; at the middle level, the size and number of equipment units and methods of product processing for all processing stages are chosen; at the lower level, technological and mechanical design of individual pieces of equipment (machines) are performed. The decomposition of the processing equipment design problem into three problems described above reduces the original mixed integer nonlinear programming problem to one nonlinear programming problem and a set of integer programming problems, where the number of integer programming problems is equal to the number of processing stages. The reduced problems can be solved using available optimization methods, which considerably reduces the solution time and improves the quality of design solutions. Basic information links between the problems of different hierarchical levels are determined, general problem statements and an algorithm for the simultaneous solution of the upper and middle level problems is proposed. By way of example, the problem of selection and design of a mechanical agitator for a vertical bulk-capacity storage is considered.     

A global optimization algorithm for solving the bi-level linear fractional programming problem

In this paper, we obtain the solution to bi-level linear fractional programming problem (BLFP) by means of an optimization algorithm based on the duality gap of the lower level problem. In our algorithm, the bi-level linear fractional programming problem is transformed into an equivalent single level programming problem by forcing the dual gap of the lower level problem to zero. Then, by obtaining all vertices of a polyhedron, the single level programming problem can be converted into a series of linear fractional programming problems. Finally, the performance of the proposed algorithm is tested on a set of examples taken from the literature.     

Scalability of hybrid programming for a CFD code on the Earth Simulator

The Earth Simulator (ES) is an SMP cluster system. There are two types of parallel programming models available on the ES. One is a flat programming model, in which a parallel program is implemented by MPI interfaces only, both within an SMP node and among nodes. The other is a hybrid programming model, in which a parallel program is written by using thread programming within an SMP node and MPI programming among nodes simultaneously. It is generally known that it is difficult to obtain the same high level of performance using the hybrid programming model as can be achieved with the flat programming model.

In this paper, we have evaluated scalability of the code for direct numerical simulation of the Navier–Stokes equations on the ES. The hybrid programming model achieves the sustained performance of 346.9 Gflop/s, while the flat programming model achieves 296.4 Gflop/s with 16 PNs of the ES for a DNS problem size of 256³. For small scale problems, however, the hybrid programming model is not as efficient because of microtasking overhead. It is shown that there is an advantage for the hybrid programming model on the ES for the larger size problems.     

Separating Interaction Concerns from Distributed Feature Components

Interaction problems between heterogeneous appli-cations require consideration of the semantic issue of reliable composition. This problem has become significant and ubiquitous in distributed systems as the Internet rapidly grows as a mainstream service platform and requires increasing automatic coordination and cooperation between services at two ends. A feature must be able to adjust itself to work with other features or services - a highly relevant problem called feature interaction. In line with this, in this paper we propose a complexity controlling method that is suitable for distributed systems in which each feature has two concerns, namely a hard logic and a soft logic. The hard logic implements exactly the specification of a feature, while the soft logic deals with the adaptation aspects of a feature, i.e. resolving interaction problems and making features work together. A two level architecture, particularly designed for aspect oriented programming, is described with a meta level being used to describe interaction resolution, with features being at the base level. Through a case study of email systems, we explain the architecture and highlight the cause of resolution interaction problems and how this particular problem is solved.     

Solving a type of biobjective bilevel programming problem using NSGA-II

This paper considers a type of biobjective bilevel programming problem, which is derived from a single objective bilevel programming problem via lifting the objective function at the lower level up to the upper level. The efficient solutions to such a model can be considered as candidates for the after optimization bargaining between the decision-makers at both levels who retain the original bilevel decision-making structure. We use a popular multiobjective evolutionary algorithm, NSGA-II, to solve this type of problem. The algorithm is tested on some small-dimensional benchmark problems from the literature. Computational results show that the NSGA-II algorithm is capable of solving the problems efficiently and effectively. Hence, it provides a promising visualization tool to help the decision-makers find the best trade-off in bargaining.     

两层多目标规划的罚函数法

研究了一类非线性两层多目标规划问题.在下层多目标规划问题的目标函数是严格凸函 数、决策变量约束集是凸集的假设下,通过将两层多目标规划问题转化成一系列单层多目标规划 问题,建立了两层多目标规划的罚函数理论,并进行了收敛性分析.从而丰富了两层多目标规划的 理论,为解决实际中的两层多目标决策问题提供了有力的工具.