基于深度学习的散货船舶调度优化算法

为提升船舶停泊运行的时效性,提出基于深度学习的散货船舶调度优化算法。首先,制定散货船舶的进出作业流程,分析船舶调度作业的影响因素;其次,利用深度学习算法优化船舶调度,并提出调度方案;最后,进行实验分析。实验结果表明,该算法能够有效节约散货船舶在港口等待调度的准备时间,优于对照组。     

基于遗传算法的港口设备事后维修的单机调度

针对港口设备在损坏后的维修调度问题,即事后维修的调度问题,通过对港口设备的事后维修调度安排进行分析,建立维修设备的调度模型。模型中使用BP神经网络算法来量化港口待维修设备的权值,并利用遗传算法来最小化维修作业任务的总加权完成时间,获得优化后的维修调度顺序和相对应的维修时间安排。通过港口吊具设备的维修算例,展示了优化的调度模型在港机设备中的运用,模型明确了港机的维修顺序,并在保证维修任务完成的情况下节约了维修时间,为港口设备维修计划提供参考。     

车间作业调度问题的仿真研究

研究车间作业调度优化问题,使资源、车辆调试、交通分配等达到优化配置,因此车间作业调度问题是一个多约束条件的目标优化问题,采用多项式求解方法不能获得最优解,导致车间作业调度效率低.为了提高车间作业调度效率,提出了一种蚁群算法的车间作业调度优化算法.首先以最小加工时间作为优化目标,蚂蚁爬行路径为作业调度方案,通过蚁群中个体间互相协作和信息交流获得最优车间作业调度方案.通过车间作业调度测试案例对算法进行验证性实验,实验结果表明,蚁群算法提高了车间作业调度效率,能在最短时间找到最优调度方案,为车间作业调度优化提供了依据.     

考虑客户满意度的灾后多港口泊位联合应急调度模型

随着经济的飞速发展,港口在经济活动中扮演的角色也变得越来越重要,近些年全国各地发生很多港口突发事件,使港口正常作业受到了严重的影响,对港口群的灾后应急调度也提出了新的挑战。针对港口事件的突发性特点和港务集团港口的网络集群特点,建立了以调度成本最小,船舶调度时间最短为目标的多目标优化模型。根据模型设定两个调度方案,应用遗传算法对方案进行求解,结合实际算例对模型和算法的有效性进行验证,并结合客户满意度指数选择最优方案。此模型能够从不同的方案中选择最佳方案,从而提高港口群的竞争优势,更符合港口发展的长远利益。     

基于自适应蚁群算法的JSP问题仿真研究

研究车间作业调度优化问题,以实现资源优化配置。针对提高生产效率,缩短周期,降低成本,传统蚁群算法应用于JSP(车间作业调度问题)易出现停滞和陷入局部最优,以致作业调度效率低。为改善传统蚁群算法在车间作业调度的状况,提高车间作业调度效率,提出一种基于自适应蚁群(AACA)优化的车间作业调度算法模型。算法在基本蚁群算法中引入一种新的自适应机制,用于车间作业调度中。AACA在迭代初期快速搜索,可对后期精细寻优,克服了传统调度算法搜索JSP最优解时出现的收敛速度慢、精度不高的缺陷,对照实例进行仿真。仿真结果表明,采用的AACA调度算法在迭代100次以内能找到最优解或满意解,收敛速度快,精度高,优于传统的调度方法 GA、SA和SB,提高了作业调度效率,验证了AA-CA在实际生产中的有效性和实用性。     

云计算平台下基于近似ε-约束的多目标作业调度优化算法

针对云计算中平台主机之间工作负载分布的作业调度问题,本文提出了一种基于近似ε-约束的优化算法。首先,将作业调度问题建模为一个数学决策模型;然后,求出模型的可行工作调度集;最后,利用ε-约束算法获得每个单目标模型的帕累托前沿,从而优化作业的总平均等待时间、最长工作调度中作业的平均等待时间(如调度跨度)和所需的主机数目。实验通过建立实例将本文算法与传统的加权和(WS)算法进行比较,实验结果表明,本文算法找到的非支配解平均数比WS算法多77.8%,且更具多样化,优化了同构云计算平台中多目标作业调度问题。     

基于群智能算法的自动化码头协同调度研究

为了提高码头作业效率和服务水平,保障港口在激烈竞争中的生存和发展,研究自动化码头自动引导车、岸桥和自动化轨道吊的协同调度问题,根据边装边卸作业模式,建立混合整数规划模型,以完成船舶装卸时间最小化为目标,利用群智能算法中多种算法进行求解,通过数值实验证明了该模型的有效性,获得优化的调度方案,并对不同算法的性能进行比较,结果表明启发式的混合遗传粒子群算法能够在最短的时间内获得最优解,其在求解的质量和速度方面都表现得更为优秀,可以应用于码头的实际作业中。     

