Multi-period liner ship fleet planning with dependent uncertain container shipment demand

This paper deals with a realistic multi-period liner ship fleet planning problem by incorporating stochastic dependency of the random and period-dependent container shipment demand. This problem is formulated as a multi-period stochastic programming model with a sequence of interrelated two-stage stochastic programming (2SSP) problems characterized ship fleet planning in each single period. A solution method integrating dual decomposition and Lagrangian relaxation method is designed for solving the developed model. Numerical experiments are carried out to assess applicability and performance of the proposed model and solution algorithm. The results further demonstrate importance of stochastic dependence of the uncertain container shipment demand.     

集卡调度方式对集装箱港区碳排放的影响

集卡已成为集装箱港区内的主要碳排放源,尤其两艘大型集装箱船舶同时作业时,港区内集卡碳排放问题严重。针对该情况下集卡调度模式的特征,基于智能体仿真技术构建集装箱码头生产作业微观仿真模型,定量分析传统先卸后装、双船一装一卸、同贝同步装卸工艺下集卡调度方式与集卡配置数量对船舶在港时间、集卡碳排放量的影响。实例表明,采用同贝同步装卸作业方案可保证装卸效率,并有效减少集卡碳排放,而集卡配置数量只对集卡怠速行驶产生的碳排产生影响。     

Optimal reefer slot conversion for container freight transportation

Given a fleet of container ships of varying capacity, a cost-efficient approach for improving fleet utilization and reducing the number of delayed containers is to optimize the sequence of container ships in a given string, a problem which belongs to the large ship-deployment class. A string sequence with ‘uniformly’ distributed ship capacity is more likely to accommodate a random container shipment demand. The number of one’s total ship slots acts as a gauge of the capacity of the container ships. Meanwhile, there are two types of ship slots: dry slots and reefer slots. A dry slot only accommodates a dry container, while a reefer slot can accommodate either a dry or a reefer container. The numbers of dry and reefer slots for ships in a string are different. Therefore, in this study, we propose a model that considers both dry and reefer slots and use it to elucidate the optimal ship-deployment sequence. The objective is to minimize the delay of dry and reefer containers when the demand is uncertain. Furthermore, based on the optimal sequence deduced, the study also investigates the need to convert some dry slots to reefer slots for the container ships.     

Multi-agent system with iterative auction mechanism for master bay plan problem in marine logistics

The support of containerization to trade development demands an efficient solution method for the container loading problem in order to reduce shipment and handling time. Hence, the stowage planning of containers is critical to provide speedy delivery of resources from the area of supply to the area of demand. Moreover, information on container terminal activities, structure of ship, and characteristics of containers is distributed among stowage planners. This information imposes constraints, and so the master bay plan problem (MBPP) becomes NP-hard. Therefore, a multi-agent systems (MAS) methodology is designed to effectively communicate the information and solve the MBPP sustainably. In the designed MAS methodology, an information exchange system (IES) is created for stowage planners to bid for ship slots in each experimental iterative combinatorial auction (ICA) market. The winner in the ICA experiments is provided with the ship slots, and the entire bay plan is prepared. Further, the ship-turnaround time is validated using the data obtained from the benchmark problem.     

基于多种群萤火虫算法的集装箱船结构优化

针对集装箱船结构优化问题,依据CCS规范建立以集装箱船舯剖面面积最小为优化目标,板厚、型材横截面积为离散设计变量的优化数学模型。提出一种多种群萤火虫算法,各种群设置不同的参数,提高搜索区域,多子群并行寻优、子群主群协作寻优提高算法寻优性能,对所建模型进行优化计算。优化算例表明,所提出的多种群萤火虫算法比标准萤火虫算法可以更快的收敛得到最优解,在满足所有约束条件情况下,集装箱船舯剖面面积最小约13.2%,验证了多种群萤火虫算法应用于集装箱船结构优化的有效性。     

A slot reallocation model for containership schedule adjustment

Ship slot capacity is the main sale resource of container shipping lines. However, shipping lines often encounter situations, such as serious ship delays, that require adjustments of shipping schedules, causing the original delivery plans of some consignments to be altered. This study proposes an integer programming model for slot reallocation planning, based on a given adjusted schedule. Decisions regarding empty container repositioning are also examined. This model aims to maximise a company’s benefits from deliveries of consignments and movements of empty containers. Available slots are subject to port rotation changes, allowable port handlings and ship capacity. A case study of a deep ocean loop demonstrates optimal slot reallocation, and empty container repositioning is used for illustrative purposes. The reallocation characteristics due to benefit items and the model’s applicability to large-scale examples are discussed.     

面向多约束的船舶组立构件建造作业调度方法研究

