The processing time of discharging container by truck is composed of travel time spent in the network and the time waiting for the service of yard cranes and quay cranes. The objective of this model is to reduce congestion and waiting time of each container, so that the time ships spent at the terminal can be reduced. It shows that the heuristic algorithm are better than those from the genetic algorithm.
However, from the operational point of view, they are highly interdependent.
If container is allocated to yard block far from its unloading ship, the waiting time will increase due to the limitation of mechanical performance of yard cranes. Truck scheduling and storage allocation problem is NPhard, genetic algorithm and greedy heuristic algorithm are designed to attain near optimal solutions. The processing time of discharging container by truck is composed of travel time spent in the network and the time waiting for the service of yard cranes and quay cranes.
It shows that the heuristic algorithm are better than those from the genetic algorithm.. The objective of this model is to reduce congestion and waiting time of container trucks in the terminal so as to decrease the makespan of discharging containers. This paper proposed an integer programming model handling these two problems as whole.
It shows that the heuristic algorithm are better than those from the genetic algorithm..
The objective of this model is to reduce congestion and waiting time of each container, so that the time ships spent at the terminal can be reduced. Truck scheduling and storage allocation, as two separate subproblems in port operations, have been deeply studied in past decades.





