To catch an intruder: Part A—uncluttered scenario

We analyze an interdiction scenario where an interceptor attempts to catch an intruder as the intruder moves through the area of interest. A motivating example is the detection and interdiction of drug smuggling vessels in the Eastern Pacific and Caribbean. We study two models in this article. The first considers a nonstrategic target that moves through the area without taking evasive action to avoid the interdictor. We determine the optimal location the interceptor should position itself to best respond when a target arrives. The second model analyzes the strategic interaction between the interceptor and intruder using a Blotto approach. The intruder chooses a route to travel on and the interceptor chooses a route to patrol. We model the interaction as a two‐player game with a bilinear payoff function. We compute the optimal strategy for both players and examine several extensions. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 29–40, 2017     

Cyclic best first search: Using contours to guide branch‐and‐bound algorithms

The cyclic best‐first search (CBFS) strategy is a recent search strategy that has been successfully applied to branch‐and‐bound algorithms in a number of different settings. CBFS is a modification of best‐first search (BFS) that places search tree subproblems into contours which are collections of subproblems grouped in some way, and repeatedly cycles through all non‐empty contours, selecting one subproblem to explore from each. In this article, the theoretical properties of CBFS are analyzed for the first time. CBFS is proved to be a generalization of all other search strategies by using a contour definition that explores the same sequence of subproblems as any other search strategy. Further, a bound is proved between the number of subproblems explored by BFS and the number of children generated by CBFS, given a fixed branching strategy and set of pruning rules. Finally, a discussion of heuristic contour‐labeling functions is provided, and proof‐of‐concept computational results for mixed‐integer programming problems from the MIPLIB 2010 database are shown. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 64–82, 2017     

战时装备维修器材分配方法研究

根据参战部队任务及其性质,装备的损坏率及其分布,总部、部队库存现有装备维修器材等条件,结合战时装备维修器材的储备模式,给出了战时装备维修器材的分配程序、模型和评估方法。针对分配中总部资源不足的重点和难点,引入带权重保障程度作为逐个分配的依据,应用示例说明了分配程序的适用性及灵敏性。     

反潜直升机吊声搜潜效能的建模仿真

从直升机使用吊放声纳(简称吊声)的搜潜过程入手,通过仿真环境假设,吊声搜潜效能描述,建立了吊声搜潜效能的蒙特卡洛法模型。介绍了常用搜索方法,并建立了其搜索要素表。根据模型编制了仿真程序,实现了不同搜索方法的仿真计算,为研究不同战术条件下如何合理选择有效的搜索方法奠定了基础。     

舰载直升机反潜搜索最佳方案优选模型及应用

目前,舰载直升机已成为现代水面舰艇搜潜反潜的重要力量,为了提高作战效率,对舰载直升机在反潜搜索中的战斗使用进行了研究,建立了搜索力的最优配置模型,解决了在已知目标分布的条件下舰载直升机反潜搜索中选择初始探测点、确定搜索路径、确定搜索次数以及搜索效率评估等问题,并在几种常见的目标分布下对最佳搜索方案作了实例演示,为舰载直升机的反潜战斗使用提供了依据。     

装备主动式保障系统需求建模及应用

针对装备主动式保障系统建设中存在的需求把握不准、难以全面的问题,引入对象建模技术,建立装备主动式保障系统的对象模型、动态模型和功能模型,从保障系统组元间相互关系、组元间动态时序关系及功能实现3个角度描述了保障系统需求情况。基于需求建模结果,给出了装备主动式保障系统各功能子系统的信息流程,为后续装备主动式保障系统实现奠定了基础。     

基于遗传算法的吊放声纳搜潜策略优化

针对吊放声纳搜潜策略问题,在平均分配每点的搜索时间的典型搜潜策略的基础上,采用遗传算法优化搜潜策略中的吊点选择,进而给出合理的吊放声纳搜潜路径。算法中,利用实数编码优化初始种群,采用轮盘赌和期望值相结合的混合选择策略优化种群的进化。仿真运算表明:采用遗传算法优化吊放声纳搜潜路径是一种具有研究价值的方法,但算法复杂,计算量大,工程实现还需要进一步研究简化。     

消防执法程序与法律修改探讨

《中华人民共和国消防法》于2008年修订后引发消防执法程序的变化,取消了大部分消防行政处罚前责令限期改正的前置条件,加大了行政处罚力度,但由此引发了行政不作为的现象;由于法律对同一行为规定了两种处理方式,导致出现选择性执法现象;由于法律对虚假备案违法行为行政处罚规定模糊,使该行为不能得到有效处理。针对上述问题及其对消防工作带来的深刻影响,尝试对消防执法工作提出建议。     

论侦查讯问中的人权保障

侦查讯问是侦查程序的重要环节,由于制度的缺陷和立法的不完善,侦查讯问过程中侵犯犯罪嫌疑人人身权利和诉讼权利的现象屡禁不止。借鉴外国侦查程序理论中的合理内核,健全我国刑事法律制度,完善侦查讯问规则立法,是实现权力制约和权利保障的关键。     

Double window acceptance sampling

We introduce the concept of a sequential double window procedure and compare the resulting acceptance test with both a fixed sample size method as well as with the Wald sequential probability ratio test. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004