A branch‐and‐cut algorithm for the nonpreemptive swapping problem

In the Swapping Problem (SP), we are given a complete graph, a set of object types, and a vehicle of unit capacity. An initial state specifies the object type currently located at each vertex (at most one type per vertex). A final state describes where these object types must be repositioned. In general, there exist several identical objects for a given object type, yielding multiple possible destinations for each object. The SP consists of finding a shortest vehicle route starting and ending at an arbitrary vertex, in such a way that each object is repositioned in its final state. This article exhibits some structural properties of optimal solutions and proposes a branch‐and‐cut algorithm based on a 0‐1 formulation of the problem. Computational results on random instances containing up to 200 vertices and eight object types are reported. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

基于蚁群算法和禁忌搜索的部队机动路径选择

高技术条件下的现代战争对部队机动路径选择问题提出了新要求,一方面道路网的扩大使问题求解的规模大大增加,另一方面作战环境和任务的变化使得问题本身不得不从多角度进行综合评价.增加了问题的复杂性.针对问题建立了数学模型,引入信息熵理论作为目标评价准则,借助改进的蚁群算法、禁忌搜索算法相结合的启发式方法对问题进行求解,得到了令人满意的结果.仿真结果分析认为,算法是切实有效的,并且具有良好的稳定性.     

Branch‐and‐price‐and‐cut for the manpower routing problem with synchronization constraints

In this article, we propose a branch‐and‐price‐and‐cut (BPC) algorithm to exactly solve the manpower routing problem with synchronization constraints (MRPSC). Compared with the classical vehicle routing problems (VRPs), the defining characteristic of the MRPSC is that multiple workers are required to work together and start at the same time to carry out a job, that is, the routes of the scheduling subjects are dependent. The incorporation of the synchronization constraints increases the difficulty of the MRPSC significantly and makes the existing VRP exact algorithm inapplicable. Although there are many types of valid inequalities for the VRP or its variants, so far we can only adapt the infeasible path elimination inequality and the weak clique inequality to handle the synchronization constraints in our BPC algorithm. The experimental results at the root node of the branch‐and‐bound tree show that the employed inequalities can effectively improve the lower bound of the problem. Compared with ILOG CPLEX, our BPC algorithm managed to find optimal solutions for more test instances within 1 hour. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 138–171, 2016     

基于多QoS约束的启发式路由选择算法设计与实现

针对时延、路由跳数以及网络资源利率3种约束,结合软件路由器项目,对路由选择算法的网络模型进行了描述和定义,并提出了基于多QoS约束的启发式路由选择算法（H_MCP）。通过在软件路由器上实现和测试,表明该算法具有可行性和启发性。     

基于TCP/IP协议栈构建的弹上飞控软件评测与验收系统的硬件实现

基于TCP/IP协议栈构建了弹上飞控软件评测与验收系统,详细描述了TCP/IP协议栈在该系统中的应用。     

基于综合性能的C3I系统通信效能

论述了C3I的重要性及其效能,分析了影响通信系统性能的因素,力求在实时综合性能的基础上选择通信路由,论述了传统Petri网和模糊Petri网的一些基本概念和特点及其区别,描述了用模糊Petri网进行系统综合性能分析时的有效算法,提出一种基于综合性能的路由选择算法,最后,通过实例来说明通信路由综合性能评价以及路由选择方法.     

协议测试中测试序列生成方法综述

文章在介绍协议一致性测试基本概念的基础上,重点列举了测试序列的几种生成方法。对目前广泛采用的形式化描述模型,重点介绍其中基于有限状态机模型的测试序列生成方法,同时对基于扩展有限状态机以及确定有限状态机的测试序列生成方法也进行了介绍。文章对每一种方法介绍了其原理并分析了其使用中的局限。文章最后指出了在协议测试中面临的问题和进一步研究的方向。     

基于整车虚拟道路行驶试验的车辆零部件疲劳分析

针对现有车辆零部件精确疲劳分析依赖成本高昂的实车试验的问题,提出了一种利用整车虚拟样机仿真分析零部件疲劳寿命的方法。该方法通过在ADAMS/CAR中用整车虚拟样机在虚拟道路模型上进行行驶试验,利用多体系统动力学基于模态坐标的求解特点,使用模态应力恢复技术准确还原出了用于零部件疲劳寿命分析的载荷历程。将该方法应用于某车辆双横臂前悬中的下控制臂,在较短的时间内获得了该零件的预测疲劳寿命、寿命安全系数及危险部位等信息。应用结果表明,该方法可作为汽车设计过程与测试过程中的有效试验手段。     

基于树分解/合并策略的QoS多播路由方法

针对多约束QoS多播路由的NP-Complete特性,提出一种可控的多播树分解与合并策略,使多播树的生成在兼顾低费用的同时具有多样性,有效克服多播路由优化的局部极值问题。基于该策略设计蚁群算法,分解蚂蚁种群为与多播目标点相对应的蚂蚁子群,引入基于“死点”惩罚和多播树奖惩的信息素更新机制,提高了算法的收敛速度。仿真实验表明,该方法能有效地解决QoS多播路由问题,且随着网络规模的增大保持了良好的性能。