A dry bulk terminal acts as a multi-modal interface for transhipping iron ores. Stacker-reclaimers are the dedicated equipments in storage yard for iron ore handling. Both unloading and loading processes are supported by stacker-reclaimers in most cases. The operation efficiency of dry terminals heavily depends on the productivity of stacker-reclaimers. This paper discusses the stacker-reclaimer scheduling problem with the objective of minimising the maximum completion time. The scheduling problem is formulated as a mixed integer programming model, and a lower bound for it is introduced. Using two types of chromosome representations and related operators, genetic algorithms are developed for solving the considered problem since it is NP-hard in nature. Computational experiments are carried out to compare and evaluate the performances of the proposed genetic algorithms. Computational results show that the one-string chromosome presentation with greedy assignment strategy performs better than the existing two-string chromosome presentation in the implementation of genetic algorithms.View full textDownload full textKeywordsdry bulk terminal, stacker-reclaimer scheduling, lower bound, genetic algorithmRelated var addthis_config = { ui_cobrand: "Taylor & Francis Online", services_compact: "citeulike,netvibes,twitter,technorati,delicious,linkedin,facebook,stumbleupon,digg,google,more", pubid: "ra-4dff56cd6bb1830b" }; Add to shortlist Link Permalink http://dx.doi.org/10.1080/0951192X.2012.684707
展开▼
