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.     

The assignment of storage locations to containers for a container stack

Assigning storage locations to incoming or reshuffled containers is a fundamental problem essential to the operations efficiency of container terminals. The problem is notoriously hard for its combinatorial and dynamic nature. In this article, we minimize the number of reshuffles in assigning storage locations for incoming and reshuffled export containers. For the static problem to empty a given stack without any new container arrival, the optimum reshuffle sequence is identified by an integer program (IP). The integer program captures the evolution of stack configurations as a function of decisions and is of interest by itself. Heuristics based on the integer program are then derived. Their competitiveness in accuracy and time are established by extensive numerical runs comparing them with existing heuristics in literature and in practice as well as with extensions of the existing heuristics. Variants of the IP‐based heuristics are then applied to the dynamic problem with continual retrievals and arrivals of containers. Again, numerical runs confirm that the IP‐based heuristic is competitive. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

一类非线性二阶多点边值问题多个正解的存在性研究

通过定义适当的锥,运用锥映射的不动点定理,结合上下解方法,给出了二阶多点边值问题多个正解存在性的判定方法.作为特例,获得了三点边值问题多个正解存在性的判定依据,从而推广了相关文献中关于二阶三点边值问题正解存在性的结果.