Article ID: | iaor20164858 |
Volume: | 50 |
Issue: | 4 |
Start Page Number: | 1300 |
End Page Number: | 1313 |
Publication Date: | Nov 2016 |
Journal: | Transportation Science |
Authors: | Lee Der-Horng, Cao Jin Xin, Jin Jian Gang |
Keywords: | inventory: storage, combinatorial optimization, programming: integer |
This paper studies the daily storage yard manage problem arising in maritime container terminals, which integrates the space allocation and yard crane deployment decisions together with the consideration of container traffic congestion in the storage yard. The integrated problem is formulated as an integer linear programming model with the objective of minimizing the yard crane operating cost and the yard crane interblock movement cost. A divide‐and‐conquer solution approach is designed to solve the problem in an efficient manner in which harmony search and constraint satisfaction techniques are employed. Numerical experiments are conducted to validate the performance of the solution approach and the improvement from the integrated optimization method.