一种新的WDM光网中的共享链路保护策略

研究了WDM光网中的链路保护问题.提出了一种新的共享链路保护策略--基于SRLG的共享链路保护策略(SRLG-SLP).SRLG(共享风险链路组)定义了对一条工作光通道分配保护资源时的资源可用性的约束.它规定任意两条有着同样故障风险或者说处于同一个SRLG的工作光通道不能利用同样的保护资源.另外,还提出了一种更加符合实际的单链路故障模型,其中链路故障间隔时间和链路故障保持时间被考虑作为两个独立的变量.基于该链路故障模型,通过大量的仿真试验,比较了专用链路保护(DLP)、共享链路保护(SLP)和提出的SRLG-SLP保护策略的资源利用率、保护效率以及业务中断率.结果显示,我们提出的SRLG-SLP在保护效率和业务中断率方面的保护性能远好于DLP和SLP,但会牺牲一些资源利用率.     

基于遗传算法和指标满意度求解的第三方物流企业物流中心选址方法

本利用AHP和模糊综合评价法评价物流中心选址的定性指标、用量化选址模型结合遗传算法计算定量指标，再藉助指标满意度求解把定性和定量的指标进行综合，从而为决策对物流中心选址做出科学的决策提供支持。     

There are infinitely many limit points of the fractional parts of powers

Suppose that α > 1 is an algebraic number and ξ > 0 is a real number. We prove that the sequence of fractional partsξα ⁿ , n = 1, 2, 3, …, has infinitely many limit points except when α is a PV-number and ξ ∈ ℚ(α). For ξ = 1 and α being a rational non-integer number, this result was proved by Vijayaraghavan.     

Second Order Nonlinear Evolution Inclusions Ⅰ： Existence and Relaxation Results

This is the first part of a work on second order nonlinear, nonmonotone evolution inclusions defined in the framework of an evolution triple of spaces and with a multivalued nonlinearity depending on both x（t） and x（t）. In this first part we prove existence and relaxation theorems. We consider the case of an usc, convex valued nonlinearity and we show that for this problem the solution set is nonempty and compact in C^1 （T, H）. Also we examine the Isc, nonconvex case and again we prove the existence of solutions. In addition we establish the existence of extremal solutions and by strengthening our hypotheses, we show that the extremal solutions are dense in C^1 （T, H） to the solutions of the original convex problem （strong relaxation）. An example of a nonlinear hyperbolic optimal control problem is also discussed.     

需求势能理论的配送中心选址方法的研究

物流配送中心选址的合理性直接影响着物流分销网络规划和优化.提出了针对物流网点选址的需求势能理论,并提出了一种基于需求势能的分销物流系统中配送中心的选址实现方法.最后通过实例证明,该方法简便快捷,结果正确合理,为解决此类配送中心选址问题提供了科学的指导依据.     

Evaluating dredging and offshore loading locations for U.S. coal exports using the local logistics system

The formulation and use of a mixed integer mathematical programming location-allocation model, the Coal Logistics System (COLS), is presented in this study. COLS is used to evaluate the potential for reducing water-borne coal transportation costs, and concomitantly the costs of delivering coal to European markets. This cost reduction is accomplished through the use of supercolliers which would require the dredging of channels at selected ports or the use of offshore loading sites at East and Gulf Coast ports or both. The model developed and the analysis presented in this paper are intended to aid in the determination of the location and extent of these activities, and to indicate the size of the potential reduction in the costs of U.S. export coal. In order to be able to accommodate these deeper draft vessels at East and Gulf Coast ports, expensive improvements would need to be undertaken which may include the deepening of harbor channels to the depths required for 120 000 dead weight ton (dwt) or larger supercolliers. Since dredging requires large initial investments and has significant long-term maintenance costs, excess capacity could represent an inefficient use of both U.S. revenues and the ports' own funds. The use of offshore loading moorings to permit the topping off of supercolliers by self-unloading colliers at the deepwater sections of harbor channels has been proposed as a way of reducing trans-ocean transportation costs and avoiding the large investments and time delays associated with dredging activities. The Coal Logistics System was modified and extended to enable the evaluation of these two port improvement options to be undertaken in a consistent and realistic manner.     

On the Integration by Parts and Characterization of a Fractional Diffusion Process北大核心CSCD

本文研究分数扩散过程和其分部积分公式的关系.首先利用Bismut方法给出拉回公式,进而得到分数扩散过程的分部积分公式。反过来,证明了分数扩散过程可由其分部积分公式唯一刻画.     

汽车滚装码头泊位调度优化模型与算法研究

本文研究滚装码头混合泊位分配和劳动力分配的联合调度优化问题。首先,考虑潮汐时间窗约束、装卸劳动力约束、泊位缆桩分布约束以及泊位不规则布局因素,建立以最小化船舶总服务时间为目标的混合整数规划模型。其次,采用内外嵌套算法设计策略,提出求解该类问题的组合算法。其中,外层是多种群并行进化的遗传算法,生成多种船舶计划顺序,内层为基于规则的启发式算法,用于计算给定计划顺序的目标函数值。然后,基于实际运营数据,生成多组不同规模的算例进行全面数值实验,结果表明所提出的算法可在10分钟内求解包含50艘船、100个泊段的算例。最后,开展基于真实滚装码头运营实例的案例分析,对所提模型和算法在实际码头调度问题中的适用性与高效性进行验证。