基于BGP／MPLSIPVPN的综合业务通信专网规划与路由器配置

以某公司组建综合业务通信专网的业务需求为背景,阐述了网络拓扑结构设计、路由策略规划以及具体的设备配置过程。其中,CE以静态路由方式接入PE,VPN跨域采用OptionA方式,并在域间配置双向转发检测和多归路识别属性。     

A generalized assignment model for dynamic supply chain capacity planning

We consider a generalization of the well‐known generalized assignment problem (GAP) over discrete time periods encompassed within a finite planning horizon. The resulting model, MultiGAP, addresses the assignment of tasks to agents within each time period, with the attendant single‐period assignment costs and agent‐capacity constraint requirements, in conjunction with transition costs arising between any two consecutive periods in which a task is reassigned to a different agent. As is the case for its single‐period antecedent, MultiGAP offers a robust tool for modeling a wide range of capacity planning problems occurring within supply chain management. We provide two formulations for MultiGAP and establish that the second (alternative) formulation provides a tighter bound. We define a Lagrangian relaxation‐based heuristic as well as a branch‐and‐bound algorithm for MultiGAP. Computational experience with the heuristic and branch‐and‐bound algorithm on over 2500 test problems is reported. The Lagrangian heuristic consistently generates high‐quality and in many cases near‐optimal solutions. The branch‐and‐bound algorithm is also seen to constitute an effective means for solving to optimality MultiGAP problems of reasonable size. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

舰载对陆巡航导弹规划航路点间距离的计算分析

针对舰载对陆巡航导弹在实际飞行中,其航迹需要参考近似大地线的航线,在充分考虑导弹由海对陆的航路规划过程基础上,提出了易于编程、精度有所改进的空间两点间大地距离的计算方法。该方法在考虑高程的地球椭球模型参数的求取基础上,利用Bowring反解公式重新推导了顾及高程的空间航路点间的计算公式。相关算例表明,该方法提高了导弹规划航路点间距离的计算精度且易于工程实现。     

高效率机动部署航空武器靶场关键技术和应用

为用户设计了一个航空武器试验靶场,具备空空、空地和地空导弹试验能力,可机动部署,具有易于运行和运维代价低的特点。靶场由载机遥测系统、测量雷达、光电跟踪系统、微波和光纤通信系统、靶机遥测站、指挥控制等6个子系统构成;指挥控制子系统之外的5个子系统均使用国产成熟产品。在总体方案和指挥控制子系统设计中,对互联集成方案、机动部署、试验航线设计和发布、自动化领航、自动化指挥决策等5项关键技术进行了着重优化。在实际应用中,全靶场运行仅需20多成员(不含飞行和机场机务人员),3天内完成新试验场部署和联调,对作战部队飞行员进行5架次航线训练后即进行实弹试验,2天内完成多发中程拦截和近距格斗空空导弹试验。     

基于k短路径的兵力机动路线优化方法

由于传统Dijkstra算法只能求解最优路径,结合兵力机动路线选择的需要,将求解k短路径的实用算法引入到兵力机动路线优化问题中,给出了算法的数据结构和步骤。在道路权重的确定上,提出将路程、通行能力和安全性三项指标相结合的思想,并给出了综合权重的计算方法。仿真实验表明所提方法具有较强的实用性。     

基于遗传算法的自航水雷航路规划

自航水雷在执行任务时需要装载根据战场环境预先规划好的最优路径,路径的优劣直接决定了自航水雷的作战效率.采用遗传算法进行自航水雷航路优化,算法利用极坐标描述威胁位置和航路点,将航路编码由二维缩减至一维,降低了搜索空间,提高了优化效率.对算法进行了相应的仿真,仿真结果表明,编码方式提高了优化效率,得到的航路有效地规避了威胁.     

A bidirectional heuristic for maximizing the net present value of large‐scale projects subject to limited resources

We consider the scheduling of large‐scale projects to maximize the project net present value given temporal and resource constraints. The net present value objective emphasizes the financial aspects of project management. Temporal constraints between the start times of activities make it possible to handle practical problem assumptions. Scarce resources are an expression of rising cost. Since optimization techniques are not expedient to solve such problems and most heuristic methods known from literature cannot deal with general temporal constraints, we propose a new bidirectional priority‐rule based method. Scheduling activities with positive cash flows as early and activities with negative cash flows as late as possible results in a method which is completed by unscheduling techniques to cope with scarce resources. In a computational experiment, we compare the well‐known serial generation scheme where all activities are scheduled as early as possible with the proposed bidirectional approach. On the basis of a comprehensive data set known from literature containing instances with up to 1002 activities, the efficiency of the new approach is demonstrated. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

一种基于知识的作战计划系统设计

作战计划系统是复杂的问题求解系统,在军事领域的各个方面发挥着重要的作用。介绍了当前一些主要的作战计划辅助生成系统及其特点,分析比较和归纳整理了当前军用计划系统所采用的一些常见规划技术和优缺点,重点分析了作战计划系统中的智能规划技术。在此基础上,提出了一种基于知识的作战计划辅助生成系统的开发设想,构建了系统知识库,系统采用层级任务网络规划技术,给出了这种规划技术的理论框架和算法过程,并且把这种技术与多主体规划技术相结合,辅助实现军事作战任务的逐层分解与规划优化,进而生成完整的行动序列,较好地解决了作战计划辅助生成问题。     

基于分形理论的目标航路预测

电磁干扰条件下解决断续航路预测问题对防空兵有效抗击空中目标至关重要。针对包络灰预测方法预测精度较低和Verhulst灰色预测模型计算过程复杂的情况,提出了预测航路的分形方法。在分形理论的基础上,研究了其用于目标断续航路预测的基本思路,建立了基于分形的目标航路预测模型,并对模型进行了求解。最后,利用建立的分形模型对雷达丢失目标后的目标航路进行了预测,通过实例体现了分形方法在用于航路预测时的准确性、灵活性和易实现等特点。结果表明,用该法对断续目标航路的预测具有一定的借鉴意义。     

Dynamic order acceptance and capacity planning on a single bottleneck resource

We present a tactical decision model for order acceptance and capacity planning that maximizes the expected profits from accepted orders, allowing for aggregate regular as well as nonregular capacity. The stream of incoming order arrivals is the main source of uncertainty in dynamic order acceptance and the company only has forecasts of the main properties of the future incoming projects. Project proposals arrive sequentially with deterministic interarrival times and a decision on order acceptance and capacity planning needs to be made each time a proposal arrives and its project characteristics are revealed. We apply stochastic dynamic programming to determine a profit threshold for the accept/reject decision as well as to deterministically allocate a single bottleneck resource to the accepted projects, both with an eye on maximizing the expected revenues within the problem horizon. We derive a number of managerial insights based on an analysis of the influence of project and environmental characteristics on optimal project selection and aggregate capacity usage. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007