(515-3133-1-PB)A HYBRID SA ALGORITHM FOR INLAND CONTAINER TRANSPORTATION

摘要

Inland container transportation refers to container movements among customer locations, container terminals, and inland container depots in a local area. In this paper, we consider the inland transportation problem where containers are classified into four types according to the destination (inbound or outbound) and the container state (full or empty). In addition, containers can be delivered not only by truck but also by train when time windows are satisfied. We propose a graph model to represent and analyze the problem, and develop a mixed-integer programming model based on the graph model. A hybrid simulated annealing algorithm is proposed to obtain the near-optimal transportation schedule of containers. The performance of the proposed algorithm is investigated by numerical experiments.