At the present time, container transportation plays a key role in the international logistics. The efforts to increase the productivity of container logistics become essential for Korean trucking companies to survive in the domestic as well as global competition. This paper deals with VRP(Vehicle Routing Problem) of delivering container in Korean trucking industries. We examine the various characteristics of container transportation and then propose the mathematical models considering them. Several types of formulations are developed utilizing the standard formulations of well known TSP(Traveling Salesman Problem) and VRP. Heuristic algorithms and Tabu Search are also presented to solve the models. Efficiency of the proposed algorithms is verified through computational experiments.