动态规划在消防增援调度中的应用

由于各消防中队一般规模较小,对于较大规模的火灾需要多个消防队共同救护,此时若能够实现增援调度的最优化可以提高这些同时出现的火灾被全部扑灭的概率。利用多阶段动态规划对增援调度进行了研究,并分析了具体案例。通过分析得出此方法有助于改善消防资源分配状况,以实现最大程度地减小经济损失。     

改进平衡计分卡在装备物资供应管理中的应用

基于装备物资供应的特点,对传统平衡记分卡进行了改进,建立了装备物资供应平衡记分卡,分为部队用户、业务流程、保障服务、训练与创新4部分。基于建立的装备物资供应平衡记分卡及其因果关系分析,可以有效的评价装备物资供应系统的整体运行情况,为装备物资供应系统优化提供依据。     

Dynamic routing of prioritized warranty repairs

Recent years have seen a strong trend toward outsourcing warranty repair services to outside vendors. In this article we consider the problem of dynamically routing warranty repairs to service vendors when warranties have priority levels. Each time an item under warranty fails, it is sent to one of the vendors for repair. Items covered by higher priority warranty receive higher priority in repair service. The manufacturer pays a fixed fee per repair and incurs a linear holding cost while an item is undergoing or waiting for repair. The objective is to minimize the manufacturer's long‐run average cost. Because of the complexity of the problem, it is very unlikely that there exist tractable ways to find the optimal routing strategies. Therefore, we propose five heuristic routing procedures that are applicable to real‐life problems. We evaluate the heuristics using simulation. The simulation results show that the index‐based “generalized join the shortest queue” policy, which applies a single policy improvement step to an initial state‐independent policy, performs the best among all five heuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

舰船电力系统运行负荷估算方法研究

针对舰船电力系统的运行负荷估算常见算法的不足,提出了改进算法.改进算法用随机模型和回归模型描述舰船电力负荷,用回归模型描述的负荷采用回归算法,用随机模型描述的负荷采用逐步聚类法进行计算,并对获得随机负荷的计算参数提出了具体方法.通过对某船的计算和实测,进行了各算法的比较,验证了改进算法的可信性.     

军体课程密度与运动负荷初探

对军事体育课中运动负荷与课的密度进行研究,阐述了军事体育课合理运用课的密度与运动负荷的重要性,为进一步深化军事体育训练提供借鉴。     

Two-agent scheduling with linear resource-dependent processing times

This paper considers a two-agent scheduling problem with linear resource-dependent processing times, in which each agent has a set of jobs that compete with that of the other agent for the use of a common processing machine, and each agent aims to minimize the weighted number of its tardy jobs. To meet the due date requirements of the jobs of the two agents, additional amounts of a common resource, which may be in discrete or continuous quantities, can be allocated to the processing of the jobs to compress their processing durations. The actual processing time of a job is a linear function of the amount of the resource allocated to it. The objective is to determine the optimal job sequence and resource allocation strategy so as to minimize the weighted number of tardy jobs of one agent, while keeping the weighted number of tardy jobs of the other agent, and the total resource consumption cost within their respective predetermined limits. It is shown that the problem is -hard in the ordinary sense, and there does not exist a polynomial-time approximation algorithm with performance ratio unless ; however it admits a relaxed fully polynomial time approximation scheme. A proximal bundle algorithm based on Lagrangian relaxation is also presented to solve the problem approximately. To speed up convergence and produce sharp bounds, enhancement strategies including the design of a Tabu search algorithm and integration of a Lagrangian recovery heuristic into the algorithm are devised. Extensive numerical studies are conducted to assess the effectiveness and efficiency of the proposed algorithms.     

测试性增长中资源优化配置模型及求解

良好的测试性设计对系统维修性具有重要意义,测试性增长试验通过一系列测试性设计缺陷发现和纠正措施,可保证系统测试性指标达到设计要求。针对基于延缓纠正的测试性增长过程中的资源配置问题进行研究,基于增长试验目标是否明确和试验资源是否受限制问题构建资源优化配置模型,并提出一种基于拉格朗日松弛和本地搜索的快速优化算法。仿真结果表明:该模型能够有效指导测试性增长中的资源优化配置问题,所提混合优化方法能够高效、准确地求解整数规划问题。     

A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times

We investigate a single‐machine scheduling problem for which both the job processing times and due windows are decision variables to be determined by the decision maker. The job processing times are controllable as a linear or convex function of the amount of a common continuously divisible resource allocated to the jobs, where the resource allocated to the jobs can be used in discrete or continuous quantities. We use the common flow allowances due window assignment method to assign due windows to the jobs. We consider two performance criteria: (i) the total weighted number of early and tardy jobs plus the weighted due window assignment cost, and (ii) the resource consumption cost. For each resource consumption function, the objective is to minimize the first criterion, while keeping the value of the second criterion no greater than a given limit. We analyze the computational complexity, devise pseudo‐polynomial dynamic programming solution algorithms, and provide fully polynomial‐time approximation schemes and an enhanced volume algorithm to find high‐quality solutions quickly for the considered problems. We conduct extensive numerical studies to assess the performance of the algorithms. The computational results show that the proposed algorithms are very efficient in finding optimal or near‐optimal solutions. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 41–63, 2017     

子弹均匀散布子母弹最有利火力分配方法

在将子弹均匀散布的椭圆区域等效转换为矩形区域的基础上,建立了适宽射向射击子母弹对矩形目标毁伤全概率计算的数学模型。通过函数转换和泛函分析给出了子弹均匀散布子母弹理想射击密度,得到了理想射击密度下对目标的毁伤概率计算公式。讨论了最有利火力分配方式的确定方法,给出了最优射向间隔和表尺差的计算公式,为便于实际应用,给出了最优火力分配计算中所需的3个参数的近似计算公式,最后给出了应用算例。     

大学自习教室优化设置研究

针对目前大学自习教室资源浪费普遍存在的现象,将学生上自习与否视为独立同分布随机变量,从自习教室的管理与维护成本、电费成本以及学生的满意度3个方面出发,建立了双目标随机规划模型,并在模型基础上提出了大学自习教室设置的一般方法。通过实例分析,对模型的正确性和有效性进行了论证。结果表明:在各种情况下,该模型都能很好地解决自习教室设置这一问题,并且能在学生满意度较高的条件下,节约能源13%以上。该模型可以有效地对自习教室进行优化设置,不仅提高了资源利用水平,而且节约了能源。