如何改善路径测试用例生成的搜索算法

软件结构测试数据生成一直是软件测试领域一个较为复杂的问题,方法和手段尚未成熟。基于程序直接执行的测试数据生成方法因其动态性,显示出一定的优越性,本文主要针对该方法的核心部分——搜索算法进行讨论,探讨了有助于改善其功能的若干手段,目的在于提高算法效率,提高其实用化程度,显示出较好的实验效果。     

Algorithms for the multi‐item multi‐vehicles dynamic lot sizing problem

We consider a two‐stage supply chain, in which multi‐items are shipped from a manufacturing facility or a central warehouse to a downstream retailer that faces deterministic external demand for each of the items over a finite planning horizon. The items are shipped through identical capacitated vehicles, each incurring a fixed cost per trip. In addition, there exist item‐dependent variable shipping costs and inventory holding costs at the retailer for items stored at the end of the period; these costs are constant over time. The sum of all costs must be minimized while satisfying the external demand without backlogging. In this paper we develop a search algorithm to solve the problem optimally. Our search algorithm, although exponential in the worst case, is very efficient empirically due to new properties of the optimal solution that we found, which allow us to restrict the number of solutions examined. Second, we perform a computational study that compares the empirical running time of our search methods to other available exact solution methods to the problem. Finally, we characterize the conditions under which each of the solution methods is likely to be faster than the others and suggest efficient heuristic solutions that we recommend using when the problem is large in all dimensions. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006.     

Priority and dynamic scheduling in a make‐to‐stock queue with hyperexponential demand

We consider the scheduling problem in a make‐to‐stock queue with two demand classes that can be differentiated based on their variability. One class experiences Poisson arrivals and the other class experiences hyperexponential renewal arrivals. We provide an exact analysis of the case where the demand class with higher variability is given non‐preemptive priority. The results are then used to compare the inventory cost performance of three scheduling disciplines, first‐come first‐serve and priority to either class. We then build on an existing dynamic scheduling heuristic to propose a modification that works well for our system. Extensions of the heuristic to more than two classes and to the case where demand state is known are also discussed. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006.     

The stochastic joint replenishment problem: A new policy,analysis, and insights

In this study, we propose a new parsimonious policy for the stochastic joint replenishment problem in a single‐location, N‐item setting. The replenishment decisions are based on both group reorder point‐group order quantity and the time since the last decision epoch. We derive the expressions for the key operating characteristics of the inventory system for both unit and compound Poisson demands. In a comprehensive numerical study, we compare the performance of the proposed policy with that of existing ones over a standard test bed. Our numerical results indicate that the proposed policy dominates the existing ones in 100 of 139 instances with comparably significant savings for unit demands. With batch demands, the savings increase as the stochasticity of demand size gets larger. We also observe that it performs well in environments with low demand diversity across items. The inventory system herein also models a two‐echelon setting with a single item, multiple retailers, and cross docking at the upper echelon. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

A branch‐and‐cut algorithm for the quay crane scheduling problem in a container terminal

The quay crane scheduling problem consists of determining a sequence of unloading and loading movements for cranes assigned to a vessel in order to minimize the vessel completion time as well as the crane idle times. Idle times originate from interferences between cranes since these roll on the same rails and a minimum safety distance must be maintained between them. The productivity of container terminals is often measured in terms of the time necessary to load and unload vessels by quay cranes, which are the most important and expensive equipment used in ports. We formulate the quay crane scheduling problem as a vehicle routing problem with side constraints, including precedence relationships between vertices. For small size instances our formulation can be solved by CPLEX. For larger ones we have developed a branch‐and‐cut algorithm incorporating several families of valid inequalities, which exploit the precedence constraints between vertices. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

总线技术在武器装备测试系统中的应用及发展

总线技术在装备测试系统中占重要地位。VXI总线因具有优良性能而成为自动测试系统的优秀平台。介绍了总线技术的发展概况,分析了装备测试的重要性,着重论述了VXI技术的应用,用事实说明VXI总线技术必将随着装备自动化测试系统的发展而发展。     

舰载导弹火控系统精度试验仿真方法

通过对目前靶场舰载导弹火控系统精度试验中存在的问题及不足进行分析,提出运用仿真技术结合靶场精度试验进行火控系统精度和性能评定方法,根据精度试验的内容和目的建立了一系列相关仿真模型,并结合外场试验结果加以对比和验证,以提高试验鉴定的可信度。     

基于馈电信息的故障诊断技术研究

综合运用馈电信息基本理论,提出了一个基于馈电信息的故障诊断技术.该技术通过对馈电信息的比较、分析,从而实现对工作状态的监测和故障的检测;通过检测、分析馈电相关的频谱或相关的模式,实现状态分析和故障定位,完成对电子装备的故障诊断.     

封闭式爆炸容器小药量爆炸振动效应研究

为评估炸药在封闭容器内爆炸产生的振动效应对周围环境的影响,对封闭式爆炸容器小药量TNT炸药爆炸产生的爆炸振动效应进行了爆源邻近实地监测和测试。结果表明:小药量炸药爆炸引起的爆炸振动效应对距爆源100 m以外的普通砖结构民用住宅产生的速度强度远低于其临界峰值速度,不会对其结构产生明显影响。     

分段试验的可行性

运用随机点过程方法,从理论上对可修系统能否进行分段试验进行了研究.论证了对于泊松过程模型分段试验的可行性,并研究了分段试验对参数估计的影响.