Deciding on planning windows by partitioning time for yard crane management in container terminals
This paper proposes a new dynamic Yard Crane (YC) workload partition scheme in container terminals. The main contribution is the time partitioning algorithm which finds a sequence of time windows to match closely the changing...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Language: | English |
| Published: |
2011
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/93901 http://hdl.handle.net/10220/7080 http://gauss.econ.uni-hamburg.de/iccl2010/index.html |
| _version_ | 1826124855836147712 |
|---|---|
| author | Guo, Xi Huang, Shell Ying |
| author2 | School of Computer Engineering |
| author_facet | School of Computer Engineering Guo, Xi Huang, Shell Ying |
| author_sort | Guo, Xi |
| collection | NTU |
| description | This paper proposes a new dynamic Yard Crane (YC) workload partition
scheme in container terminals. The main contribution is the time partitioning
algorithm which finds a sequence of time windows to match closely the changing
workload distribution and get the maximum benefit of the space partition algorithm.
Experimental results show that the proposed time partition algorithm plays the most
important role in making substantial improvements over basic partition scheme in all
tested workload scenarios. |
| first_indexed | 2024-10-01T06:27:11Z |
| format | Conference Paper |
| id | ntu-10356/93901 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T06:27:11Z |
| publishDate | 2011 |
| record_format | dspace |
| spelling | ntu-10356/939012020-05-28T07:17:28Z Deciding on planning windows by partitioning time for yard crane management in container terminals Guo, Xi Huang, Shell Ying School of Computer Engineering International Conference on Computational Logistics (1st : 2010) DRNTU::Engineering::Computer science and engineering::Computer applications::Physical sciences and engineering This paper proposes a new dynamic Yard Crane (YC) workload partition scheme in container terminals. The main contribution is the time partitioning algorithm which finds a sequence of time windows to match closely the changing workload distribution and get the maximum benefit of the space partition algorithm. Experimental results show that the proposed time partition algorithm plays the most important role in making substantial improvements over basic partition scheme in all tested workload scenarios. Accepted version 2011-09-16T06:23:20Z 2019-12-06T18:47:25Z 2011-09-16T06:23:20Z 2019-12-06T18:47:25Z 2010 2010 Conference Paper Guo, X., & Huang, S. Y. (2010). Deciding on Planning Windows by Partitioning Time for Yard Crane Management in Container Terminals. Proceedings of the 1st International Conference on Computational Logistics. https://hdl.handle.net/10356/93901 http://hdl.handle.net/10220/7080 http://gauss.econ.uni-hamburg.de/iccl2010/index.html 155808 en © 2010 1st International Conference on Computational Logistics. This is the author created version of a work that has been peer reviewed and accepted for publication by 1st International Conference on Computational Logistics. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The official conference website is: http://gauss.econ.uni-hamburg.de/iccl2010/index.html. 10 p. application/pdf |
| spellingShingle | DRNTU::Engineering::Computer science and engineering::Computer applications::Physical sciences and engineering Guo, Xi Huang, Shell Ying Deciding on planning windows by partitioning time for yard crane management in container terminals |
| title | Deciding on planning windows by partitioning time
for yard crane management in container terminals |
| title_full | Deciding on planning windows by partitioning time
for yard crane management in container terminals |
| title_fullStr | Deciding on planning windows by partitioning time
for yard crane management in container terminals |
| title_full_unstemmed | Deciding on planning windows by partitioning time
for yard crane management in container terminals |
| title_short | Deciding on planning windows by partitioning time
for yard crane management in container terminals |
| title_sort | deciding on planning windows by partitioning time for yard crane management in container terminals |
| topic | DRNTU::Engineering::Computer science and engineering::Computer applications::Physical sciences and engineering |
| url | https://hdl.handle.net/10356/93901 http://hdl.handle.net/10220/7080 http://gauss.econ.uni-hamburg.de/iccl2010/index.html |
| work_keys_str_mv | AT guoxi decidingonplanningwindowsbypartitioningtimeforyardcranemanagementincontainerterminals AT huangshellying decidingonplanningwindowsbypartitioningtimeforyardcranemanagementincontainerterminals |