集装箱码头装卸桥调度优化模型与算法

研究装卸桥调度优化问题,以提高集装箱码头装卸效率。首先,建立了混合整数规划模型,模型充分考虑了集装箱装卸桥调度优化中的各种约束条件及特点。为了求解设计了基于遗传算法的求解方法,并且采用随机贪婪适应性搜索方法对算法进行改进。最后,通过实际算例对模型与算法的有效性进行了验证。     

MAS理论下集卡动态调度系统研究

集卡是集装箱码头中装卸货物的载体,合理的集卡调度对提高集装箱码头物流系统运作效率、缓解港区内交通阻塞、提高设备利用率具有重要的意义。针对码头集卡运作的特性,提出了基于MAS（Multiple Agent System）理论的集卡调度模型。运用Arena仿真软件对模型进行了仿真研究,并与以往文献基于其他方法的仿真结果进行了对比,表明了模型的可行性和有效性。     

集装箱卡车配置仿真研究

分析集装箱码头中集装箱卡车传统配置方式的基础上,使用Arena仿真软件,建立集装箱卡车配置仿真模型.基于集装箱卡车最短路径调度法,应用于实际生产的仿真模型,可计算集装箱卡车的最优配置.结果表明集装箱运输量恒定,集卡传统配置方式不是最优.通过建立仿真模型,计算所需要集卡量的最优解,为实际生产中集卡的配置提供理论依据,提高码头机械设备的利用率.     

面向集装箱码头物流系统的仿真优化研究

针对集装箱码头物流系统(containerterminallogisticssystems,CTLS)的自身特点和运营需求,根据当前国内外已有的相关研究及其发展趋势,提出了面向CTLS的仿真优化完整方法体系,并给出利用哈佛体系结构、基于Agent的计算、混合智能优化和企业服务总线的参考设计实现模型,以期为CTLS的设备配置、资源分配、生产计划和调度控制获得高效敏捷鲁棒的解决方案。通过对码头前沿泊位-岸桥联合调度生产实例的仿真、优化和分析,验证了所提思想的可行性与可信性。     

离散泊位布局下的泊位岸桥动态协调调度

为了制定合理的集装箱码头泊位岸桥资源调度计划,提高码头作业效率和客户满意度,基于离散泊位布局,建立了以在港集装箱船总的服务成本最小为优化目标的动态泊位岸桥协调调度模型。设计了遗传算法对模型求解,通过将部分约束条件嵌入算法结构简化了模型求解难度,并对算法迭代过程中的不可行解采用逐时刻基因调整策略进行修复。经过若干算例的数值实验,验证了模型和算法的可行性和有效性。     

面向并行可重构计算的集装箱码头生产调度建模与仿真

将集装箱码头物流系统（container terminal logistics systems, CTLS）视为一个大规模并行处理系统, 融合计算机体系结构中的并行计算和可重构计算的思想方法, 抽象出基于属性的有阻塞动态可重构混合流水车间调度（dynamic reconfigurable hybrid flow shops with blocking based on attributes, DR-HFS-BA）模型对CTLS控制决策进行描述, 得出面向DR-HFS-BA的CTLS多层双向作业体系。该生产调度模型能够精确描述CTLS的复杂结构和作业行为, 帮助港口建立敏捷鲁棒的生产调度和性能评估决策支持平台。最后, 一个集装箱码头生产实例被仿真和分析, 验证了上述建模思想的可行性和可信性, 从而为CTLS的任务调度和资源分配提出了新的解决思路。     

基于时间窗的双小车岸桥与AGV协调调度研究

针对自动化集装箱码头（automated container terminals,ACT）的自动导引车 ( automatic guided vehicle,AGVs) 与自动化双小车岸桥（double-trolley quay cranes,QCs）协调调度优化问题,以上海洋山港四期工程的实际布局和装卸工艺为基础,考虑装卸同时进行条件下以最小化任务总完工时间为目标,建立带有时间窗约束的双小车岸桥和AGV的协调调度模型,并采用遗传算法对实际算例进行求解。通过灵敏度分析,验证了该模型及算法的有效性,并对遗传算法参数设置的有效性进行检验。结果分析表明,该调度方法有助于提高自动化集装箱码头的作业效率,减少集装箱船的在港时间,提高码头竞争力。     

基于MAS的集装箱自动化码头协同作业系统模型

