The importance of efficient container transportation becomes more significant each year due to the constant growth of the global marketplace, and studies focusing on shipping efficiency are becoming increasingly important. In this paper, we propose an approach for vehicle scheduling that decreases the number of vehicles required for freight commerce by analyzing and scheduling optimal routes. Container transportation can be classified into round and single-trip transportation, and each vehicle can be linked in a specific order based on the vehicle state after completing an order. We develop a mathematical model to determine the required number of vehicles with optimal routing, and a heuristic algorithm to perform vehicle scheduling for many orders in a significantly shorter duration. Finally, we tested some numerical examples and compared the developed model and the heuristic algorithm. We also developed a decision support system that can schedule vehicles based on the heuristic algorithm.