A Parallel Meta-Heuristic Approach to Reduce Vehicle Travel Time in Smart Cities

The development of the smart city concept and the inhabitants’ need to reduce travel time, as well as society’s awareness of the reduction of fuel consumption and respect for the environment, lead to a new approach to the classic problem of the Travelling Salesman Problem (TSP) applied to urban environments. This problem can be formulated as “Given a list of geographic points and the distances between each pair of points, what is the shortest possible route that visits each point and returns to the departure point?” Nowadays, with the development of IoT devices and the high sensoring capabilities, a large amount of data and measurements are available, allowing researchers to model accurately the routes to choose. In this work, the purpose is to give solution to the TSP in smart city environments using a modified version of the metaheuristic optimization algorithm TLBO (Teacher Learner Based Optimization). In addition, to improve performance, the solution is implemented using a parallel GPU architecture, specifically a CUDA implementation.