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.     

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.     

舰船腐蚀电场建模及补偿最优解验证

基于等效偶极子法,从补偿偶极子长度、角度、大小三方面给出了任意角度的补偿偶极子场解析式,再利用电荷矢量叠加原理,建立了"腐蚀偶极子+补偿偶极子"电场模型。仿真以单轴桨船为例,先验证"腐蚀偶极子+补偿偶极子"电场模型的正确性,再进行补偿偶极子对舰船电场的影响验证,从而得出补偿最优解。模拟实验结果表明,补偿阳极在工程允许条件下距离补偿系统接船端最远处,且补偿系统平行于水平面和船体时补偿效果最优;在补偿最优条件下,理论上是可以抵消原舰船腐蚀电场的。     

求刚性中子动力学方程数值解的新方法

中子动力学方程是刚性方程,数值计算很费机时,为减少计算机时提出了许多算法,常用的有隐式盖分法、多步法和自动变步长法等,著名的方法有吉尔方法和埃米特方法.但这些方法的计算程序复杂且总计算时间减少不明显.消去刚性法是一个全新的算法,稳定步长可达到20 s,计算时间大大下降.     

基于X射线脉冲星绝对定位中的整周模糊度改进算法研究

基于X射线脉冲星导航定位方法是一种全新的自主导航技术。该文给出了脉冲星绝对定位的基本原理,针对有关文章存在的疑问,提出了脉冲星导航绝对定位中整周模糊度改进算法,并对其进行了深入的分析和理论推导,通过仿真计算脉冲星整周模糊度和航天器的位置,得到了较理想的定位精度。这种新改进的整周模糊度算法为脉冲星绝对定位提供了新的思路。     

Decomposing inventory routing problems with approximate value functions

We present a time decomposition for inventory routing problems. The methodology is based on valuing inventory with a concave piecewise linear function and then combining solutions to single‐period subproblems using dynamic programming techniques. Computational experiments show that the resulting value function accurately captures the inventory's value, and solving the multiperiod problem as a sequence of single‐period subproblems drastically decreases computational time without sacrificing solution quality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

求解旅行商问题的两步法

基于度约束最小树算法提出了一个解决旅行商问题的算法（即两步法）,针对这一算法我们进行了大量的数据实验,数据实验表明算法是非常有效的。     

不相容矩阵方程AXB=D的反中心对称迭代解

研究了不相容矩阵方程AXB=D的反中心对称最佳逼近解,基于经典共轭梯度法思想,构造了求解这一问题的迭代算法,证明了该算法的有限终止性并给出了该方法的误差估计,最后利用具体的数值例子验证了算法的有效可行性。     

一种基于多目标优化的QoS路由交互式算法

为了满足通信网络中一些特定业务对于多个网络指标性能的同时要求 ,研究了一类基于多目标决策的QoS路由算法。通过选取带宽作为约束条件 ,把时延和丢失率作为优化目标 ,建立了QoS路由选择的多目标非线性整数规划模型 ,并给出了一种求解模型的交互式算法。该算法通过逐步调整目标函数的上界 ,压缩目标函数的搜索空间来满足决策者的要求和网络条件。实例计算结果表明了算法的可行性     

强约束条件下外弹道方程实时解算通用化设计技术

根据基于弹道方程的实时解算算法,解决了强约束条件下非低伸弹种弹道综合系数的统一计算问题,找出低伸弹种弹道综合系数的估计方法,进行了弹道实时解算模型的通用化设计,给出了程序流程并进行了测试.测试结果表明,弹道综合系数的估计比较准确,而解算模型在精度与实时性上均达到满意的程度,具有高度通用化的特点,并且使弹道问题的解算可以完全脱离射表进行.