Performing A* search for yard crane dispatching in container terminals

Performing A* search for yard crane dispatching in container terminals

We address the problem of dispatching a yard crane in its appointed zone of a container terminal. The objective of yard crane dispatching is to determine a sequence for handling all coming jobs within the zone that minimizes the average vehicle waiting time. We propose 2 modified A* search algorithm...

Full description

Saved in:
Bibliographic Details
Main Authors: Guo, Xi, Huang, Shell Ying
Other Authors: School of Computer Engineering
Format: Conference or Workshop Item
Language:English
Published: 2011
Subjects:
DRNTU::Engineering::Computer science and engineering::Computer applications::Physical sciences and engineering
DRNTU::Engineering::Maritime studies::Maritime science and technology
Online Access:https://hdl.handle.net/10356/79824
http://hdl.handle.net/10220/6839
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Description
Summary:We address the problem of dispatching a yard crane in its appointed zone of a container terminal. The objective of yard crane dispatching is to determine a sequence for handling all coming jobs within the zone that minimizes the average vehicle waiting time. We propose 2 modified A* search algorithms with admissible heuristics to provide fast and optimal dispatching solution. Simulation results show that the algorithm using the improved heuristic is able to find the optimal solution over 2.4 times 1018 possible dispatching sequences in about 3 to 4 seconds under heavy work load.

Similar Items