装备保障抽组力量物资装载模型

对装备保障抽组力量的物资装载问题进行了数学描述,建立了以实现全部物资尽量分散装载为目标,以同类物资集中装载、车辆承载物资总体积不超过车辆有效容积、车辆承载物资总重量不超过车辆标记载重量、物资必须装载且不被重复装载等为主要约束的数学模型,并进行了求解.最后通过实例解算验证了模型的有效性.     

基于单元体设计的装甲装备弹目交会建模方法

为了提高作战仿真效果的可信度,提出了一种基于单元体的解决思路,并通过弹头终点弹道特性、装备几何特征、弹头与目标的关系分析,建立了陆军作战仿真的弹目交会模型。试验测试结果表明:该模型能够仿真作战过程中的弹头命中点坐标,满足作战仿真系统的准确性、实时性要求。     

地球模型偏差对远程弹箭弹道仿真的影响及修正

针对地球模型精确度影响远程弹箭弹道仿真的问题,分析了地球模型偏差对弹道仿真精度的影响并加以修正。采用总的地球椭球系,在已有弹道模型的基础上,分析了垂线偏差的产生机理及其对定向定位参数的影响,并由此得出弹道几何偏移随定向偏差的变化规律,研究了引力加速度初值偏差对弹道的误差累积,并对由水准面不平行性造成的实际落点高差进行了理论推导。对比仿真算例表明,考虑地球模型偏差影响的仿真结果与不考虑的情况下差别较明显,在远程条件下对弹道仿真精度的影响不容忽视。     

飞航导弹故障飞行落点概率计算方法

针对飞航导弹故障飞行落点概率难以准确计算的问题,通过分析导弹的各个分系统的故障机理重新提出五种故障模式,依据逐系统串联的原理建立了故障模式的概率分配计算模型;在对发射、飞行和故障后坠落等阶段进行分析的基础上建立各故障模式的仿真模型;最后应用蒙特卡洛方法对某型导弹故障飞行落点的概率分布进行了仿真计算。     

A decomposition heuristic for the twin robots scheduling problem

This article provides an efficient heuristic based on decomposition for the twin robots scheduling problem (TRSP). TRSP concerns two moving robots executing storage and retrieval requests in parallel along a shared pathway. The depots are located at both ends of the line and a dedicated robot is assigned to each of them. While moving goods between their respective depots and some storage locations on the line, noncrossing constraints among robots need to be considered. Our heuristic uses a dynamic programming framework to determine the schedule of one robot while keeping the other one's fixed. It finds near‐optimal solutions even for large problem instances with hundreds of jobs in a short time span. © 2014 Wiley Periodicals, Inc. 62:16–22, 2015     

Modeling and solution for the ship stowage planning problem of coils in the steel industry

We consider a ship stowage planning problem where steel coils with known destination ports are to be loaded onto a ship. The coils are to be stowed on the ship in rows. Due to their heavy weight and cylindrical shape, coils can be stowed in at most two levels. Different from stowage problems in previous studies, in this problem there are no fixed positions on the ship for the coils due to their different sizes. At a destination port, if a coil to be unloaded is not at a top position, those blocking it need to be shuffled. In addition, the stability of ship has to be maintained after unloading at each destination port. The objective for the stowage planning problem is to minimize a combination of ship instability throughout the entire voyage, the shuffles needed for unloading at the destination ports, and the dispersion of coils to be unloaded at the same destination port. We formulate the problem as a novel mixed integer linear programming model. Several valid inequalities are derived to help reducing solution time. A tabu search (TS) algorithm is developed for the problem with the initial solution generated using a construction heuristic. To evaluate the proposed TS algorithm, numerical experiments are carried out on problem instances of three different scales by comparing it with a model‐based decomposition heuristic, the classic TS algorithm, the particle swarm optimization algorithm, and the manual method used in practice. The results show that for small problems, the proposed algorithm can generate optimal solutions. For medium and large practical problems, the proposed algorithm outperforms other methods. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 564–581, 2015     

基于配置管理的软件维护性评估

对软件质量进行定量化管理是软件工程领域的趋势,也是软件质量保证的重要手段。针对软件维护性定量评估难、数据获取难的问题,分析了软件维护性受配置管理关键要素的影响,提出利用配置管理数据对软件维护性间接评估的方法。结合软件工程开发实际,建立了配置管理数据收集过程,利用维护时间作为参数,统计5类功能点维护时间对软件维护性进行度量,实现了软件维护性的定量评估,并利用实际项目对方法的可行性和有效性进行了验证。     

Column generation for stochastic green telecommunication network planning with switchable base stations

We present the green telecommunication network planning problem with switchable base stations, where the location and configuration of the base stations are optimized, while taking into account uncertainty and variability of demand. The problem is formulated as a two‐stage stochastic program under demand uncertainty with integers in both stages. Since solving the presented problem is computationally challenging, we develop the corresponding Dantzig‐Wolfe reformulation and propose a solution approach based on column generation. Comprehensive computational results are provided for instances of varying characteristics. The results show that the joint location and dynamic switching of base stations leads to significant savings in terms of energy cost. Up to 30% reduction in power consumption cost is achieved while still serving all users. In certain cases, allowing dynamic configurations leads to more installed base stations and higher user coverage, while having lower total energy consumption. The Dantzig‐Wolfe reformulation provides solutions with a tight LP‐gap eliminating the need for a full branch‐and‐price scheme. Furthermore, the proposed column generation solution approach is computationally efficient and outperforms CPLEX on the majority of the tested instances. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 351–366, 2016     

Scheduling deteriorating jobs to minimize makespan

We consider a single-machine problem of scheduling n independent jobs to minimize makespan, in which the processing time of job J_j grows by w_j with each time unit its start is delayed beyond a given common critical date d. This processing time is p_j if J_j starts by d. We show that this problem is NP-hard, give a pseudopolynomial algorithm that runs in time and O(nd) space, and develop a branch-and-bound algorithm that solves instances with up to 100 jobs in a reasonable amount of time. We also introduce the case of bounded deterioration, where the processing time of a job grows no further if the job starts after a common maximum deterioration date D > d. For this case, we give two pseudopolynomial time algorithms: one runs in O(n²d(D − d) time and O(nd(D − d)) space, the other runs in p_j)²) time and p_j) space. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 511–523, 1998     

Coordinated replenishments from multiple suppliers with price discounts

In this study we present an integer programming model for determining an optimal inbound consolidation strategy for a purchasing manager who receives items from several suppliers. The model considers multiple suppliers with limited capacity, transportation economies, and quantity discounts. We propose an integrated branch and bound procedure for solving the model. This procedure, applied to a Lagrangean dual at every node of the search tree, combines the subgradient method with a primal heuristic that interact to change the Lagrangean multipliers and tighten the upper and lower bounds. An enhancement to the branch and bound procedure is developed using surrogate constraints, which is found to be beneficial for solving large problems. We report computational results for a variety of problems, with as many as 70,200 variables and 3665 constraints. Computational testing indicates that our procedure is significantly faster than the general purpose integer programming code OSL. A regression analysis is performed to determine the most significant parameters of our model. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 579–598, 1998