An investigation into dynamic yard crane deployment and comparisons between hill-climbing and best-first-search algorithms

Authors:
Wei Yan;Youfang Huang;Junliang He
Affiliations:
Logistics Engineering School, Shanghai Maritime University, 1550 Pudong Avenue, Shanghai 200135, PR China.;Logistics Engineering School, Shanghai Maritime University, 1550 Pudong Avenue, Shanghai 200135, PR China.;Logistics Engineering School, Shanghai Maritime University, 1550 Pudong Avenue, Shanghai 200135, PR China
Venue:
International Journal of Computer Applications in Technology
Year:
2008

Citing 7
Cited 1

Artificial intelligence (3rd ed.)

Artificial intelligence (3rd ed.)
A class of convergent generalized hill climbing algorithms

Applied Mathematics and Computation
Rubber tired gantry crane deployment for container yard operation

Computers and Industrial Engineering
A decision support system for operations in a container terminal

Decision Support Systems
Mining maximal hyperclique pattern: A hybrid search strategy

Information Sciences: an International Journal
A general heuristic for vehicle routing problems

Computers and Operations Research
Optimal search strategies using simultaneous generalized hill climbing algorithms

Mathematical and Computer Modelling: An International Journal

An investigation into knowledge-based yard crane scheduling for container terminals

Advanced Engineering Informatics

Quantified Score

Hi-index	0.00

Visualization

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.