Integrated automated guided vehicle dispatching and equipment scheduling with speed optimization

The loading and unloading processes at quay and yard cranes are often studied separately, despite that integrated scheduling of the two processes could benefit in improving productivity and increasing profit. We consider an automated container terminal, in which the discharging and loading tasks at...

Full description

Saved in:
Bibliographic Details
Published inTransportation research. Part E, Logistics and transportation review Vol. 169; p. 102993
Main Authors Xing, Zheng, Liu, Haitao, Wang, Tingsong, Chew, Ek Peng, Lee, Loo Hay, Tan, Kok Choon
Format Journal Article
LanguageEnglish
Published Elsevier Ltd 01.01.2023
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:The loading and unloading processes at quay and yard cranes are often studied separately, despite that integrated scheduling of the two processes could benefit in improving productivity and increasing profit. We consider an automated container terminal, in which the discharging and loading tasks at quay and yard cranes are fulfilled by a homogeneous fleet of automated guided vehicles (AGVs), and the traveling speed of AGVs can be adjusted. We formulate the problem into a mixed integer programming model that minimizes the total makespan of cranes and energy consumption of AGVs simultaneously. To address the problem, we develop a three-phase approach, where the problem is firstly reformulated as a digraph, and then a adjusting heuristic and a branch-and-bound procedure are used to optimize the assignment of tasks to AGVs and yard cranes. After the aforementioned two steps, the speed optimization process is executed to obtain the final schedule. Numerical results demonstrate the efficiency and effectiveness of the proposed approach and also justify the value of taking account of the AGVs speed optimization. •Studying an integrated scheduling problem with variable vehicle speed at ports.•Reformulating the AGV dispatching problem as the format of directed graphs.•Proposing a modified bottleneck and branch&bound approach.
ISSN:1366-5545
1878-5794
DOI:10.1016/j.tre.2022.102993