ZPMC新型集装箱自动化码头使用低架桥轨道和电动小车构成立体装卸系统,将集装箱的装卸分解为多个起重设备和水平运输设备的协作,实现了集装箱的自动装卸。针对该码头的运作特点,采用MAS(multi-agent system,多智能体系统)方法,将码头中的装卸设备抽象为具有一系列属性和方法的智能体,提出船舶、堆场、任务管理、设备管理等智能体,构建出自动化码头协同作业系统模型。在系统的实现层类图中详细阐述了各agent的属性方法、交互关系,结合就近原则及时间估计优化策略,给出了集装箱装卸最短路径的搜索方案,通过实例分析说明协同作业系统MAS模型能较好地体现该码头分布、动态的运作特征。该研究将对ZPMC集装箱自动化码头的调度优化提供一定的理论指导,同时对完善MAS方法在集装箱码头生产作业中的应用体系起到积极的推动作用。     

堆场龙门吊调度问题研究

在集装箱码头作业中,龙门吊是非常重要的码头资源,如何更合理地调度龙门吊对减少船舶在港时间,提高码头效率有重要意义。在综合考虑龙门吊在时间和空间上的不可跨越性以及其他约束条件的基础上,建立了龙门吊调度问题的混合整数规划模型,目标是使得集卡的等待时间最短。由于问题计算的复杂性,引进遗传算法来求解模型;算例验证了算法的有效性,与已有的模型进行比较,证明了该模型的优越性。     

面向哈佛体系结构的集装箱码头场桥作业调度

集装箱码头堆场作业调度问题一直是国内外相关研究的热点和难点,但由于码头作业的动态性、开放性、强耦合性和复杂性,堆场主要装卸设备场桥的调度配置问题一直未能有较好的解决方案。故提出面向哈佛体系结构的基于Agent建模和仿真模式,并将计算机操作系统中的磁盘臂调度算法和基于仿真的优化思想引入到上述模型中。通过构建相应的多Agent系统仿真得出敏捷高效鲁棒的场桥调度和配置解决方案,从而帮助集装箱码头提高服务水平和竞争力。     

A new continuous berth allocation and quay crane assignment model in container terminal

Over the past decades, Chinese ports throughput grew rapidly, and more and more concerns were shown on the operational efficiency and effectiveness. Many studies have been made for scheduling berth and quay cranes, which are the critical resources in container terminals. In this paper, a two-phase model for berth allocation and quay crane assignment is proposed. In the first phase, according to the relationships of time and space between vessels, a new continuous berth allocation model is established, in which not only the common restricts but the coverage area of quay crane are considered. Then in the quay crane assignment phase, a multi-objective programming model is proposed, in which the first objective is to minimize the range of maximum and minimum quay cranes used for resources saving, and the second one is to minimize the movements of quay cranes so as to improve the efficiency. A particle swarm optimization algorithm for BAP was developed. The results of numerical experiments show that the proposed approach can improve the essential operations in container terminal.     

Multi-objective bacterial colony optimization algorithm for integrated container terminal scheduling problem

Natural Computing - This paper proposes a multi-objective integrated container terminal scheduling problem considering three key components: berth allocation, quay cranes assignment and containers...     

Dynamic rolling strategy for multi-vessel quay crane scheduling

This paper focuses on the container loading and unloading problem with dynamic ship arrival times. Using a determined berth plan, in combination with the reality of a container terminal production scheduling environment, this paper proposes a scheduling method for quay cranes that can be used for multiple vessels in a container terminal, based on a dynamic rolling-horizon strategy. The goal of this method is to minimize the operation time of all ships at port and obtain operation equilibrium of quay cranes by establishing a mathematical model and using a genetic algorithm to solve the model. Numerical simulations are applied to calculate the optimal loading and unloading order and the completion time of container tasks on a ship. By comparing this result with the traditional method of quay crane loading and unloading, the paper verifies that the quay crane scheduling method for multiple vessels based on a dynamic rolling-horizon strategy can provide a positive contribution to improve the efficiency of container terminal quay crane loading and unloading and reduce resource wastage.     

潮汐影响下泊位和岸桥双目标联合调度仿真

针对集装箱船舶大型化导致的港口航道现有水深无法满足大型船舶安全吃水深度,需要借助潮水上涨进出航道的现状,研究了潮汐影响下连续型泊位和动态岸桥联合调度问题。建立了以最小化船舶周转时间和岸桥在船舶间移动次数的双目标混合整数规划模型。基于问题特点,设计了Epsilon约束精确算法和带精英策略的快速非支配排序遗传算法(NSGA-Ⅱ)分别求解小规模和大规模算例的Pareto最优解集,所得结果验证了模型和算法的正确性与有效性。通过潮汐周期灵敏度分析评估了潮汐周期长度对岸桥工作效率和港口服务质量的影响。仿真结果表明,建立的优化模型能够帮助港口企业有效降低潮汐对生产作业的影响,同时提供一组高效的Pareto最优泊位岸桥调度方案提高工作效率和经济效益。     

