Computer Sciences

Permanent URI for this collectionhttps://repository.aab-edu.net/handle/123456789/58

The Computer Sciences community showcases scholarly publications and research outputs authored by faculty and researchers in the Faculty of Computer Sciences. This collection includes journal articles, working papers, conference proceedings, and other academic works that contribute to the understanding of theory, policy, and practice. It aims to promote open access to high-quality economic research conducted within the institution.

News

Latest update: New research articles and working papers from the Computer sciences department have been added.

Browse

Filters

20252

Settings

Author: search.filters.author.Helshani, LaurikSubject: search.filters.subject.Travelling Salesman Problem (TSP)

Search Results

Now showing 1 - 2 of 2
  • No Thumbnail Available
    Item
    The Travelling Salesman Problem, Applications and Solvers
    (AAB College, 2025-07-15) Helshani, Laurik
    The travelling salesman problem (TSP) has puzzled mathematicians and computer scientists for many decades and it has found applicability in a number of diverse domains. The aim of this paper is to present the theory of TSP and its classification into the symmetric travelling salesman problem (sTSP), asymmetric travelling salesman problem (aTSP) and multi travelling salesman problem (mTSP), as well as the different mathematical formulations of the problem. This paper also provides an overview of the applications of TSP, and in the end presents the various traditional and modern approaches that have been proposed to solve this important problem.
  • No Thumbnail Available
    Item
    An Android Application for Google Map Navigation System, Solving the Travelling Salesman Problem, Optimization throught Genetic Algorithm
    (AAB College, 2025-07-15) Helshani, Laurik
    A salesman plans a trip through which he wants to visit his clients and come back to the starting point. During the trip, same client should not be visited more than once and the route should be shorter and less costly. The mathematical modeling of this problem has to do with the theory of graphs and combinatorics. Graph vertexes symbolize places to visit, and edges that connect the nodes are the paths (the distance of which is known from the beginning) that lead to those places. The complexity of the exact algorithm for solving this problem increases with the number of places to visit. For this reason genetic algorithm is offered as the optimal solution of TSP problem. The whole system is implemented as client-server system using RESTFul web services, Google-services and Android OS. Genetic Algorithm is used to determine the optimum route on Google map and solves the Travelling Salesman problem.

All works in this collection are protected by copyright. Authors retain the rights to their publications unless otherwise stated. Materials may be used for educational and research purposes with proper attribution. Unauthorized commercial use or redistribution is prohibited without permission.