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.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 46 (2010)
Issue (Month): 1 (January)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic|
When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:46:y:2010:i:1:p:136-155. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)
If references are entirely missing, you can add them using this form.