海洋环境监测平行系统优化融合

多个海洋环境监测系统之间存在的功能冗余导致资源浪费和不必要的资金投入,因此应将各个系统优化融合成有机整体来节约海洋环境监测的资源和成本。将海洋环境监测系统按照功能划分为不同的模块,在线性规划融合的基础上引入熵方法,以成本和效能指标为主要对象,通过合理分配,在确保系统优化融合后监测能力不降低的同时,尽量减少建设成本。     

On the reduction of total‐cost and average‐cost MDPs to discounted MDPs

This article provides conditions under which total‐cost and average‐cost Markov decision processes (MDPs) can be reduced to discounted ones. Results are given for transient total‐cost MDPs with transition rates whose values may be greater than one, as well as for average‐cost MDPs with transition probabilities satisfying the condition that there is a state such that the expected time to reach it is uniformly bounded for all initial states and stationary policies. In particular, these reductions imply sufficient conditions for the validity of optimality equations and the existence of stationary optimal policies for MDPs with undiscounted total cost and average‐cost criteria. When the state and action sets are finite, these reductions lead to linear programming formulations and complexity estimates for MDPs under the aforementioned criteria.© 2017 Wiley Periodicals, Inc. Naval Research Logistics 66:38–56, 2019     

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.     

Mathematical formulation and heuristic algorithm for the block relocation and loading problem

This study considers the block relocation and loading problem in container terminals. The optimal loading sequence and relocation location are simultaneously decided on the basis of the desired ship‐bay and initial yard space configuration. An integer linear programming model is developed to minimize the number of relocations in the yard space on the basis of no shifts in the ship bay. The accuracy of the model is tested on small‐scale scenarios by using CPLEX. Considering the problem size in the real world, we present a rule‐based heuristic method that is combined with a mathematical model for the removal, loading, and relocation operations. The influence of rules on algorithm performance is also analyzed, and the heuristic algorithm is compared with different types of algorithms in the literature. The extensive numerical experiments show the efficiency of the proposed heuristic algorithm.     

A refined deterministic linear program for the network revenue management problem with customer choice behavior

We present a new deterministic linear program for the network revenue management problem with customer choice behavior. The novel aspect of our linear program is that it naturally generates bid prices that depend on how much time is left until the time of departure. Similar to the earlier linear program used by van Ryzin and Liu (2004), the optimal objective value of our linear program provides an upper bound on the optimal total expected revenue over the planning horizon. In addition, the percent gap between the optimal objective value of our linear program and the optimal total expected revenue diminishes in an asymptotic regime where the leg capacities and the number of time periods in the planning horizon increase linearly with the same rate. Computational experiments indicate that when compared with the linear program that appears in the existing literature, our linear program can provide tighter upper bounds, and the control policies that are based on our linear program can obtain higher total expected revenues. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于Fisher线性判别模型的文本特征选择算法

在采用向量空间模型表示方法的文本分类系统中,维数约简是必要的步骤,特征选择方法由于计算复杂度较低而被广泛采用.本文基于Fisher线性判别模型提出了一种新的文本特征选择算法,将其求解过程转换为一个特征项优化组合的问题,避免了复杂的矩阵变换运算.实验表明,该方法与信息增益、卡方统计方法比较,具有较明显的优势.     

引入电流变化率的电源分布网络最差噪声分析算法

随着时钟频率的增加以及电源电压的降低,电源完整性问题日益凸显。将电流变化率加入到最差噪声算法的电流约束中,能够在任意电流变化率的情况下分析电源分布网络的最差噪声,从而获得更加真实的最差噪声。另外,利用改进的Knuth-Yao四边形不等式法对基于动态规划的最差噪声算法进行加速,加速后算法的时间复杂度从O(n~2m)降为O(mnlogn)。     

合成分队火力分配协同决策模型研究

针对合成分队火力分配效率和科学性不高的问题,采用协同决策思想对合成分队火力优化分配方法进行了研究。针对合成分队的作战特点提出了3种模型:建立了攻击力量类型相同的多种准则的火力分配模型,建立了攻击力量类型不同的基于双层规划的火力分配模型,建立了具有上级指定任务的分队内和分队间的火力协同分配模型,并对相关模型进行了实例仿真验证。提出的这3种模型能够解决合成分队在火力分配中的协同决策问题,可提高作战指挥决策的实时性和科学性。     

基于多项式设计法的小推力轨迹设计

形状逼近法是小推力轨迹设计中的一种有效方法,然而现有的方法大都假定运动轨迹为某一特定的形状,而且没有考虑推力加速度的约束限制。针对小推力轨道交会问题,提出一种基于多项式的轨迹设计方法。结合极坐标系,建立基于多项式的三自由度轨迹运动模型,将轨迹设计问题转化为求解多项式的系数问题;根据运动模型推导轨迹的动力学特性,建立约束方程,并以消耗燃料最少作为性能指标,采用序列二次规划的方法对多项式的系数进行寻优计算。该方法不仅能求解多个形状设计参数不确定性问题,而且还能满足推力加速度的约束限制。仿真验证了该方法的正确性和可用性,该方法可为任务设计初步阶段的轨迹设计和燃料消耗预估提供一定的技术参考。     

基于预定作业周期的航母作战部署调度研究

为科学筹划航母作战部署调度,优化航母作战兵力的运用,对航母作战部署调度问题进行建模研究。介绍航母预定作业周期,重点阐述航母综合训练期、维修保障期和人员/作战节奏等相关内容;在此基础上,分析航母作战部署调度的约束条件,在满足对作战区域有效时间覆盖条件下,以最小化航母作战兵力数量为目标函数,构建航母作战部署调度优化模型,并通过实例进行验证。结果表明,该模型是有效、实用的,可为科学决策航母作战部署调度提供依据和方法。