Dynamic order acceptance and capacity planning on a single bottleneck resource

We present a tactical decision model for order acceptance and capacity planning that maximizes the expected profits from accepted orders, allowing for aggregate regular as well as nonregular capacity. The stream of incoming order arrivals is the main source of uncertainty in dynamic order acceptance and the company only has forecasts of the main properties of the future incoming projects. Project proposals arrive sequentially with deterministic interarrival times and a decision on order acceptance and capacity planning needs to be made each time a proposal arrives and its project characteristics are revealed. We apply stochastic dynamic programming to determine a profit threshold for the accept/reject decision as well as to deterministically allocate a single bottleneck resource to the accepted projects, both with an eye on maximizing the expected revenues within the problem horizon. We derive a number of managerial insights based on an analysis of the influence of project and environmental characteristics on optimal project selection and aggregate capacity usage. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

新型舰炮武器情报指挥系统模拟试验方法

在简要介绍模拟试验系统及搜索雷达模拟器功能和工作原理的基础上,针对某型近程反导舰炮武器情报指挥系统,提出了包括模拟试验流程、仿真数学模型及评估方法的一套模拟试验方法,弥补了单一外场试验考核不充分的不足,达到了全面科学评价被试系统的目的。该模拟方法是外场试验的补充和完善,开拓了靶场试验的新思路。     

基于遗传算法的自航水雷航路规划

自航水雷在执行任务时需要装载根据战场环境预先规划好的最优路径,路径的优劣直接决定了自航水雷的作战效率.采用遗传算法进行自航水雷航路优化,算法利用极坐标描述威胁位置和航路点,将航路编码由二维缩减至一维,降低了搜索空间,提高了优化效率.对算法进行了相应的仿真,仿真结果表明,编码方式提高了优化效率,得到的航路有效地规避了威胁.     

大型舰船电力系统网络重构研究

大型舰船电力系统的出现使供电方式由原来的辐射状向环形发展,其网络重构是一个崭新的问题.文中给出了大型舰船电力系统的网络拓扑结构并综合考虑了线路容量限制、节点电压约束及供电负荷优先性的重构数学模型,保证了各种情况下最大限度地给负荷供电.将规划遗传算法应用于所建模型的求解,并应用算例验证了此解法的可行性.     

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     

基于多元价值目标的体系作战信息流转模式探析

高效合理的信息流转模式是有效实施基于信息系统体系作战的前提和重要保障。引入了价值目标理论,解析了信息流转概念内涵,分析了信息流转价值目标与作用机理,分别提出了基于最大信息流量、最佳信息质量、最小传输时间和综合价值目标的体系作战信息流转模式,并给出了信息流转策略。     

Robust shortest path planning and semicontractive dynamic programming

In this article, we consider shortest path problems in a directed graph where the transitions between nodes are subject to uncertainty. We use a minimax formulation, where the objective is to guarantee that a special destination state is reached with a minimum cost path under the worst possible instance of the uncertainty. Problems of this type arise, among others, in planning and pursuit‐evasion contexts, and in model predictive control. Our analysis makes use of the recently developed theory of abstract semicontractive dynamic programming models. We investigate questions of existence and uniqueness of solution of the optimality equation, existence of optimal paths, and the validity of various algorithms patterned after the classical methods of value and policy iteration, as well as a Dijkstra‐like algorithm for problems with nonnegative arc lengths.© 2016 Wiley Periodicals, Inc. Naval Research Logistics 66:15–37, 2019     

基于Virtools的洞库工程维护管理虚拟训练系统

为了解决洞库工程教学训练缺乏直观性和实践性的难题,利用Revit,Sketch Up和3D Max软件进行三维模型构建,以漫游中的基本图形变换和位置实时显示技术为例介绍了相关数学原理及Virtools编程实现过程,实现预定功能后发布了洞库工程维护管理虚拟训练系统。该虚拟训练系统具有功能演示、虚拟漫游、虚拟施工、维护管理虚拟训练和考核评估等功能,可以让学员身临其境地学习洞库工程维护管理的相关知识,有效地提高了教学效果。     

随机布阵条件下同时数字多波束干扰优化设计方法

针对现有方法普遍存在的波束形成算法效率低、难以形成多频点多方向的同时多波束干扰、不适用于随机布阵条件下的波束形成等缺点,提出了一种基于二阶锥规划(SOCP,Second-Order Cone Programming)理论的同时数字多波束干扰形成方法。首先,给出了在随机布阵条件下干扰多波束优化设计问题的数学描述;其次,以范数准则为例,将随机布阵条件下干扰多波束设计问题的解析形式转化为相应的SOCP形式;再次,利用现有的原-对偶内点算法工具箱Se Du Mi或者CVX进行快速求解。最后,仿真结果表明该方法可以较好地解决随机布阵条件下的多频率多方向雷达目标同时多波束干扰优化设计问题。