An optimization methodology for intermodal terminal management

A solution to the problems of resource allocation and scheduling of loading and unloading operations in a container terminal is presented. The two problems are formulated and solved hierarchically. First, the solution of the resource allocation problem returns, over a number of work shifts, a set of quay cranes used to load and unload containers from the moored ships and the set of yard cranes to store those containers on the yard. Then, a scheduling problem is formulated to compute the loading and unloading lists of containers for each allocated crane. The feasibility of the solution is verified against a detailed, discrete-event based, simulation model of the terminal. The simulation results show that the optimized resource allocation, which reduces the costs by [frac13], can be effectively adopted in combination with the optimized loading and unloading list. Moreover, the simulation shows that the optimized lists reduce the number of crane conflicts on the yard and the average length of the truck queues in the terminal.     

干扰约束下考虑分组作业面的岸桥AGV联合调度

为解决自动化码头海侧多阶段设备作业的协调问题,加快集装箱在码头内部的周转过程。考虑干扰约束下分组作业面的的岸桥自动导引小车（AGV）联合调度问题。以岸桥、AGV完工时间和AGV等待时间加权总和最小为目标,考虑岸桥实际操作中的干扰约束与AGV堵塞等待等情况,建立岸桥与AGV联合调度优化模型。提出岸桥动态调度与AGV分组作业面调度模式,设计不同规模的算例,并采用遗传算法（GA）进行求解,将计算结果与传统调度模式进行对比。结果表明,该算法能有效提高岸桥与AGV作业效率,降低AGV的等待时间与堵塞次数,为码头实际作业提供依据。     

单船岸桥分配与调度集成优化模型

针对集装箱码头泊位确定条件下的单船岸桥(QC)分配和调度问题,建立了线性规划模型.模型以船舶在泊作业时间最短为目标,考虑多岸桥作业过程中的干扰等待时间与岸桥间的作业量均衡,并设计了嵌入解空间切割策略的改进蚁群优化(IACO)算法进行模型求解.实验结果表明:与可用岸桥全部投放使用的方法相比,所提模型与算法求得结果平均能够节省31.86%的岸桥资源;IACO算法与Lingo求得的结果相比,船舶在泊作业时间的平均偏差仅为5.23%,但CPU处理时间平均降低了78.7%,表明了所提模型与算法的可行性和有效性.     

Heuristics for solving continuous berth allocation problem considering periodic balancing utilization of cranes

This study investigates a berth allocation problem considering the periodic balancing utilization of quay cranes in container terminals. The proposed model considers that the quay cranes allocated to a work shift should be fully used and other real-world considerations, such as the continuous quay line, the penalties for early arrivals and departure delays. To solve the model, several heuristics are developed: the model for large problems is decomposed into sub-models that are solved by rolling-horizon heuristics; neighborhood search heuristics are used for optimizing a berthing order of vessels; parallel computing is used to improve the algorithmic performance. The method performs well when applied to real-world large-scale instances with promising computation time that is linearly related to the number of vessels.     

A fast heuristic for quay crane scheduling with interference constraints

This paper considers the problem of scheduling quay cranes which are used at sea port container terminals to load and unload containers. This problem is studied intensively in a recent stream of research but still lacks a correct treatment of crane interference constraints. We present a revised optimization model for the scheduling of quay cranes and propose a heuristic solution procedure. At its core a Branch-and-Bound algorithm is applied for searching a subset of above average quality schedules. The heuristic takes advantage from efficient criteria for branching and bounding the search with respect to the impact of crane interference. Although the used techniques are quite standard, the new heuristic produces much better solutions in considerably shorter run times than all algorithms known from the literature.     

Bayesian network construction from event log for lateness analysis in port logistics

The handling of containers in port logistics consists of several activities, such as discharging, loading, gate-in and gate-out, among others. These activities are carried out using various equipment including quay cranes, yard cranes, trucks, and other related machinery. The high inter-dependency among activities and equipment on various factors often puts successive activities off schedule in real-time, leading to undesirable activity down time and the delay of activities. A late container process, in other words, can negatively affect the scheduling of the following ones. The purpose of the study is to analyze the lateness probability using a Bayesian network by considering various factors in container handling. We propose a method to generate a Bayesian network from a process model which can be discovered from event logs in port information systems. In the network, we can infer the activities’ lateness probabilities and, sequentially, provide to port managers recommendations for improving existing activities.