Dynamic rolling-horizon strategy for the electric trolley scheduling in frame bridge-based automated container terminals based on Hungarian algorithm Online publication date: Sat, 07-Feb-2015
by Junliang He; Weimin Zhang; Youfang Huang; Wei Yan
International Journal of Computer Applications in Technology (IJCAT), Vol. 50, No. 3/4, 2014
Abstract: Automated container terminal (ACT) is attracting more and more attentions. This paper mainly focuses on proposing an efficient approach for the electric trolley scheduling in frame bridge-based automated container terminals (FB-ACTs). An integer programming model is presented for electric trolley (ET) scheduling problem, where the objective function is subject to the minimisation of the makespan of all tasks. Furthermore, owing to computational intractability regarding ET scheduling, a heuristic algorithm based on Hungarian algorithm, which can guarantee to find the optimal solution in a short time in most cases, is then developed. Afterwards, dynamic rolling-horizon decision strategy is employed to implement the proposed heuristic algorithm. Finally, computational experiments are applied to verify the effectiveness and robustness of the proposed approach.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook