GPU PSO and ACO Applied to TSP for Vehicle Security Tracking

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F16%3A86099085" target="_blank" >RIV/61989100:27240/16:86099085 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
GPU PSO and ACO Applied to TSP for Vehicle Security Tracking
Original language description
The Travelling Salesman Problem (TSP) is a well-known benchmark problem for many meta-heuristic algorithms, including security traffic optimization problems. TSP is known as NP hard complex. It was investigated using classical approaches as well as intelligent techniques using Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO) and other meta-heuristics. The Graphic Processing Units (GPU) is well suited to the execution of nature and bio-inspired algorithms due to the rapidity of parallel implementation of GPUs. In this paper, we present a novel parallel approach to run PSO and ACO on GPUs and applied to TSP (GPU-PSO&ACO-A-TSP) for security tracking vehicles in road traffic. Both algorithms are implemented on the GPUs. Results show better performance optimization when using GPUs compared to results using sequential CPU implementation.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)