Article ID: | iaor20124242 |
Volume: | 63 |
Issue: | 1 |
Start Page Number: | 243 |
End Page Number: | 253 |
Publication Date: | Aug 2012 |
Journal: | Computers & Industrial Engineering |
Authors: | Wang Xiaojun, Yang Chunxia, Li Zhenfeng |
Keywords: | allocation: resources, combinatorial optimization |
This paper addresses an effective approach to solve the issue of berth allocation and quay crane assignment in a multi‐user container terminal. First of all, the studied coupling problem is formulated with the interactions between berth allocation and quay crane assignment considered. Then, an evolutionary algorithm with nested loops was developed to obtain optimal solutions. The algorithm is well structured, where two inner loops are used to solve sub‐problems of berth allocation and quay crane assignment respectively; an outer loop is then utilized to find an approximate solution based on the results of the two inner loops. The results of numerical experiments show that the proposed approach can improve the essential operations in container terminals.