摘要：The Vehicle Routing can arranged using Fisher and Jai r Algorithm. This paper aimed to solve vehicle routing problem at PT. XYZ wherever e decision parameter is the “total delivery cost”. If total delivery cost “ of the research is lower than total delivery cost of the factory, deliver schedule can be arranged. This research result in 13 routes with lower delivery cost than of the factory’s more than 8%. Beside that, the method can minimize the lack of vehicle capacity in every route. Delivery schedule also can manage the use of vehicle more optimally so that increase vehicle’s utilization.
关键词：Fisher and Jaikumar, Vehicle Routing Problem, total delivery cost
