运输网络中最小饱和流的求解

运输网络中常常由于流量的不可控易发生堵塞现象.网络发生堵塞时的饱和流值达不到最大流值.最小饱和流是运输网络,尤其是紧急疏散网络设计中很重要的一个参数.通过建立网络的割集矩阵来确定网络的堵塞截面,基于此提出了求解最小饱和流的线性规划模型及算法.举例分析表明,利用该算法计算网络最小饱和流更加简便、更加实用.     

Long-term optimal operation of series parallel reservoirs for critical period with specified monthly generation and average monthly storage

We present in this paper an efficient approach for solving the problem of planning the long-term (multiyear) operation of a multireservoir hydroelectric power system for the critical period with a monthly variable load. This load is equal to a certain percentage of the total generation at the end of the year, subject to satisfying a number of constraints on the hydrosystem, using the minimum norm formulation.The proposed method is efficient in computing time and in calculating the total expected benefits from the system during the critical period. Numerical results are reported for a real system in operation consisting of two rivers. Each river has two series reservoirs.This work was supported by the Natural Science and Engineering Research Council of Canada, Grant No. A4146.     

Partitioning series-parallel multigraphs into ν *-excluding edge covers

We prove that, for any given vertex ν* in a series-parallel graph G, its edge set can be partitioned into κ = min{κ′(G) + 1, δ(G)} subsets such that each subset covers all the vertices of G possibly except for ν*, where δ(G) is the minimum degree of G and κ′(G) is the edge-connectivity of G. In addition, we show that the results in this paper are best possible and a polynomial time algorithm can be obtained for actually finding such a partition by our proof.     

第I种非对称三态叠加多模叠加态光场的高次和压缩——第一正交分量的N次方H压缩效应

构造了第孙中禹种强度不等的非对称三态叠加多模叠加态光场|ψ₁^(ABC)〉_q.利用多模压缩态理论研究了态|ψ₁^(ABC)〉_q第一正交分量高次和压缩.结果发现:①当构成态|ψ₁^(ABC)〉_q的三个多模相干态光场的强度不相等时,在一定条件下,态|ψ₁^(ABC)〉_q的第一正交分量可出现任意幂次的高次和压缩.②当上述的三个多模相干态光场强度相等时,态|ψ₁^(ABC)〉_q的第一正交分量的高次和压缩现象消失.在这种情况下,态|ψ₁^(ABC)〉_q的第一正交分量恒处于NH最小测不准态.     

一般线性模型下方差最小范数二次无偏估计的稳健性

本文给出了一般线性模型下,由最小二乘得到的方差估计与最小范数二次无偏估计相等的充分必要条件,并且当Gauss-Markov估计与最小二乘估计相等时,可以得到一个简单的等价条件。     

Nonlinear Energy Transfer over the Wave Spectrum in Water Covered by Solid Ice

On the basis of the hydrodynamic equations for nonlinear elastic-gravity waves beneath a solid ice cover and their Hamiltonian representation, a three-wave kinetic equation for the time evolution of the wave spectrum is formulated. The properties of the kernel of the kinetic integral describing the nonlinear interactions between wave triplets are investigated. An algorithm for numerically calculating the kinetic integral is developed. The rate of nonlinear energy transfer over the wave spectrum is estimated quantitatively and its most important characteristics are found.     

A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing

We address in this paper the problem of finding an optimal strategy for dealing with bottleneck machines and bottleneck parts in the cell formation process in group technology. Three types of economic decisions are considered: subcontracting, machine duplication and intercell moves. The problem is formulated as a minimum weighted node covering problem in a hypergraph, and we show that it can be solved in polynomial time by finding a maximum weighted stable set in a bipartite graph. We extend this result to cellular manufacturing systems in which the sequence of operations of each part is known in advance.     

求解无线传感器网络路由问题的蚁群最优化算法及其收敛性

首先将无线传感器网络的路由问题转化成求解最小Steiner树问题,然后给出了求解无线传感器网络路由的蚁群优化算法,并对算法的收敛性进行了证明．最后对找到最优解后信息素值的变化进行了分析．即在限制信息素取值的条件下,当迭代次数充分大时,该算法能以任意接近于1的概率找到最优解,并且当最优解找到后,最优树边上的信息素单调增加,而最优解以外边上的信息素在有限步达到最小值．     

求解最小Steiner树的蚁群优化算法及其收敛性

最小Steiner树问题是NP难问题,它在通信网络等许多实际问题中有着广泛的应用．蚁群优化算法是最近提出的求解复杂组合优化问题的启发式算法．本文以无线传感器网络中的核心问题之一,路由问题为例,给出了求解最小Steiner树的蚁群优化算法的框架．把算法的迭代过程看作是离散时间的马尔科夫过程,证明了在一定的条件下,该算法所产生的解能以任意接近于1的概率收敛到路由问题的最优解．