基于量子遗传混合算法的泊位联合调度

为了提高集装箱港口服务效率,减少船舶服务的拖期费用,针对港口硬件（泊位、拖轮、岸桥）既定条件下的拖轮-泊位联合调度问题,新建了以最小化总体船舶在港时间和总拖期时间为目标的数学模型,设计了一种混合算法进行求解。首先,分析确定了将量子遗传算法（QGA）和禁忌搜索（TS）算法进行串行混合的策略;然后,依据该联合调度问题特点,在解决算法实施中的关键技术问题（染色体结构设计和测量、遗传操作、种群更新等）的同时,采用了动态量子旋转门更新机制;最后,用生产实例验证了算法的可行性及有效性。算法实验结果表明,与人工调度结果相比,混合算法的总体船舶在港时间和总拖期时间分别减少了24%和42.7%;与遗传算法结果相比,分别减少了10.9%和22.5%。所提模型及算法不仅能为港口船舶的入泊、离泊和装卸作业环节提供优化作业方案,而且能增强港口竞争力。     

多目标军用飞机维修作业调度优化研究

为提升维修作业与现代战机的适应程度,对军用飞机维修作业调度模型构建与调度优化算法设计进行探讨。在沿用柔性作业车间调度问题的形式化描述构建维修作业调度模型的基础上,选取遗传算法对执行步骤进行设计,引入耦合算子重新调整工序排序部分染色体以避免染色体违背耦合约束无法解码的情况发生,并采用维修作业调度案例与Brandimarte测试数据验证多目标调度优化算法的适用性与优化性。维修作业调度模型构建与调度优化算法的探讨促进维修管理的精细化,为调度相关领域的深入研究拓宽思路。     

基于粒子群优化和禁忌搜索的混合调度算法

提出了用于解决作业车间调度问题的离散版粒子群优化算法。该算法采用基于先后表编码方案和新的位移更新模型,使具有连续本质的粒子群优化算法直接适用于车间调度问题。同时,利用粒子群优化算法的全局搜索能力和禁忌搜索算法的自适应优点,将粒子群优化算法和禁忌搜索结合起来,设计了广义粒子群优化算法和粒子群—禁忌搜索交替算法两种混合调度算法。实验结果表明,两种混合调度算法能够有效地、高质量地解决作业车间调度问题。     

基于蚁群算法的泊位调度优化与仿真

在全球贸易经济聚焦在中国的同时,港口的吞吐能力成为目前港口业的主要矛盾。提高泊位这个环节的运作能力,减少船舶在港时间,增加港口的吞吐能力成为主要研究对象。本文采取仿真模型与优化算法相结合的研究方法,把泊位调度问题转化为旅行商问题,建立了一个泊位岸桥协调调度,通过蚁群算法建立数学模型,使船舶在港时间最短为目标建立函数,求得最佳调度方案。用ProModel建立船舶到港停泊及离港仿真模型。验证泊位调度优化的有效性,以便指导港口实际的泊位调度。     

An optimization-based decision support system for ship scheduling

The bulk carriers in the world merchant fleet typically operate full between a loading and discharging port, then run empty until they reach the next loading port. The shipping rates of bulk trades are set on supply/demand bases and fluctuate considerably. Thus the proper scheduling of ships in bulk trade has the great potential of improving the owner's profit and economic performance of shipping. This paper considers an optimization-based Decision Support System for ship scheduling. The typical optimization models for scheduling the ships are briefly reviewed and classified by the underlying idea. Then a prototype MoDiSS(Model-based SS in Ship Scheduling) which is based on a set-packing model has been developed on PC base with proper GUI. The performance of the system has been tested and examined using various ship scheduling scenarios and thereby the effectiveness of the system is validated satisfactorily.     

A hierarchical expert system for integrated scheduling of ship berthing, discharging and material transport

Abstract: Berthing ships at a port and unloading the stowed materials require a series of scheduling problems: ship berthing, discharging, and material transport. To deal effectively with the scheduling complexity due to mutual interdependence among those problems, this paper proposes a two-level hierarchical architecture for the integrated scheduling of all the activities arising in port. The hierarchical architecture assigns ships to multiple lower level dispatchers, each of which makes its own discharging and material transport schedule independently while satisfying the requirements imposed by the higher level coordinator. If any problem occurs within a dispatcher, the higher level coordinator attempts to resolve the trouble through the coordination of other dispatchers. Based on the hierarchical architecture, a prototype scheduling expert system is developed using G2 for the port scheduling problem at a steelworks. Through the object- oriented interaction of frames, the system is shown to effectively construct integrated schedules from the berth scheduling to the material transport scheduling.     

A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning

A considerable growth in worldwide container transportation needs essential optimization of terminal operations. An operation schedule for berth and quay cranes can significantly affect turnaround time of ships, which is an important objective of all schedules in a port. This paper addresses the problem of determining the berthing position and time of each ship as well as the number of quay cranes assigned to each ship. The objective of the problem is to minimize the sum of the handling time, waiting time and the delay time for every ship. We introduce a formulation for the simultaneous berth and quay crane scheduling problem. Next, we combine genetic algorithm with heuristic to find an approximate solution for the problem. Computational experiments show that the proposed approaches are applicable to solve this difficult but essential terminal operation problem.     

双向航道集装箱港口船舶调度优化算法

针对拥有双向航道的集装箱港口中船舶进出港所遇到的会遇和追越等问题,提出了一种重点考虑服务规则的新型船舶调度优化算法。首先,同时考虑双向航道的现实约束和港口夜航的安全规定;然后,构建了以所有船舶在港总等待时间最小为目标的混合整数规划模型来得出最佳的船舶进出港次序;最后,设计了嵌入聚合策略的分支切割算法对模型进行求解。通过数值实验可知,运用嵌入聚合策略的分支切割算法所得结果与下界值的平均相对偏差为2.59%。同时,与模拟退火算法与量子差分进化算法的对比结果表明,所提的分支切割算法所得的目标函数值相较于两个对比算法所得目标函数值分别减少了23.56%和17.17%,验证了该算法的有效性。在用所提算法得到方案的敏感性分析中比较了不同抵港安全时间间隔和船舶类型比例对方案结果的影响,为双向航道集装箱港口的船舶调度优化提供了决策支持。     

Disruption management-based coordinated scheduling for vessels and ship loaders in bulk ports

For ensuring the orderly operation of the port, it is vital to coordinately schedule available ship loaders and vessels that plan to enter and exit the port when ship loaders are unable to work due to faults. Therefore, this paper studies the coordination between vessels and ship loaders scheduling problem affected by failed ship loaders (VSLPB), and proposes a novel disruption management-based method to address this problem. An innovative optimization model is developed to reduce the generalized cost with the constraints of disruption management strategies (DMS), aiming to minimize the impact of failed ship loaders on the coordinated scheduling and the bulk cargo handling efficiency. For solving the VSLPB, an effective two-stage row generation (TSRG) algorithm is developed. In the first stage, the disruption conditions in the model are released to find the available ship loaders and berths for vessels affected by the failure factors. In the second stage, the optimal strategy is sought among multiple DMS to minimize the objective function value. Using the proposed method in Huanghua Coal Port as a case study, the results show that our method can effectively solve the impact of ship loader failure on the efficiency of bulk cargo handling and the efficiency of vessels entering and leaving the port. These further highlights the importance of implementing DMS, and show that the proposed method can provide an efficient and reliable solution for port production and operation to deal with disruption problems. Furthermore, the proposed method in this paper can help improve the ability of the port to resist uncertain factors, thus improving the ability of the entire supply chain to resist risks.     

考虑恶劣天气的班轮多阶段重调度方法

受恶劣天气影响的船舶调度是一个非常复杂的优化问题,也是班轮公司重点关注的问题之一。为此,针对某航运网络上的一家班轮公司的所有营运船舶,以获知设计的多阶段重调度机制时段内最新预报的天气信息和这些船舶的实时位置为前提,重点考虑班轮船期表的限制并兼顾港口间航速变化和船舶容量等现实约束,构建了以固定计划期内所有船舶的航运总成本最小为优化目标的非线性数学模型,并设计了嵌入基因修复算子的改进遗传算法用于求解该模型。由此,可以给出集成租船直运、跨航线调船、反挂和货物中转等解决策略的最佳多阶段重调度方案。通过对大、中、小规模的算例进行实验,实验结果表明,可知与传统等待办法相比,多阶段重调度节约了总航运成本的15%以上,验证了所提模型和方案的有效性;与Cplex相比,改进遗传算法的运算效率大大提高,且偏差值均在5%以内,而与蚁群优化（ACO）算法、禁忌搜索（TS）算法、量子差分进化（QDE）算法相比,改进遗传算法能在有效时间内降低10%左右的成本,验证了算法的科学性。所提方法可为班轮公司的实际船舶调度提供参考。     

单向航道下连续泊位分配与船舶调度集成优化

为改善单向航道连续泊位港口的运营效率,研究泊位分配与船舶进出港调度集成优化.考虑潮汐、进出港时段交替与偏好泊位的影响,建立0-1整数线性规划模型,以船舶偏离偏好泊位成本和滞期成本为优化目标,确定各艘船舶的靠泊位置与进出港时刻.针对问题情境和其特有的约束条件,将原数学模型通过Dantzig-Wolfe分解方法分成主问题模...     

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.