Aheuristic Algorithm for Berth Scheduling Problem in Container Ports

In this paper,the berth scheduling problem is transformed into a special two-dimensional packing problem with some constraints.A nonlinear programming model for the problem is established,and a heuristic algorithm is proposed to solve the model.Simulation results show that the algorithm can improve the utilization of berths on discrete berth scheduling in the container port.

Study on Ship Automatic Berthing System with Mooring Lines

This study describes an automatic berthing system with mooring lines. It is designed to be berthed by using mooring device on the upper deck of a ship. It is to berth once maintaining parallel with the quay by controlling both forward and aft breast lines. Berthing method is used through length adjustment of mooring lines connected between ship and quay by controlling the angular velocity and the torque of hydraulic motor in mooring device. The study is conducted under three changing conditions of draft, such as even-keel, rise of the gravity center and trim to stern. Variables affecting berthing stability are determined based on the control performance of each condition. Bond graphs method is used to model the system. Controller is designed as PID control method of reference-model algorithm. The control program is composed of synchronous control system based on the equations derived with the numerical analysis. The tank test is conducted to verify the usefulness of the control program.

Integration of Berth Allocation and Quay Crane Assignment in Tidal Container Ports

Tide is a significant factor which interferes with the berthing and departing operations of vessels in tidal ports. It is a preferable way to incorporate this factor into the simultaneous berth allocation and quay crane( QC) assignment problem( BACAP) in order to facilitate the realistic decision-making process at container terminal. For this purpose,an integrated optimization model is built with tidal time windows as forbidden intervals for berthing or departing. A hind-and-fore adjustment heuristic is proposed and applied under an iterative optimization framework. Numerical experiment shows the satisfying performance of the proposed algorithm.

Modeling and Simulation of Automatic Berthing based on Bow and Stern Thruster Assist for Unmanned Surface Vehicle

In order to solve the technical problems of autonomous berthing of the Unmanned Surface Vehicle(USV),this research has met the requirements of maneuverability berthing under different conditions by effectively using the bow and stern thrusters,which is a technological breakthrough in actual production and life.Based on the MMG model,the maneuverability mathematical model of the USV with bow and stern thruster was established.And the motion simulation of USV maneuvering was carried out through the numerical simulation calculation.Then the berthing plan was designed based on the maneuverability analysis of the USV low-speed motion,and the simulation of automatic berthing for USV was carried out.The research results of this paper can be of certain practical significance for the USV based on the support of the bow and stern thruster in the berthing.At the same time,it also provides a certain theoretical reference for the handling of the USV automatic berthing.

Berth-crane allocation under uncertainty:dynamic modeling and nested Tabu search

The integrated berth-crane allocation problem at container terminals is addressed under the uncertainty of vessel arrival time at operational level. To ensure both robustness and flexibility of the 2-stage decision processes,a dynamic decision framework is proposed based on the dynamic analysis of information and operation at container terminal. A mixed integer programming model is established aiming at minimizing total cost of all vessels,including the cost of fixed to-be-executed decisions in the 1^(st) stage and expected cost of the adjustable stochastic-scenario-based decisions of all scenarios in the 2^(nd) stage. A multi-layer nested Tabu search is proposed for each epoch dynamically. Finally numerical experiments have been conducted to testify the effectiveness and efficiency of the proposed model and algorithm.

Experimental Study on Allowable Berthing and Mooring Conditions of An Oil Tanker

When an oil tanker under the combined action of wind, waves and tidal current and is berthed or moored to a platform, the impact forces on the fenders and the tensile force in the mooring lines are important factors in the studies of berthing and mooring conditions. Based on the experiment of a berthing and mooring tanker model under the action of wind, wave and tidal current in the same direction, this paper studies the allowable berthing and mooring conditions by considering the tensile forces of mooring lines and impact forces on the fenders, as well as the impact energy on the fenders. And a method has been proposed here for motion amplitude analysis. A successful method to decrease impact forces on the fenders is put forward. Blowing in wind and blowing off wind and different angles between waves and the fenders are considered in the experimental study. In the berthing tests of the tanker model, the impact forces are measured and the impact energy is calculated, then the berthing conditions are determined. In the mooring tests of the tanker model, the mooring line tensile forces and impact forces are measured, and the allowable mooring conditions are given that will be useful to engineering design.

