This study is to develop a vehicle scheduling system for the efficient delivery of goods to places of business. For gathering data and testing the system developed, we have chosen a company which is located in Taegu city and has more than 700 delivery points over Taegu city and Kyungbuk province. We consider multiple vehicle types, travel time restrictions on vehicles, vehicle acceptance restrictions at delivery points, and other operational restrictions. We divide the whole delivery points into 44 regions and generate a region-based shortest path tree. Based on the shortest path tree, we perform vehicle assignment sequentially for each vehicle used. Then vehicle routings are determined. We have implemented the whole procedure on computer system. The system developed is flexible enough to be applicable to other companies by just changing the standard data.