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

Authors

  • A Chandra Study Program Industrial Engineering, Engineering Faculty, Mercu Buana University Raya Meruya Selatan Street No.1, Kembangan, West Jakarta 11650
  • A Naro Study Program Industrial Engineering, Engineering Faculty, Mercu Buana University Raya Meruya Selatan Street No.1, Kembangan, West Jakarta 11650

DOI:

https://doi.org/10.20956/ijesca.v8i1.2995

Keywords:

Dynamic Programming (DP), A3, exact, heuristic, metaheuristic

Abstract

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 (A3) which is a new heuristic - metaheuristic method. Both algorithms of DP and A3 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 A3 method is the same, but the sequence is different.

Downloads

Published

2021-05-30

Issue

VOLUME 8 ISSUE 1 MAY 2021

Section

Articles