An Improved Genetic Algorithm for Berth Scheduling at Bulk Terminal

Berth and loading and unloading machinery are not only the mainfactors that affecting the terminal operation, but also the main starting point ofenergy saving and emission reduction. In this paper, a genetic Algorithm Framework is designed for the berth allocation with low carbon and high efficiency atbulk terminal. In solving the problem, the scheduler’s experience is transformedinto a regular way to obtain the initial solution. The individual is represented as achromosome, and the sub-chromosomes are encoded as integers, the roulettewheel method is used for selection, the two-point crossing method is used forcross, and the exchange variation method is used for variation in the procedureof designing the Algorithm. Considering the complexity of berth schedulingproblem and the diversity of constraints and boundary conditions, the geneticalgorithm combines with system simulation to get the final scheme of berthallocation. This model and algorithm are verified to be practical by analyzingmultiple sets of examples of shorelines with different lengths. When comparedwith the traditional algorithms in three aspects which includes berth offsetdistance, departure delay cost and energy consumption of portal crane, the resultindicates that the improved algorithm is more effective and feasible. The studywill help to lower energy consumption and resource waste, reduce environmentalpollution, and provide a reference for low-carbon, green and sustainable development of the terminal.

Numerical Prediction of Hydrodynamic Forces on A Berthed Ship Induced by A Passing Ship in Different Waterway Geometries

An investigation has been conducted to quantify the effect of waterway geometry on the form and magnitude of forces and moment experienced by a berthed ship due to a passing ship.By using the dynamic mesh technique and solving the unsteady RANS equations in conjunction with a RNG k？ε turbulence model,numerical simulation of the three-dimensional unsteady viscous flow around a passing ship and a berthed ship in different waterway geometries is conducted,and the hydrodynamic forces and moment acting on the berthed ship are calculated.The proposed method is verified by comparing the numerical results with existing empirical curves and a selection of results from model scale experiments.The calculated interaction forces and moment are presented for six different waterway geometries.The magnitude of the peak values and the form of the forces and moment on the berthed ship for different cases are investigated to assess the effect of the waterway geometry.The results of present study can provide certain guidance on safe maneuvering of a ship passing by a berthed ship.

Nesting and Berth Allocation by an Expert System Using Heuristic Search

Nesting is a common problem in industries such as shipbuilding, auto-maker, clothing, shoe-making, and furniture, in which various parts are cut off from a stock or stocks while minimizing the wastes or maximizing the utilization of the stock. Berth allocation at seaside is also considered one form of two dimensional nesting problems, in which a ship is assigned a location for service during a certain time slot. This paper presents an expert system using a heuristic search method for nesting problems. The parts and stocks are represented by pixels with which utility function is used to evaluate current state in search tree. The system is developed in CLIPS, an expert system shell and applied to various example problems with different constraints and to a berth allocation example to illustrate its applicability under different conditions.

Collaborative Optimization of Berth Allocation and Yard Storage in Container Terminals

Considering the interaction between the berth and the yard,this paper studies the collaborative optimization problem of berth allocation and yard storage from the point of the ships over a certain planning period.This collaborative optimization problem is formulated as the integer programming,which aims at minimizing the total truck travel distance.And decision variables are the berthing positions for visiting ships and the storage positions for export containers.Meanwhile,this paper demonstrates the complexity of the problem in theory.And the hybrid tabu genetic algorithm is designed to solve the problem to obtain the optimal berth allocation position and export container storage position.For this algorithm,the rule is applied to generate the initial feasible solutions,and the crossover and mutation operation are simultaneously applied to optimize the initial solutions.Finally,this paper discusses two different scenes:the same berth scene and the same ship scene.The influence of two different scenes on truck travel distance is analyzed by different numerical examples.Numerical examples’results show that the collaborative optimization of berth allocation and yard storage can effectively shorten the truck travel distance and improve the efficiency of terminal operation,which provides the decision support for terminal operators.

An Analysis of Net Berth Productivity in the Handling Operations with Dry Bulk Cargoes in a Seaport

