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:
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
id sg-ntu-dr.10356-79824
record_format dspace
spelling sg-ntu-dr.10356-798242020-05-28T07:18:29Z Performing A* search for yard crane dispatching in container terminals Guo, Xi Huang, Shell Ying School of Computer Engineering IEEE International Conference on Tools with Artificial Intelligence (20th : 2008 : Dayton, Ohio, US) DRNTU::Engineering::Computer science and engineering::Computer applications::Physical sciences and engineering DRNTU::Engineering::Maritime studies::Maritime science and technology 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. Accepted version 2011-07-04T01:18:05Z 2019-12-06T13:34:48Z 2011-07-04T01:18:05Z 2019-12-06T13:34:48Z 2008 2008 Conference Paper Guo, X., & Huang, S. Y. (2008). Performing A* search for yard crane dispatching in container terminals. 20th IEEE International Conference on Tools with Artificial Intelligence, 2008. ICTAI '08. https://hdl.handle.net/10356/79824 http://hdl.handle.net/10220/6839 10.1109/ICTAI.2008.77 136091 en © 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. http://www.ieee.org/portal/site This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. 5 p. application/pdf
institution Nanyang Technological University
building NTU Library
country Singapore
collection DR-NTU
language English
topic DRNTU::Engineering::Computer science and engineering::Computer applications::Physical sciences and engineering
DRNTU::Engineering::Maritime studies::Maritime science and technology
spellingShingle DRNTU::Engineering::Computer science and engineering::Computer applications::Physical sciences and engineering
DRNTU::Engineering::Maritime studies::Maritime science and technology
Guo, Xi
Huang, Shell Ying
Performing A* search for yard crane dispatching in container terminals
description 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.
author2 School of Computer Engineering
author_facet School of Computer Engineering
Guo, Xi
Huang, Shell Ying
format Conference or Workshop Item
author Guo, Xi
Huang, Shell Ying
author_sort Guo, Xi
title Performing A* search for yard crane dispatching in container terminals
title_short Performing A* search for yard crane dispatching in container terminals
title_full Performing A* search for yard crane dispatching in container terminals
title_fullStr Performing A* search for yard crane dispatching in container terminals
title_full_unstemmed Performing A* search for yard crane dispatching in container terminals
title_sort performing a* search for yard crane dispatching in container terminals
publishDate 2011
url https://hdl.handle.net/10356/79824
http://hdl.handle.net/10220/6839
_version_ 1681056566590046208