AbstractThis 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.
A hybrid parallel genetic algorithm for yard crane scheduling
Transportation Research Part E: Logistics and Transportation Review ; 46 , 1 ; 136-155
2009-07-11
20 pages
Article (Journal)
Electronic Resource
English
A hybrid parallel genetic algorithm for yard crane scheduling
Online Contents | 2010
|A hybrid parallel genetic algorithm for yard crane scheduling
Online Contents | 2010
|The integrated yard truck and yard crane scheduling problem: Benders’ decomposition-based methods
Online Contents | 2010
|