Productivity at the berth is one from the group of port productivity measures which is closely tied to ship turnaround times.Net berth productivity is value of productivity related to the operational time at the berth.Based on the facts identified from available literature about minor share of researches related to the net berth productivity in the handling operations with dry bulk cargoes in a seaport,it was decided to take this port productivity metrics as an object of a research.After a detailed analysis of different categories of the net berth productivity in the handling operations with dry bulks,key groups of influential factors which determine values of the net berth productivity are identified and systematized.Some principal elements related to improving net berth productivity are taken into consideration,too.Concrete results shown in this paper are related to the Dry Bulk Cargo Terminal in the Port of Bar(Montenegro).

基于改进反步滑模控制算法的拖轮自主靠泊控制

[目的]针对拖轮的自主靠泊控制问题,研究基于虚拟船领导的目标跟踪控制策略在拖轮自主靠泊中的应用。[方法]首先,将拖轮的自主靠泊过程转变为虚拟拖轮和实际拖轮的目标跟踪控制过程;然后,设计靠泊系统的运动学模型,考虑靠泊场景中的特殊环境干扰,使用反步法和滑模控制法(SMC)设计全回转尾推进拖轮的自主靠泊控制器,提供了3种不同的滑模面设计并使用李雅普诺夫函数进行稳定性验证;最后,采用仿真实验的方式,通过靠泊轨迹、速度误差和距离误差来对控制的效果进行验证。[结果]仿真实验结果表明,设计的拖轮自主靠泊控制策略以及控制器在拖轮自主靠泊场景中具有较好的效果,面对系统的不确定干扰有较好的表现。[结论]该控制策略以及靠泊控制器的适用性以及鲁棒性较好,以全新的角度实现了拖轮自主靠泊控制,为后续拖轮的靠泊控制研究提供了新的方向。

欠驱商船的自主靠泊轨迹规划研究

针对大型商船在自主靠泊时的轨迹规划任务,分别考虑远码头轨迹规划和码头末端镇定靠泊两部分.基于大型船舶自身特点及限制等多约束分析的分阶段路径规划方法,完成面向大型商船自主靠泊的轨迹规划任务.考虑大型商船自身体型较大,低速运动时船舶的舵效和实船操纵性能差等难题,提出大型船舶自身限制等多约束分析的人工势场法,改进传统人工势场法中存在引力过大、目标不可达的问题.同时考虑镇定阶段船舶自身及泊位信息对船舶艏向和速度的约束,绘制舵角的输出变化曲线,并进行航迹规划,为商船选择合适的航线进行靠泊提供了理论依据.

智能船舶靠泊技术研究热点与趋势

在梳理近年来国内外智能船舶靠泊技术研究现状的基础上,首先从靠泊方式、数学模型和控制算法3个方面分别归纳靠泊技术的研究热点与应用情况,分析智能船舶靠泊技术在自主性、建模精度、路径规划、控制算法、节能效果和系统测试等方面尚待解决的问题。然后,从航海实际需求出发,提出下一步需要突破的有关信息融合、在线建模、智能决策、算法优化、绿色节能和测试技术等方面的核心理论和关键技术问题,努力提升靠泊技术的自主性、鲁棒性、快速性和“韧性”,助力实现安全、绿色、高效的智能航运目标。

基于AIS大数据耦合分析的沿海港口泊位利用率研究

针对我国沿海港口能力供给水平数据跟踪方面长期存在的时效性差、人为统计过程中易出现错漏等诸多问题,分析传统泊位通过能力统计失真的具体原因,提出将泊位利用率作为评价港口服务水平的表征指标,依托地理信息系统(GIS)平台和基于船舶自动识别系统(AIS)等数据耦合的空间拓扑分析,综合考虑空间关系、航速特征、经留时间等影响因素,研发基于AIS大数据的泊位利用率算法模型,并以上海港2019年集装箱泊位利用率为例进行算法验证。结果表明,所提出的泊位利用率算法模型是可信的;提供了一种能够反映客观实际、定量分析判断港口服务水平的技术手段,可为政府部门长期动态监测港口能力与运输需求互动平衡关系,支撑政府部门决策港口发展重点和建设时序,避免空间资源浪费、重复建设、能力过剩等问题提供技术支撑。

