基于Pareto排序法的战时装备维修任务多目标调度方法

针对战时武器装备维修保障问题,建立了包括最大完工时间、延迟时间和维修单元负荷在内的多目标优化调度模型。为提高解的多样性和收敛性,构建了一种基于Pareto排序法和小生境技术相结合的遗传算法用于模型求解,引入Pareto排序和拥挤距离进行适应度计算,通过混沌系统随机生成权重系数,并使用小生境技术改进选择方式。通过实例验证表明,该方法能够有效地解决装备维修多目标调度问题。     

基于时间窗的宽带阵列多目标干扰资源调度

随着宽带数字阵列技术和有源干扰技术的不断发展和成熟,舰载有源干扰设备的未来发展方向将是宽带数字阵列有源干扰系统。针对多目标干扰问题,提出了目标干扰时间窗概念和两种时间窗的处理方法,并建立干扰资源调度模型,通过仿真计算和对比分析,得出基于模糊时间窗的资源调度模型性能优于基于硬时间窗的资源调度模型,能够对干扰资源进行合理的调度,提高宽带阵列多目标干扰能力。     

一种用于区分服务路由器的crossbar调度算法

宽带路由器一般采用crossbar交换开关。Crossbar交换开关对QoS (QualityofService)的支持十分重要。提出一种支持IETF区分服务 (DifferentiatedService)服务模型的crossbar调度算法———OSP (OutputSerialPolling) ,该算法带宽利用率高 ,支持报文优先级。与目前存在的同类算法相比 ,具有硬件实现简单的优点     

基于信息损失最小的预警卫星传感器调度模型

科学合理地调度预警卫星传感器资源是提高弹道导弹预警作战效能的重要手段.在预警卫星传感器资源(主要是凝视探测器)有限而进攻弹道导弹目标数量较多时,利用最小信息损失准则,将传感器调度问题转化为最优访问路径问题进行建模研究,满足了导弹预警资源调度的需要,仿真结果验证了模型的可靠性和可用性.     

导航卫星上行注入任务调度模型及启发式算法

合理安排导航卫星与地面上注站星地链路构建与导航电文上注,对保证星上导航电文的准确性和精确性有着重要意义。对卫星导航系统上行注入过程进行了分析,构建了上行注入任务调度问题的多目标混合整数规划模型,设计了基于规则的启发式求解算法。基于北斗二代和美国的GPS卫星导航系统构建仿真场景,仿真结果验证了模型和算法的正确性、可行性;通过分析仿真结果,得到影响卫星导航系统上行注入任务完成的关键因素。     

舰艇防空火力规划与调度方法研究

根据舰艇防空武器拦截过程的时间连续性和拦截效果的不确定性特点,提出了智能规划和优化调度相结合的舰艇防空计划生成方法。在规划阶段,先用智能规划描述语言PDDL对舰艇防空问题进行建模;针对新的来袭目标或观察的拦截结果,利用智能规划的高效行动推理能力,快速生成可能的备选行动方案;在优化调度阶段,对已生成的备选方案的行动系列进行时间、资源冲突处理,并计算选择出当前最佳拦截方案。与现有的采用离散化处理的武器-目标分配方法相比,该规划与调度过程充分体现了拦截过程的连续性,拦截效果的不确定性,拦截过程中的武器协同,以及最佳拦截时机的选择等,更好地描述了舰艇防空的实际过程。最后,通过蒙特卡罗仿真试验,验证了算法的有效性,为舰艇的自动化防空提供了一种新的解决办法。     

一种装甲车辆CAN总线混合调度算法

针对当前装甲车辆综合电子系统节点消息传输不公平、紧急消息传输不及时等缺点,结合某型车辆消息紧急度和截止期,按照分层处理原则对总线协议进行了改进,提出了"分级决策动态均衡"的混合调度算法,并通过试验验证了算法的可行性和有效性。     

Maintenance scheduling for modular systems: Modeling and algorithms

We study new models of scheduled maintenance management for modular systems, consisting of multiple components with respective cycle limits. The cycle limit of each component specifies the time interval in which this component must be repaired or replaced. The goal is to compute a feasible maintenance schedule that minimizes the cost associated with component maintenance. Applications of these models arise in Air Force aircraft maintenance as well as in other arenas with required preventive maintenance. The typical cost structures that arise in practical settings are submodular, which make the resulting models computationally challenging. We develop two efficient and operationally tenable approximation algorithms. We prove constant factor worst‐case guarantees for both algorithms, and present computational experiments showing that these algorithms perform within a few percent of optimality on operationally relevant instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 472–488, 2014     

Scheduling twin robots on a line

This article introduces the twin robots scheduling problem (TRSP), in which two robots positioned at the opposite ends of a rail are required to deliver items to positions along the rail, and the objective is to minimize the makespan. A proof of ‐hardness of the TRSP is presented, along with exact and heuristic algorithms. Computational results on challenging instances are provided.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 119–130, 2014     

The quay crane scheduling problem with time windows

The quay crane scheduling problem consists of scheduling tasks for loading and unloading containers on cranes that are assigned to a vessel for its service. This article introduces a new approach for quay crane scheduling, where the availability of cranes at a vessel is restricted to certain time windows. The problem is of practical relevance, because container terminal operators frequently redeploy cranes among vessels to speed up the service of high‐priority vessels while serving low‐priority vessels casually. This article provides a mathematical formulation of the problem and a tree‐search‐based heuristic solution method. A computational investigation on a large set of test instances is used to evaluate the performance of the heuristic and to identify the impact of differently structured crane time windows on the achievable vessel handling time. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011