A Hybrid Parallel Genetic Algorithm for Yard Crane Scheduling

This paper aims at postulating a novel strategy in terms of yard crane scheduling. In this study, a dynamic scheduling model using objective programming for yard cranes is initially developed based on rolling-horizon approach. To resolve the NP-complete problem regarding the yard crane scheduling, a hybrid algorithm, which employs heuristic rules and parallel genetic algorithm (PGA), is then employed. Then a simulation model is developed for evaluating this approach. Finally, numerical experiments on a specific container terminal yard are used for system illustration. Computational results suggest that the proposed method is able to solve the problem efficiently.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01144725
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Nov 5 2009 9:40AM