TRAVELLING SALESMAN PROBLEM ANALYSIS WITH COMPLETE ENUMERATION METHOD, BRANCH & BOUND AND GREEDY HEURISTIC

PT XYZ as the best and largest Bed Sheet Set company in Indonesia with products such as Bed Covers, Bed Sheets, Pillowcases, Bolsters and Blankets. The Traveling Salesman Problem (TSP) is a problem faced in finding the best route to visit shops that sell products from PT BIG. A visit to the shop is carried out on the condition that each city can only be visited once except the city of origin. The algorithms applied in this TSP problem include the Complete Enumeration, Branch & Bound and Greedy Heuristic methods.


INTRODUCTION
PT XYZ, a company engaged in garments, especially the largest Bed Sheet Set & Bed Cover in Indonesia with product brands A and B (Faisal, Hardianto, Dwichwanto, & Septiana, 2021).These products are widely used by every community and have been spread in several big cities such as Subang, Sukabumi, Bogor and Bandung (Firman, Herlina, Paturochman, & Sulaeman, 2018).In the process of distributing products in each city, human labor is needed, one of which is through Sales Promotion (Susanto & Sunardi, 2017).Sales Promotion offers products to stores in big cities to sell products to consumers (Larissa, Yuwono, & Mardiono, 2017) city has obstacles in delivery with the distance from the city far enough (Chandra & RAHARDJO, 2013) so that the delivery of goods takes quite a long time (Putra, Nyoto, & Pratiwi, 2017).If product delivery takes a long time, it will result in delayed product delivery (Miradji, 2014) and product marketing cannot be done quickly (Toyib, Onsardi, & Muntahanah, 2020).For this reason, the company must be able to develop a plan to be able to create inter-city routes (Zulfikar, Mayvita, & Purboyo, 2019) that can minimize delivery time by arranging product delivery routes (Karundeng, Mandey, & Sumarauw, 2018).So that product marketing can be done effectively (Artaya & Purworusmiardi, 2019).The problem that will be discussed is that there is no optimal delivery route (Tanujaya, Dewi, & Endah, 2013) with the minimum total distance or cost and determining the best route (Muhammad, Bakhtiar, & Rahmi, 2017).Determination of delivery routes using Complete Enumeration, Branch & Bound and Greedy Heuristic methods.

RESULTS AND DISCUSSION
PT. XYZ will assign Sales Promotion to visit shops that sell products from PT. XYZ (Firmansyah, SE, Anita Roosmawarni, & SE, 2019).These shops are located in the cities of Subang, Sukabumi and Bogor (Taufiq, 2016).Determination of Sales Promotion travel routes in each city is obtained based on the distance of each city (Wijaya, Kristianto, Vanel, & Huwae, 2020).The data retrieval used will later be processed and determine the closest distance that will later be taken Here are the distances between cities: (Amri, Rahman, & Yuniarti, 2014) Table 1 Based on data collection, the city of origin of the sales promotion is Bandung.Sales Promotion will travel to visit the store.The stores are located in the cities of Subang (1), Sukabumi (2) and Bogor (3).Sales Promotion requires the shortest distance in order to maximize travel and minimize costs.From these problems, the data was processed http://eduvest.greenvest.co.id

Branch & Bound Method
The results obtained using the Branch & Bound method with the shortest distance of 373 km.

Greedy Heuristic Method
Figure 1.Results of the Complete Enumeration MethodThe results obtained using the Complete Enumeration method with the shortest distance of 373 km.

Figure 3 .
Figure 3. Results of Greedy Heuristic Method The results obtained using the Branch & Bound method with the shortest distance of 386 km.Table 2 Total Distance Method Closest total distance (km) Complete Enumeration 373 Branch and Bound 373 Greedy Heuristic 386

Sarah Nur Fatimah, Ifham Azizi Surya Syafiin And Muchammad Fauzi Travelling Salesman Problem Analysis with Complete Enumeration Method, Branch & Bound and Greedy Heuristic 753
. The distribution of products in each (Pratama, Rahaningsih, Nurhadiansyah, & Purani, 2019) use the following methods:(Pratama, Rahaningsih, Nurhadiansyah, & Purani, 2019)1.Literature Study.The author collects materials as references from modules, journals, articles, internet on Complete Enumeration, Branch & Bound and Greedy Heuristic Methods.2. Field Study.The author observes directly in the field based on the required data.3. Data Collection.The data is taken based on the city that is often visited by sales and based on the distance traveled by the city.4. Data Processing.The data is processed by analyzing problems in finding the shortest route using the Complete Enumeration, Branch & Bound and Greedy Heuristic methods. 5. Finding the Optimal Solution.Optimal solution is obtained based on the calculation of the shortest route.The shortest route deserves to be the Optimal Solution because it is more efficient.