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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computer Applications in Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
