自动化集装箱码头岸边集装箱起重机与自动导引车协同调度研究  

Research on joint dispatching of quay crane and AGV in automated container terminal

作　　者：吴晓晓 吴敬兵[1] Wu Xiaoxiao;Wu Jingbing

机构地区：[1]武汉理工大学,武汉430070

出　　处：《起重运输机械》2022年第5期35-42,共8页Hoisting and Conveying Machinery

摘　　要：自动化港口码头中双小车岸边集装箱起重机、自动导引车和双自动堆垛起重机的联合调度一直是影响码头整体运作的关键问题。文中以自动化集装箱码头集装箱和装卸及运输设备为研究对象,建立了以最小化所有集装箱的最大完工时间和最小化自动导引车行驶距离为目标的双层混合整数规划模型。为求解该模型,文中研究比较了遗传算法和禁忌搜索算法求解,结果表明:禁忌搜索遗传算法对于自动化港口的调度非常有效,证明了模型的实用性和有效性。In the automatic port terminal,the joint dispatching of quay cranes with double vehicles,automatic guided vehicles and double ASCs has long been deemed as a key problem.Taking the containers as well as loading,unloading and transportation equipment of the automated container terminal as the research objects,a mixed integer bilevel linear programming model was established to minimize the longest completion duration of all containers and the operating range of AGV.To solve the model,the solving process of genetic algorithm and tabu search algorithm was studied and compared.Results show that tabu search genetic algorithm is very effective for dispatching in automatic ports,proving the practicability and effectiveness of the model.

关 键 词：自动化集装箱码头 自动导引车 双层混合整数规划模型 遗传算法 联合调度 

分 类 号：TH24[机械工程—机械制造及自动化] U653.921[交通运输工程—港口、海岸及近海工程]