Multi-AG Vs Scheduling with Vehicle Conflict Consideration in Ship Outfitting Items Warehouse  

作　　者：陈旖旎 蒋祖华 CHEN Yini;JIANG Zuhua(School of Mechanical Engineering,Shanghai Jiao Tong University,Shanghai 200240,China)

机构地区：[1]School of Mechanical Engineering,Shanghai Jiao Tong University,Shanghai 200240,China

出　　处：《Journal of Shanghai Jiaotong university(Science)》2024年第3期492-508,共17页上海交通大学学报（英文版）

基　　金：China Ministry of Industry and Information Technology for High-Tech Ship Project。

摘　　要：The inbound and outbound tasks for valuable imported ship outfitting items are operated by multiple automated guided vehicles(AGVs)simultaneously in the outfitting warehouse.Given the efficiency mismatch between transportation equipment and the lack of effective scheduling of AGVs,the objective of the studied scheduling problem is to minimize the total travel time cost of vehicles.A multi-AGV task scheduling model based on time window is established considering the loading constraints of AGVs and cooperation time window constraints of stackers.According to the transportation characteristics in the outfitting warehouse,this study pro-poses a conflict detection method for heavy forklift AGVs,and correspondingly defines a conflict penalty function.Furthermore,to comprehensively optimize travel time cost and conflict penalty,a hybrid genetic neighborhood search algorithm(GA-ANS)is proposed.Five neighborhood structures are designed,and adaptive selection opera-tors are introduced to enhance the ability of global search and local chemotaxis.Numerical experiments show that the proposed GA-ANS algorithm can effectively solve the problem even when the scale of the problem increases and the effectiveness of the vehicle conflict penalty strategy is analyzed.

关 键 词：ship outfitting items warehouse multi-AGVs scheduling time window hybrid algorithm 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]