Mobile Application Program Design for Traveling Salesman Problem Completion Using Artificial Bee Colony (ABC) Algorithm
Rojali,Muhammad Alby Bahri

Mathematics Department, School of Computer Science
Bina Nusantara University,
Jakarta, Indonesia 11480
rojali[at]binus.edu

Abstract

These research purposes are to solve which route you should take in the Travelling Salesman Problem using the Artificial Bee Colony algorithm. The Artificial Bee Colony algorithm will be implemented into a mobile application, using Android Studio based on the java programming language. The data variable consists of the number of the city and the distance between each city. The user will select the city and give the program the distance between each city using Google Maps. A program built in as an android mobile application gives easy access for the user to use the program and reduce cost resource than using a desktop application that needs the user to have a more expensive computer than a smartphone. The mobile application successfully solves a simulated Travelling Salesman Problem, gets an optimal route distance travel value at 30.0686 KM.

Keywords: Android Application- Artificial Bee Colony (ABC) Algorithm- Google Maps API- Mobile Application- Travelling Salesman Problem (TSP)

Topic: Computer and Mathematics