The Comparison of Brute Force, Cheapest-Insertion, and Nearest-Neighbor Heuristics for Determining the Shortest Tour for Visiting Malls in Bandar Lampung

A mall is a sizable retail complex made up of numerous stores, as well as restaurants and other commercial spaces, all situated in one huge building or a collection of related or neighboring buildings. In this study we will compare the heuristics which are Brute Force, Cheapest-Insertion, and Nearest-Neighbor heuristics to find the shortest route from one mall to other eight malls in Bandar Lampung exactly once and back to the origin. The problem of finding the shortest route from original location, and go to every location exactly once, and back to original location is known as The Travelling Salesman Problem. Implementing on the data of the locations of those nine malls, the Brute Force Heuristic gives the total length 32,8 km, Cheapest-Insertion Heuristic 33,2 km, and Nearest-Neighbor Heuristic 33,35 km. However, in term of efficiency, the Brute Force is not efficient because we have to search for all possible solutions.