Abstract
The demand for international seaborne trade has substantially increased over the last three decades and is predicted to continue increasing during the upcoming years. A marine container terminal, as an important node in supply chains, should be able to successfully cope with increasing demand volumes. Berth scheduling can significantly influence the general throughput of marine container terminals. In this study, a mixed-integer linear programming mathematical model is proposed for the berth scheduling problem, aiming to minimize the summation of waiting costs, handling costs, and late departure costs of the vessels that are to be served at a marine container terminal. An innovative Evolutionary Algorithm is designed to solve the developed mathematical model. The proposed solution algorithm relies on the augmented self-adaptive parameter control strategy, which is developed in order to effectively change the algorithmic parameters throughout the search process. Performance of the designed algorithm is evaluated against nine alternative state-of-the-art metaheuristic-based algorithms, which have been frequently used for berth scheduling in the marine container terminal operations literature. The results demonstrate that all the developed algorithms have a high level of stability and return competitive solutions at convergence. The computational experiments also prove superiority of the designed augmented self-adaptive Evolutionary Algorithm over the alternative algorithms in terms of different performance indicators.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.