An investigation into dynamic yard crane deployment and comparisons between hill-climbing and best-first-search algorithms
by Wei Yan, Youfang Huang, Junliang He
International Journal of Computer Applications in Technology (IJCAT), Vol. 32, No. 4, 2008

Abstract: Container terminals secure a crucial position in container transportation, including shipping and land transportation. In particular, container yard management, which involves diverse operational services, significantly affects the operational efficiency of the entire container terminal. However, it is imperative to attain an effective workload scheduling to support the dynamic deployment of yard cranes. Based on these understandings, the proposed system aims at postulating a novel strategy in terms of yard crane scheduling. In this manner, a dynamic allocation model is initially developed using integer programming for yard cranes. To resolve the NP-hard problem regarding the yard crane deployment, two heuristic algorithms, i.e., the hill-climbing algorithm and the best-first-search algorithm, are then employed. A case study on a specific container terminal yard is used for system illustration via a simulation approach. Consequently, comparisons are conducted based on the results obtained from the hill-climbing and best-first-search algorithms.

Online publication date: Fri, 21-Nov-2008

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email