پديدآورندگان :
Nasiri M.M Department, Faculty of Engineering,University of Tehran, Tehran, Iran , Sarmadi H hdsarmadi@ut.ac.ir Department, Faculty of Engineering,University of Tehran, International Campus-Kish Island, Iran , Akbarib S Department, Faculty of Engineering,University of Tehran, International Campus-Kish Island, Iran , Fayazi M Department, Faculty of Engineering,University of Tehran, International Campus-Kish Island, Iran
كليدواژه :
Container terminal operations, Yard truck scheduling, Storage allocation ,
چكيده فارسي :
The quay crane and yard truck scheduling is significant decision problems affecting the efficiency of container terminal operations. In this paper we provide a novel model that decomposes this problem into two storage allocation problems which one of them is storage allocation on yard and the other one is temporary storage allocation on the location of the quay crane by which the container is loaded onto the vessel. The objective is to minimize the weighted sum of total delay of requests and the total travel time of yard trucks. In spite of the intractability of the proposed model, we have solved that by GAMS, but we have to provide a useful algorithm at our coming studies to decrease the solving seconds. Finally, computational results are prepared to examine the key factors of the new provided model.