集装箱港口多码头泊位联合分配优化研究

多码头泊位联合分配是港口资源整合、提升服务水平的重要手段。针对集装箱港口多码头泊位计划,考虑不同码头泊位条件、岸桥能力等因素,构建多码头泊位-岸桥集成分配数学模型。设计改进灰狼算法(IGWO),利用离散化映射进行编码设计,基于优胜劣汰法实现种群动态进化。设计算例,将IGWO与果蝇算法和粒子群算法进行对比。结果显示:IGWO算法优化结果分别提升16.6%和21.1%;利用IGWO对不同船舶到港密度泊位算例进行求解,其中,多码头泊位分配可有效减少总时间成本及延误船舶数量,节省岸线资源约10%。结果表明:设计的模型及算法可有效解决多码头泊位联合分配问题。

南京某高桩码头靠泊能力仿真分析与在线监测预警

高桩码头服役环境复杂,码头结构在数十年的运行期内会发生不同程度的损伤,影响码头的安全运营。在码头运行过程中,船舶荷载是高桩码头结构的主要荷载,对码头结构的安全性、耐久性影响较大。本文对南京港某码头靠泊能力进行了有限元仿真分析,提出船舶靠泊过程中的三级安全预警阈值;结合长期在线监测,为码头结构安全服役提供技术支撑。研究结果表明:在船舶撞击1#排架的情况下,船舶撞击力达到238 kN时,码头结构响应达到三级预警指标,码头位移为3.8 mm,桩基顶部应变为69×10-6;船舶撞击力达到323 kN时,码头结构响应达到二级预警指标,码头位移为5.1 mm,桩基顶部应变为100×10-6;船舶撞击力达到471 kN,码头结构响应达到一级预警指标码头位移为7.5 mm,桩基顶部应变为156×10-6。在线监测预警结果表明,码头结构具备5 000吨级船舶靠泊能力,在规范靠泊的前提下,能够满足8 000吨级船舶靠泊的结构安全要求。

考虑海铁联运的集装箱码头泊位分配优化

在海铁联运背景下,协同考虑到港船舶及铁路班列特点,优化集装箱码头泊位分配,对于提高港口作业效率至关重要。在满足码头岸线、泊位水深、岸桥等资源约束前提下,综合考虑船舶服务优先级和偏好泊位、铁路集装箱班列到发时间等约束,以船舶在港停留时间和泊位偏移惩罚时间最小为优化目标,建立海铁联运集装箱码头泊位分配优化模型;针对模型特点,设计自适应遗传算法进行求解,选取计划周期48 h内的到港船舶数据进行案例分析,通过MATLAB数值实验,得到符合船舶服务优先级和泊位偏好要求且契合铁路班列开行计划的海铁联运码头泊位分配方案。数值实验结果表明:在海铁联运协同优化条件下,船舶平均等泊时间为2.9 min,最大等泊时间为11.4 min,同时船舶的靠泊位置与偏好泊位之间的距离均不超过100 m,船舶在港的停留时间及偏好泊位差都得到了较好的控制。研究可进一步优化海铁联运集装箱码头泊位分配方案,有利于提高海铁联运集装箱在港转运效率。

基于NSGA-Ⅱ算法的自动驾驶停车泊位优化模型

完全自动驾驶车辆将具有自动泊车功能,自主泊车技术可实现多排布局的高密度、集约化停车布局,将彻底改变双排多通道的传统停车布局方式.然而,在释放被阻塞车辆时不可避免产生额外的移动和拥堵.为了明晰多排布局产生排队阻塞和额外移动次数与空间利用率提升的悖反规律,综合考虑停车场的几何属性、移动策略、需求特征等设计要素,通过车辆协同让道规则释放阻塞车辆,以泊位数量最大和移动次数最少为双重目标,构建了自动驾驶条件下多排布局方式停车泊位优化模型,设计了带精英策略的非支配排序遗传算法(NSGA-Ⅱ)进行求解,通过数值实验提出了停车设施的最佳区域和布局,同时还进行了不同移动策略的敏感性分析.结果表明,在不降低停车位利用率的前提下,基于就近原则的移动策略大大减少了预期移动次数.