兵力展开问题研究

如何将基地的兵力以最短时间展开到多个阵地中,是运输问题中的一种。为解决此问题对著名的兵力展开问题进行了研究。建立了兵力展开问题的数学模型,此模型是一个混合整数规划模型。提出了一种求解方法,该方法可解决类似的混合整数规划问题。最后给出了一个实例。     

Analysis of practical policies for a single link distribution system

In this paper we consider a transportation problem where several products have to be shipped from an origin to a destination by means of vehicles with given capacity. Each product is made available at the origin and consumed at the destination at the same constant rate. The time between consecutive shipments must be greater than a given minimum time. All demand needs to be satisfied on time and backlogging is not allowed. The problem is to decide when to make the shipments and how to load the vehicles with the objective of minimizing the long run average of the transportation and the inventory costs at the origin and at the destination over an infinite horizon. We consider two classes of practical shipping policies, the zero inventory ordering (ZIO) policies and the frequency‐based periodic shipping (FBPS) policies. We show that, in the worst‐case, the Best ZIO policy has a performance ratio of . A better performance guarantee of is shown for the best possible FBPS policy. The performance guarantees are tight. Finally, combining the Best ZIO and the Best FBPS policies, a policy that guarantees a performance is obtained. Computational results show that this policy gives an average percent optimality gap on all the tested instances of <1%. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

基于三阶段过程模型的军交运输体系建模

信息化条件下军交运输体系复杂性问题日益凸显,军交运输体系建设已经进入能力“涌现”的新阶段。本文在分析军交运输体系概念内涵和体系特征的基础上,运用体系层次划分模型和三阶段过程模型,分别从定义阶段、抽象阶段和实施阶段对军交运输体系建模方法进行了研究,搭建了体系建模总体框架,建立了军交运输体系概念抽象模型,并对军交运输体系问题建模仿真方法进行了分析,为全新规划军交运输体系建设提供了新的途径。     

一种新的运输问题对偶算法

本文给出求解运输问题的一种新的方法——运输问题对偶算法(仍是表上作业法)。最后给出的实例说明本文算法在解决某些问题时比[1]中方法简便。     

Evasion policies for a vessel being chased by pirate skiffs

Piracy attack is a serious safety problem for maritime transport worldwide. Whilst various strategic actions can be taken, such as rerouting vessels and strengthening navy patrols, this still cannot completely eliminate the possibility of a piracy attack. It is therefore important for a commercial vessel to be equipped with operational solutions in case of piracy attacks. In particular, the choice of a direction for rapidly fleeing is a critical decision for the vessel. In this article, we formulate such a problem as a nonlinear optimal control problem. We consider various policies, such as maintaining a straight direction or making turns, develop algorithms to optimize the policies, and derive conditions under which these policies are effective and safe. Our work can be used as a real‐time decision making tool that enables a vessel master to evaluate different scenarios and quickly make decisions.     

Production and transport logistics scheduling with two transport mode choices

This paper considers a new class of scheduling problems arising in logistics systems in which two different transportation modes are available at the stage of product delivery. The mode with the shorter transportation time charges a higher cost. Each job ordered by the customer is first processed in the manufacturing facility and then transported to the customer. There is a due date for each job to arrive to the customer. Our approach integrates the machine scheduling problem in the manufacturing stage with the transportation mode selection problem in the delivery stage to achieve the global maximum benefit. In addition to studying the NP‐hard special case in which no tardy job is allowed, we consider in detail the problem when minimizing the sum of the total transportation cost and the total weighted tardiness cost is the objective. We provide a branch and bound algorithm with two different lower bounds. The effectiveness of the two lower bounds is discussed and compared. We also provide a mathematical model that is solvable by CPLEX. Computational results show that our branch and bound algorithm is more efficient than CPLEX. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Modeling and analysis of vessel casualties resulting from tanker traffic through narrow waterways

In this paper, we present a physics-based stochastic model to investigate vessel casualties resulting from tanker traffic through a narrow waterway. A state-space model is developed to represent the waterway and the location of vessels at a given time. We first determine the distribution of surface current at a given location of the waterway depending on channel geometry, bottom topography, boundary conditions, and the distribution of wind. Then we determine the distribution of the angular drift for a given vessel travelling at a given location of a waterway. Finally, we incorporate the drift probabilities and random arrival of vessels into a Markov chain model. By analyzing the time-dependent and the steady-state probabilities of the Markov chain, we obtain risk measures such as the probability of casualty at a given location and also the expected number of casualties for a given number of vessels arriving per unit time. Analysis of the Markovian model also yields an analytical result that shows that the expected number of casualties is proportional to square of the tanker arrival rate. We present our methodology on an experimental model of a hypothetical narrow waterway. © 1999 John Wiley & Sons, Inc. Naval Reseach Logistics 46: 871–892, 1999     

Optimizing barge utilization in hinterland container transportation

In hinterland container transportation the use of barges is getting more and more important. We propose a real‐life operational planning problem model from an inland terminal operating company, in which the number of containers shipped per barge is maximized and the number of terminals visited per barge is minimized. This problem is solved with an integer linear program (ILP), yielding strong cost reductions, about 20%, compared to the method used currently in practice. Besides, we develop a heuristic that solves the ILP in two stages. First, it decides for each barge which terminals to visit and second it assigns containers to the barges. This heuristic produces almost always optimal solutions and otherwise near‐optimal solutions. Moreover, the heuristic runs much faster than the ILP, especially for large‐sized instances.     

恒速航行原理的数学证明与分析

提出并证明了船舶经济航行的基本原理———恒速航行原理 .先将实际船舶航行中最经济航行的航速选择这个一般性问题抽象成纯数学问题 :在规定的时间内从A地航行到B地 ,如何选择航速以使推进系统总耗功最省 ;然后在数学上证明恒速航行原理 ,即恒速航行是船舶经济航行唯一的选择 ;最后 ,将该原理推广到其它交通手段 ,如车辆行驶和飞机飞行     

作战仿真数据集成框架研究及实现

作战仿真数据的集成与整合是我军数据工程建设项目的重要内容.以ETL及消息中间件(MOM)技术为基础,设计了一种基于消息中间件的抽取、转换、传输与加载(ETTL)的作战仿真数据集成框架.分析了系统结构模型及各模块相互关系,提出了一个可行的数据集成解决方案.介绍了一个分布式数据集成系统平台的设计与实现,并结合一个数据集成实例详细阐述了该系统在我军军事演习中的应用.