Optimizing ship berthing

Ship berthing plans reserve a location for inbound U.S. Navy surface vessels prior to their port entrance, or reassign ships once in port to allow them to complete, in a timely manner, reprovisioning, repair, maintenance, training, and certification tests prior to redeploying for future operational commitments. Each ship requires different services when in port, such as shore power, crane, ordnance, and fuel. Unfortunately, not all services are offered at all piers, and berth shifting is disruptive and expensive: A port operations scheduler strives to reduce unnecessary berth shifts. We present an optimization model for berth planning and demonstrate it for Norfolk Naval Station, which exhibits all the richness of berthing problems the Navy faces. ® 1994 John Wiley & Sons, Inc.     

面向服务的潜艇指控系统集成方法研究

为应对潜艇指控系统面临的使用需求,深入分析了潜艇指控系统特点及信息流程,构建了“以服务为核心”的多层次体系结构模型,提出了平台系统层、基础构件层、服务层、业务服务层和表示层的5层框架结构;并研究了支持该框架的工程实现方法及技术解决方案。该框架解决了当前潜艇指控系统集成困难,使潜艇指控系统具有更好的可扩展性和互操作性,便于用户根据不同的任务需求建立相应服务模式,具有重要的现实意义。     

潜艇线式巡逻的最佳对策研究

本文先用面积法求出线式巡逻潜艇发现目标的概率,然后对潜艇发现目标距离作了分析。在此基础上,建立了潜艇线式巡逻的矩阵对策模型,并用计算机对此模型进行求解,得到了潜艇线式巡逻的最佳对策。最后,对最佳对策作了讨论。本文建立的矩阵对策模型和求得的结果以及求解方法可为组织潜艇进行线式巡逻提供决策的科学依据。     

舰艇CGF搜潜过程马氏决策规划模型

舰艇搜索潜艇的过程可以近似地看作一种马尔可夫过程.研究了潜艇训练仿真系统中舰艇CGF(计算机生成兵力)搜索潜艇过程中的状态转移过程和随机搜索发现目标的概率模型,将舰艇CGF搜索潜艇的过程分为若干独立的阶段,建立了搜潜过程马氏决策规划模型,提出了在各种不同初始搜索状态下的舰艇搜索策略.仿真结果给出了舰艇CGF的最优搜索策略集合和发现概率,验证了马氏决策规划模型的有效性.     

影响潜艇战斗群作战性能技术因素分析

利用所研制的“潜艇战斗群抗击航母编队仿真模型”,定量地分析了影响潜艇群作战性能的技术因素,为今后潜艇的发展提供了一些依据．     

潜射反舰导弹作战效能的模糊综合评判

潜射反舰导弹是现代潜艇作战的重要武器,对其作战效能的评价长期以来一直采用单一指标,无法全面准确的进行评价.通过对影响潜射反舰导弹作战效能各因素的分析,建立了作战效能综合评价的指标体系.应用模糊综合评判的方法,在借鉴WSEIAC模型的基础上建立了数学模型,并给出算例与仿真.研究结果表明此方法可较好地评估潜射反舰导弹的作战效能,并为其研发及使用提供决策依据.     

Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures

In this paper, we study the problem of scheduling quay cranes (QCs) at container terminals where incoming vessels have different ready times. The objective is to minimize the maximum relative tardiness of vessel departures. The problem can be formulated as a mixed integer linear programming (MILP) model of large size that is difficult to solve directly. We propose a heuristic decomposition approach to breakdown the problem into two smaller, linked models, the vessel‐level and the berth‐level models. With the same berth‐level model, two heuristic methods are developed using different vessel‐level models. Computational experiments show that the proposed approach is effective and efficient. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

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     

潜艇CGF规避反潜航空兵行为建模

对战场态势的不完全观测是潜艇作战的重要特点,充分利用不完全观测信息,提高潜艇对抗决策的合理性是设计潜艇CGF的核心问题。针对潜艇作战特点,提出了潜艇自防御行为模型框架,并利用多Agent不确定场景建模技术,建立了基于POMDP的规避反潜航空兵行为模型,最后进行了仿真验证。结果表明,该模型具有较强的可行性。     

红外热像水面寻迹探测的理论分析

针对目前探潜方面存在的问题 ,给出了密度分层环境下潜艇排出热尾流的浮升规律模型 ,预估了水面热轨迹的大体形状 ,并对热成像探潜系统的关键技术指标进行了理论分析 .     

“These aren’t the SLOC’s you’re looking for”: mirror-imaging battles of the Atlantic won’t solve current Atlantic security needs

ABSTRACT

Discussion surrounding the announcement of a new NATO Maritime Command for the North Atlantic seems to have settled on the assumption that there is again a vital “sea-line of communication” (SLOC) between North America and Europe as there was supposed to be during the Cold War. The Soviet Union had a large fleet of nuclear and conventional submarines and it seemed very clear that Soviet admirals intended to fight a third “Battle of the Atlantic” in the event of war to prevent Western resupply of NATO. However, this scenario bore no resemblance to what the Soviet Navy actually intended to do in case of war. Changes in technology, notably in submarine propulsion, antisubmarine warfare (ASW), and ballistic missile range and accuracy were the real drivers of the Cold War in the Atlantic. Cruise missile-armed submarines that can attack shore-based economic infrastructure are the real threat from the Russian submarine force.     