为了提高船舶中小组立等中间产品建造作业调度能力,提升船舶建造效率,提出面向多约束的船舶组立建造作业调度方法。首先,分析船舶组立建造的工艺流程和作业调度方法,综合考虑机器小组、工艺和交货期等多种约束条件,以建造周期最短为调度目标,建立船舶组立建造作业调度数学模型;其次,综合运用算法分解策略及调度规则,设计改进的最短作业优先调度算法实现模型求解;最后,以某船厂建造车间一定生产周期（17天）的中小组立先行中日程计划为对象,验证该方法的有效性和实用性。研究结果表明,所提出的面向多约束的船舶组立建造作业调度方法相较于当前的调度方法,排产周期压缩22小时,即缩短了原有周期的16.18%,有效提高了生产计划排产和作业调度效率。     

集装箱支线运输船舶调度优化问题

调度是制约支线集装箱运输质量和效率的主要瓶颈之一。针对轴辐射海上运输模式,扩展了陆上车辆运输调度(VRP)理论,以所有船舶总的航行成本最低为目标函数,考虑了软时间约束等现实因素,构建了包含枢纽港和喂给港、多航线、多船型的支线集装箱船舶调度模型。基于该问题解的特征运用粒子群算法对模型进行了求解,最后通过仿真算例分析验证了模型的合理性及算法的有效性。     

Model and algorithm for container ship stowage planning based on bin-packing problem

In a general case, container ship serves many different ports on each voyage. A stowage planning for container ship made at one port must take account of the influence on subsequent ports. So the complexity of stowage planning problem increases due to its multi-ports nature. This problem is NP-hard problem. In order to reduce the computational complexity, the problem is decomposed into two sub-problems in this paper. First, container ship stowage problem （CSSP） is regarded as “packing problem”, ship-bays on the board of vessel are regarded as bins, the number of slots at each bay are taken as capacities of bins, and containers with different characteristics （homogeneous containers group） are treated as items packed. At this stage, there are two objective functions, one is to minimize the number of bays packed by containers and the other is to minimize the number of overstows. Secondly, containers assigned to each bays at first stage are allocate to special slot, the objective functions are to minimize the metacentric height, heel and overstows. The taboo search heuristics algorithm are used to solve the subproblem. The main focus of this paper is on the first subproblem. A case certifies the feasibility of the model and algorithm.     

基于路径特征的自动化码头AGV自适应交通控制

针对集装箱码头双向导引自由路径环境下水平运输系统交通管理的难题,在考虑车辆物理尺寸、轨迹及行车规则的基础上,构建合理栅格单位的环境地图,建立多车多任务路径的交通控制模型,并提出一种基于路径特征的自适应交通控制方法,采用滚动调度策略和启发式策略的遗传算法进行算例试验。结果表明,相比于固定预留方法,所提出的方法以更小的区段为调度间隔,并形成自适应计划期,预留栅格数量更灵活,实现了灵活区段定义下的道路自适应预留调度并避免阻塞,提高了道路资源的利用率。     

基于Flex Term软件的集装箱码头仿真试验

为提升集装箱码头装卸效率、降低码头运营成本,以国内某已建集装箱码头为研究对象,利用Flex Term软件,建立码头的仿真模型,实现了码头船舶调度、堆场分配、集卡进出闸口控制的仿真逻辑,并完成码头泊位计划、堆场计划、闸口计划的合理衔接。通过仿真数据统计与分析,对码头的通过能力、设备配置、道路交通状况进行评价,验证了码头设计的合理性。     

Voyage-based statistical fuel consumption models of ocean-going container ships in Korea

ABSTRACT

Accurately estimating fuel consumption of ships is crucial for shipping companies, port authorities, and environmental protection agencies. The bottom-up approach is becoming increasingly popular because it can estimate ship fuel consumption by accounting for ship activity conditions, such as changes in voyage speed, time, and distance; however, its use is still limited when estimating ship fuel consumption. Ship-specific information, such as the daily fuel consumption rate for main and auxiliary engines for every vessel, is expensive to gather, and generally not collected from private shipping companies. To address this research gap, we develop simplified and composite ship fuel consumption models for ocean-going container ships by size using a regression model. To estimate the fuel consumption models for container ships, we rely on ship activity data, including average speed and sailing time, distance, and actual fuel consumption for main and auxiliary engines. This information is obtained from a major container shipping company in Korea. We estimate and validate the parameters associated with fuel consumption for five different container ship sizes, all of which are smaller than the Post-Panamax container ship (15,000 TEU and above).     

A two-phase tabu search approach to scheduling optimization in container terminals

