A Three Stage Optimal Scheduling Algorithm for AGV Route Planning Considering Collision Avoidance under Speed Control Strategy

Author:

Liang Chengji,Zhang Yue,Dong Liang

Abstract

With the trend of terminal automation and the requirement for port operation efficiency to be greatly improved, it is very necessary to optimize the traveling route of automatic guided vehicles (AGV) with reference to the connection of loading and unloading equipment. As a complex multi-equipment system, it is inevitable that AGV will collide when traveling due to various accidents in actual operation, which will lead to AGV locking and reduce the efficiency of terminal operation. Considering the locking problem of AGV, we propose a three-stage integrated scheduling algorithm for AGV route planning. Through joint optimization with quay cranes (QC) and yard blocks, a road network model is established in the front area of the container port to optimize the path of AGV in the road network, and a speed control strategy is proposed to solve the problem of AGV collision avoidance. In the first stage, we establish the AGV optimal route model with the goal of minimizing the AGV path according to the AGV road network situation. In the second stage, on the basis of the determination of AGV route planning, and when the container task is known, the AGV task assignment model is established with the goal of minimizing the maximum completion time, and the model is solved by genetic algorithm (GA). In the third stage, on the basis of AGV task assignment and route determination, the AGV route and AGV task assignment scheme are input into the simulation model by establishing the AGV collision avoidance control model for speed control, and establishing the AGV route network simulation model for automated terminals considering collision avoidance in plant simulation software. The maximum completion time obtained from the simulation model is compared with the completion time obtained from the genetic algorithm. The proposed three-stage joint scheduling algorithm can improve the loading and unloading efficiency of the port, reduce the AGV locking situation, and has a certain contribution to the formulation of the actual operation planning of the port.

Funder

National Social Science Fund of China

National Key Research and Development Plan of China

Soft Science Research Project of Shanghai Science and Technology Innovation Action Plan

Publisher

MDPI AG

Subject

General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)

Reference21 articles.

1. (2022, October 23). Review of Maritime Transport 2021|UNCTAD. Available online: https://unctad.org/webflyer/review-maritime-transport-2021.

2. A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning;Liang;Comput. Ind. Eng.,2009

3. Optimal Port Microgrid Scheduling Incorporating Onshore Power Supply and Berth Allocation Under Uncertainty;Zhang;Appl. Energy,2022

4. Scheduling and routing algorithms for AGVs: A survey;Qiu;Int. J. Prod. Res.,1999

5. Yard crane and AGV scheduling in automated container terminal: A multi-robot task allocation framework;Chen;Transp. Res. Part C Emerg. Technol.,2020

Cited by 14 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3