侦察机通过数据链向潜艇传递目标指示的方法探讨

为了使侦察机能更及时、准确、可靠地为潜艇提供目标指示,使之进行导弹超视距攻击,介绍了与潜艇通信有关的地-舰(潜)/空数据链、舰(潜)-舰(潜)数据链及舰(潜)-空数据链。然后探讨了侦察机通过数据链向潜艇传递目标指示的方法,重点研究了潜艇可以实时接收数据链信息和不能实时接收数据链信息的情况下的直接指示法,及侦察机通过岸上指挥所、海上联合编队指挥所中转信息的中转指示法。     

A risk function for the stochastic modeling of electric capacity expansion

We present a stochastic optimization model for planning capacity expansion under capacity deterioration and demand uncertainty. The paper focuses on the electric sector, although the methodology can be used in other applications. The goals of the model are deciding which energy types must be installed, and when. Another goal is providing an initial generation plan for short periods of the planning horizon that might be adequately modified in real time assuming penalties in the operation cost. Uncertainty is modeled under the assumption that the demand is a random vector. The cost of the risk associated with decisions that may need some tuning in the future is included in the objective function. The proposed scheme to solve the nonlinear stochastic optimization model is Generalized Benders' decomposition. We also exploit the Benders' subproblem structure to solve it efficiently. Computational results for moderate‐size problems are presented along with comparison to a general‐purpose nonlinear optimization package. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:662–683, 2001     

Demand shuffle—A method for multilevel proportional lot sizing and scheduling

This contribution acquaints the reader with a model for multilevel single-machine proportional lot sizing and scheduling problems (PLSPs) that appear in the scope of short-term production planning. It is one of the first articles that deals with dynamic capacitated multilevel lot sizing and scheduling, which is of great practical importance. The PLSP model refines well-known mixed-integer programming formulations for dynamic capacitated lot sizing and scheduling as, for instance, the DLSP or the CSLP. A special emphasis is given on a new method called demand shuffle to solve multilevel PLSP instances efficiently but suboptimally. Although the basic idea is very simple, it becomes clear that in the presence of precedence and capacity constraints many nontrivial details are to be concerned. Computational studies show that the presented approach decidedly improves recent results. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 319–340, 1997     

Crane scheduling with spatial constraints

In this work, we examine port crane scheduling with spatial and separation constraints. Although common to most port operations, these constraints have not been previously studied. We assume that cranes cannot cross, there is a minimum distance between cranes and jobs cannot be done simultaneously. The objective is to find a crane‐to‐job matching which maximizes throughput under these constraints. We provide dynamic programming algorithms, a probabilistic tabu search, and a squeaky wheel optimization heuristic for solution. Experiments show the heuristics perform well compared with optimal solutions obtained by CPLEX for small scale instances where a squeaky wheel optimization with local search approach gives good results within short times. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

常规潜艇改装潜水油船初探

从我国第一代常规潜艇现状出发,通过对改装的必要性、可行性论证及常规潜艇改装潜水油船技术潜力的分析,提出了常规潜艇改装潜水油船的建议和实施办法,并提出了潜水油船主要使命任务的设想．     

潜艇作战指数计算研究

潜艇的作战指数是反映其综合作战能力的效能指标,由于传统的作战指数计算方法在实际应用中操作难度较大且横向可比性不高,提出了一种由已知的潜艇作战指数推算待求的潜艇作战指数的较为简便的新方法,即采用层次分析法确立潜艇作战能力的因素集和权重集,运用拓展的灰色关联法求得所选潜艇的灰色关联度,利用已知的作战指数和所求的关联度通过数值分析建立两者的函数关系,并由此推算出待求的作战指数.以攻击型潜艇对水面舰艇作战指数为例,求取潜艇作战指数.     

基于俄罗斯潜艇设计理念的作战系统顶层优化设计

针对现代潜艇作战对象和作战样式的变化对新型潜艇作战系统提出新的需求,以作战使用需求为牵引,在分析潜艇作战任务特点及作战系统使用需求的基础上,借鉴俄罗斯潜艇作战系统设计理念,为方便指挥员灵活地使用潜艇武器系统,提出了潜艇作战系统的顶层优化设计思想,构建了潜艇作战系统构架,并对其技术实现进行了分析和说明。     

潜艇承载力分析和动力抗沉操纵方法研究

在分析潜艇受力的基础上,根据潜艇的操纵规则,给出承载力的计算方法,分析了影响潜艇承载力的因素,设计了一套用于指导潜艇动力抗沉操纵的承载力图谱.以某一假想潜艇为例,说明了承载力图谱的绘制和使用方法.     

Strong turnpike policies in the single-item capacitated lot-sizing problem with periodical dynamic parameter

This article considers optimization problems in a discrete capacitated lot sizing model for a single product with limited backlogging. The demand as well as the holding and backlogging costs are assumed to be periodical in time. Nothing is assumed about types of the cost functions. It is shown that there exists an optimal infinite inverse policy and a strong turnpike policy. A forward algorithm for computing optimal policies relative to the class of batch ordering type policies is derived. Some backward procedure is adopted to determine a strong turnpike policy. The algorithm is simple, and it terminates after the a number of steps equal to the turnpike horizon. Some remarks on the existence of rolling horizontal plans and forecast horizons are also given. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 775–790, 1997