An optimization model for scheduling of quay cranes （QCs） and yard trailers was proposed to improve the overall efficiency of container terminals. To implement this model, a two-phase tabu search algorithm was designed. In the QCs scheduling phase of the algorithm, a search was performed to determine a good QC unloading operation order. For each QC unloading operation order generated during the QC＇s scheduling phase, another search was run to obtain a good yard trailer routing for the given QC＇s unloading order. Using this information, the time required for the operation was estimated, then the time of return to availability of the units was fed back to the QC scheduler. Numerical tests show that the two-phase Tabu Search algorithm searches the solution space efficiently, decreases the empty distance yard trailers must travel, decreases the number of trailers needed, and thereby reduces time and costs and improves the integration and reliability of container terminal operation systems.     

3600TEU集装箱船建造方案设计

集装箱船特点是线型变化大、精度要求高,相对于其他常规船型,建造难度较大.针对造船领域集装箱船建造方案策划所需考虑的多种因素,进行研究探讨,以3600 TEU集装箱船为例,介绍集装箱船建造方案策划的各项举措,保障项目成功实施.     

沿海集装箱港区港内锚地面积确定方法

设置港内锚地,是沿海集装箱港区缓解航道拥堵,提高港口服务水平的有效途径之一。为完善港内锚地面积确定方法的理论研究,基于计算机仿真技术,建立设置港内锚地的沿海集装箱港区船舶航行作业系统仿真模型,研究计算期内可能同时占用港内锚地的船舶数量及船型组合;计算不同锚泊方式下所需的港内锚地最大面积。仿真结果与分析结论为沿海集装箱港区港内锚地的规划建设及改造扩建提供参考。     

Editorial: an analysis of failure

This article deals with a short-term Liner Ship Fleet Planning (LSFP) problem with cargo shipment demand uncertainty for a single liner container shipping company. The cargo shipment demand uncertainty enables us to propose a chance constraint for each liner service route, which guarantees that the liner service route can satisfy the customers’ demand at least with a predetermined probability. Assuming that cargo shipment demand between any two ports on each liner service route is normally distributed, this article develops an integer linear programming model with chance constraints for the short-term LSFP problem. The proposed integer linear programming model can be efficiently solved by any optimization solver such as CPLEX. Finally, a numerical example is carried out to assess the model and analyze impact of the chance constraints and cargo shipment demand.     

船舶永磁同步电机的嵌入式节能调度方法研究

嵌入式调度方法因船舶永磁同步电机存在电压波动性，导致总能耗较高。为此。提出一种基于分阶段的船舶永磁同步电机节能调度方法。该方法先对嵌入式船舶永磁同步电机的耗量特征进行排序并构建等微增率基准，将微增率基准与最优潮流相结合，对约束条件进行有效处理并降低系统电机能耗，在满足限制基准的基础上，进行船舶永磁同步电机的嵌入式节能调度的全局最优解。实验结果表明，该算法最大限度地减少了发电机组的调节量，保障了舰船机组的稳定运行。     

港池内中长周期波浪作用下船舶系缆动力响应

针对港池内船舶装卸作业的安全与稳定问题,采用基于势流理论的面元法分析程序AQWA,分析得到船舶与码头结构耦合作用下的14 000 TEU集装箱船动力响应幅值算子。在此基础上,进一步采用码头泊位前的真实波浪条件,得到14 000 TEU集装箱船在设计系缆方式下的船舶运动量响应和缆绳受力响应。结果表明,14 000 TEU集装箱船横摇周期较大,与港池内存在的中长期波(12～18 s)不相匹配,不易引起船舶较大幅度的动力响应;计算分析结果与系泊物理模型试验所得到的结果相吻合,说明所采用的计算原理与分析模型较为可靠,具有较强的工程实际应用价值。     

Optimization of shipyard space allocation and scheduling using a heuristic algorithm

In this article we describe the development of a tool that allows planners to efficiently and effectively plan space within valuable areas of a shipyard. Traditionally, space is considered as resource; however, it is difficult to accurately account for and plan its consumption with the currently available planning software’s. The spatial scheduling tool described in this article can be used by planners to manually or automatically reserve space within the shipyard for construction of large blocks over the entire erection period of the ship. The software is coupled with a heuristic optimization solver inspired by an algorithm used for "3D bin-packing problems." The result is the ability to efficiently generate and compare multiple space allocation alternatives in a reduced time with the ultimate goal of maintaining the critical ship erection schedule. A better solution than manual or semi-automatic allocation of blocks can be obtained through the optimization module.     

Tactical planning models for managing container flow and ship deployment

This paper addresses two practical problems from a liner shipping company, i.e. the container flow management problem and the ship deployment problem, at the tactical planning level. A sequential model and a joint optimisation model are formulated to solve the problems. Our results show that the company should implement the joint optimisation model at the tactical planning level to improve the shipping capacity utilisation rather than the sequential model used in the current practice. Repositioning empty containers also need to be considered jointly with the nonempty container flow at the tactical planning level. Some important managerial insights into the operational and business processes are gained.