Planning Logistics by Algorithm with VRPTWBD for Rice Distribution: A Case BULOG Agency in the Nganjuk District Indonesia

This paper addresses a vehicle routing problem with time windows encountered in BULOG (Government National Agency) specialized for distribution of rice with subsidy by government in Nganjuk East Java. It concern the delivery of rice with subsidy from central BULOG to home family that have been chosen by government as poor family in Nganjuk, delivery from central to warehouse, and from warehouse to government district also from district to village (the poor family target living). The problem can be considered as a special vehicle routing problem with time windows, with bender’s decomposition as solver to minimize the total cost of distribution with still consider about time delivery and total of vehicle used. Each village is visited by more than one vehicle at one time delivery. Two mixed-integer programming models are proposed. We then proposed a Genetics Algorithm (GA) and exact method of VRPTWBD, and these approaches are tested with compare the result from four experiments with real data from BULOG, such as: Exact VRPTW, exact VRPTW-BD, Naïve GA, and Genetics Algorithm-BD.