We study a deterministic storage yard management problem which jointly determines storage space allocation and yard crane assignment. The problem is first formulated as an integer grogram to minimize the total operational cost. To solve large-scaled problems, we then transform it to a set partitioning formulation and provide a framework of branch-and-price algorithm. Computational experiments to explain the performance of the solution approach are to be further conducted.
['Ming Liu', 'Lujun Xu', 'Chengbin Chu', 'Feng Chu']
Framework branch-and-price algorithm for yard management problem at container terminals