PENGOPTIMALAN RUTE DALAM PENDISTRIBUSIAN ROTI DI PT. DAISEI LOG INDONESIA HUB CIKARANG MENGGUNAKAN METODE TRAVELLING SALESMAN PROBLEM (TSP) BRANCH AND BOUND

Abstract

PT Daisei Log Indonesia Hub Cikarang as a transportation and distribution company. In the distribution there is a problem that arises, namely the occurrence of late delivery of goods. This delay is caused by the mismatch of route taking by the driver and helper in making the delivery, the mismatch of this route is because the travel route is not determined to distribute from the company (there is no optimal route yet). To get the optimal route, a Traveling Salesman Problem (TSP) method is used. ) Branch and Bound, this method can be used with the help of software, the software used to solve this problem is WinQSB software. Completion of this method produces a different route, distance and travel time between without software and with software, the difference is that without using software produces a route with a total mileage of 231.12 km and a total travel time of 404 minutes (reducing the distance by 46% and time by 32%) while the WinQSB software generates routes with a total distance of 227.92 km and a total travel time of 387 minutes (decreases the distance by 47% and time by 35%).