A Comparative Study between Dynamic Programming and Artificial Atom Algorithm for Traveling Salesman Problem

Dynamic Programming (DP) algorithm is a powerful technique of exact method that can produce optimal solutions. In this paper, the Dynamic Program is compared with Artificial Atom Algorithm (A 3 ) which is a new heuristic - metaheuristic method. Both algorithms of DP and A 3 have been tested on case study of 9 locations in the West Jakarta. Based on the case study of small size locations, the results show that the distance of DP and A 3 method is the same, but the sequence is different.