Hungarian Method and Branch and Bound Method for Solving Travelling Salesman Problem in Interval Number in Rice Distribution

Abstract

The aim of this research is to minimize the travel time costs for transport cars starting from the warehouse in the sub-district, and delivering rice to 6 sub-districts in Pekanbaru only once and the transport car returning to the warehouse location. Minimizing travel time costs is carried out using the Hungarian method and the Branch and Bound method to solve the traveling salesman problem in interval numbers. The traveling salesman problem has interval costs because it depends on several obstacles experienced by the salesman, for example travel traffic constraints, transportation conditions, weather, and other costs. Then convert the interval numbers into trapezoidal fuzzy numbers using the fuzzification method. The results of the analysis show that using the Hungarian method and the Branch and Bound method to solve the traveling salesman problem at interval numbers can provide an optimal travel route for visiting 6 sub-districts in Pekanbaru using rice transport cars. This optimal route is expected to minimize costs and also save transportation time in rice distribution activities to the 6 sub-districts.