Optimization of Makespan of Container Loading-Unloading Problem Using Mixed Integer Programming

Due to a substantial increase in world container turnover, container terminals are now an essential part of any transportation infrastructure. Trucks are widely used for moving goods between the quayside and the storage-yard. Determining the sequence of containers to be transported by trucks is a general problem encountered in terminal operations. This paper presents a mixed integer programming model for truck scheduling problem. This objective was to minimize the makespan for loading and unloading containers in the container terminal. The intent behind optimizing the makespan is (1) to reduce the waiting time of the trucks, (2) to cut down the operating costs, (3) to find the optimal number of trucks to be used for loading and unloading containers to and from trains and (4) to contribute towards improvement in the national economy. Using the processing time and travel time data obtained from Inland Container Depot (ICD), Tughlakabad, the truck scheduling problem at the container terminal was solved with the help of a model constructed with AMPL modeling language. Results clearly demonstrated the utility of optimization models in achieving greater container loading-unloading efficiency at container terminals.