Conflict-free container routing in mesh yard layouts

Authors:
Jianyang Zeng;Wen-Jing Hsu
Affiliations:
Nanyang Technological University, Nanyang Avenue, Singapore 639798, Singapore;Nanyang Technological University, Nanyang Avenue, Singapore 639798, Singapore
Venue:
Robotics and Autonomous Systems
Year:
2008

Citing 2
Cited 2

Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Design, simulation, and evaluation of automated container terminals

IEEE Transactions on Intelligent Transportation Systems

Scheduling and routing of AMOs in an intelligent transport system

IEEE Transactions on Intelligent Transportation Systems
Rescheduling policies for large-scale task allocation of autonomous straddle carriers under uncertainty at automated container terminals

Robotics and Autonomous Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Container terminals play an important role in global cargo transportation and they have become an essential intermodal interface between the sea and the land. In the container terminal, the service area is often arranged into rectangular blocks, which leads to a mesh-like path topology. We present a mathematical model for general container routing in mesh yard layouts. Based on this model, a simple container routing algorithm guaranteeing freedom of conflicts is then presented. The algorithm works by carefully choosing suitable containers' speeds such that the containers using the same junction will arrive at different points in time, and hence incur no conflicts; meanwhile, high routing performance can be achieved. The task completion time and the requirements on timing control during the container routing are also presented. Numerical results verify that our routing scheme has good performance and is free of conflicts.