Repository logo
Communities & Collections
All of DSpace
  • English
  • العربية
  • বাংলা
  • Català
  • Čeština
  • Deutsch
  • Ελληνικά
  • Español
  • Suomi
  • Français
  • Gàidhlig
  • हिंदी
  • Magyar
  • Italiano
  • Қазақ
  • Latviešu
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Српски
  • Svenska
  • Türkçe
  • Yкраї́нська
  • Tiếng Việt
Log In
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Helshani, Laurik"

Filter results by typing the first few letters
Now showing 1 - 6 of 6
  • Results Per Page
  • Sort Options
  • 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.
  • No Thumbnail Available
    Item
    An Android Application to solve the shortest path problem using Google Services and Dijkstra's Algorithm
    (AAB College, 2025-07-15) Helshani, Laurik
    In this paper, I examine Dijkstra’s algorithm in the context of solving the shortest path problem. The mathematical modeling of this problem has to do with the theory of graphs. The whole system is programmed as client system using Google Services and Android OS. Google Services are used to determine the optimum path on Google map and solve the shortest path problem as alternative of Dijkstra's Algorithm.
  • No Thumbnail Available
    Item
    Aplikimi i AI-së (inteligjencës artificiale) dhe IoT (internet of things) në përpunimin e gjuhës natyrale në shërbim të komunitetit
    (AAB College, 2025-07-15) Helshani, Laurik; Berisha, Burim
    Qëllimi i këtij punimi është ndërtimi i një pajisjeje interaktive që kombinon Raspberry Pi, një ekran me prekje (touchscreen) dhe algoritme të inteligjencës artificiale për të ofruar funksionalitetin text-to-speech. Pajisja synon të sigurojë një zgjidhje për përdoruesit që kanë nevojë për ndihmë zanore dhe ndërveprim më të avancuar me teknologjinë. Për të realizuar këtë projekt, pjesa harduerike përfshin përdorimin e një Raspberry Pi, i cili është i përshtatshëm për integrimin e komponentëve si një touchscreen, një modul zanor për përmirësimin e audios, dhe sensorë opsionalë për ndërveprime më të avancuara. Nga ana softuerike, Python do të përdoret për zhvillimin e aplikacionit që mundëson njohjen e tekstit dhe konvertimin e tij në të folur përmes teknologjive text-to-speech. Integrimi i inteligjencës artificiale në këtë sistem mundëson personalizimin e përvojës së përdoruesit, duke analizuar të dhënat dhe përmirësuar cilësinë e përgjigjeve zanore. Për shembull, modeli i AI-së mund të përshtatë intonacionin, të njohë komandat me një saktësi më të lartë dhe të mundësojë ndërveprime më natyrale. Kjo pajisje mund të përdoret në fusha të ndryshme si ndihmë për persona me aftësi të kufizuara, edukim interaktiv, automatizim i shërbimeve në kioska dixhitale apo asistentë zanorë të personalizuar. Përmes këtij punimi, do të analizohet procesi i ndërtimit të harduerit, zhvillimi i softuerit dhe optimizimi i tij për të siguruar performancë të lartë dhe përdorim të thjeshtë.
  • No Thumbnail Available
    Item
    Sensor Based Algorithm for Self-Navigating Robot Using Internet of Things (IoT)
    (AAB College, 2025-07-14) Helshani, Laurik; Qarkaxhija, Jusuf
    The purpose of this paper is to show the design technique and programming of an autonomous robot prototype that can go to a predetermined location and return to its starting place utilizing the Global Positioning System (GPS). An HD camera along with an ultrasonic sensor and two IR sensors is used to provide necessary data from the real world to the robot to avoid obstructions, by following GPS Waypoints. A smart algorithm was introduced for path planning and re-planning. The robot can modify its direction using a digital compass reading and input from sensors by computing the heading angle from the current GPS point. This self-navigation mobile robot's accuracy was evaluated in several locations and is quantified in terms of heading angle and path length from the starting point to the goal point.
  • No Thumbnail Available
    Item
    Solving the Traveling Salesman Problem using Google Services and Simulated Annealing Algorithm
    (AAB College, 2025-07-15) Helshani, Laurik
    The concept of the traveling salesman problem is to seeking a tour of a specified number of cities (visiting each city exactly once and returning to the starting point) where the length of the tour is minimized. The mathematical modeling of this problem has to do with the theory of graphs. In this paper, I examine simulated annealing algorithm in the context of solving the traveling salesman problem. Test-tool programming is done in JAVA programming language and his work is displayed graphically using the 2D library. The whole system is programmed as client-server system using RESTFul web services, Google-services and Simulated Annealing Algorithm. Google services are used to determine the optimum route on Google map and solve the Travelling Salesman problem.
  • 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.

DSpace software copyright © 2002-2025 LYRASIS

  • Privacy policy
  • End User Agreement
  • Send Feedback