A Tabu Search Algorithm for the Integrated Truck Scheduling and Storage Allocation in Quay

The integrated problem with truck scheduling and storage allocation presented in this paper considers the task of assigning containers to the truck and allocating containers to the block. For solving this problem, we propose a greedy heuristic that the discharging container is assigned to the truck which can transport it earliest and allocated to the block which the yard crane can unload it from the truck earliest. Based on this initial solution, an improved tabu search heuristic with diverse neighborhoods and diversification strategy is developed to obtain the solutions. The experimental results comparing with CPLEX show that the proposed mathematical model and the tabu search algorithm can obtain better solutions than CPLEX in an allowable time and resolve this problem more effectively.