Vehicle routing problem is one of the most importantissues that need to be overcome. By transporting peopleor products from one place to another place, we need toplan a vehicle routing systematically so that transportationcost and time can be reduced. This research project usessweep algorithm and 2 opt exchange as a classicalheuristics to solve the vehicle routing problem of anexemplary case of transportation management at theUniversity of the Thai Chamber of Commerce, Bangkok,Thailand. The main objective of the sweep algorithm is toassort pick-up and drop-off points by consideration acoordination (X, Y) being plotted in a map. On the otherhand, the second method (the 2 opt exchange) is one ofthe improvement heuristics methods that is used toinvestigate how to switch pick-up and drop-off pointsresulting in a reduction of routing number andtransportation time. The benefit of this project is todevelop a simulation of the vehicle routing of BusScannia and Bus BMC in order to maximize a number ofuniversity employees using these buses. Furthermore, theresearch may benefit from the development of the vehiclerouting simulation that can be used in a scope of logisticssystem in which products is conveyed with low cost oftransportation and high customer satisfaction.