Data Collection from Wireless Sensor Networks: OpenMP Application on the Solution of Traveling Salesman Problem with Parallel Genetic Algorithm and Ant Colony Algorithm

dc.authorid315726en_US
dc.authorid110138en_US
dc.authorid273177en_US
dc.contributor.authorErkartal, Reşat Buğra
dc.contributor.authorYılmaz, Atınç
dc.contributor.authorÇetin, Ömer
dc.date.accessioned2023-02-03T07:03:30Z
dc.date.available2023-02-03T07:03:30Z
dc.date.issued2022
dc.departmentİstanbul Beykent Üniversitesien_US
dc.description.abstractParallelization of algorithms can reduce time in many cases while using multiple cores at the same time. Although Algorithms such as Genetic Algorithm (GA) and Ant Colony (AC) are widely used optimization algorithms to solve the non-linear problems it is usually time consuming. This study aims to solve a well-known NP-Hard problem, The Travelling Salesman Problem (TSP), by using both parallel and serial GA and AC. As an application, the data collected from the wireless sensors networks (WSNs) were used and the performance values of the running algorithms were compared. Reducing the travelling time in WSNs avoids losses in energy consumption caused by multi-tab transmission, but causes a long delay. Additionally, application was made with Open Multi Processing (OpenMP) and its performance was compared with serial programming. According to the findings while both methods reduces the time in half when they run parallel, the performance of GA is much superior than AC.en_US
dc.identifier.issn1304-0448
dc.language.isoenen_US
dc.publisherMilli Savunma Üniversitesien_US
dc.relation.publicationcategoryMakale - Ulusal Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.subjectGenetic Algorithmen_US
dc.subjectTravelling Salesman Problemen_US
dc.subjectParallel Programmingen_US
dc.titleData Collection from Wireless Sensor Networks: OpenMP Application on the Solution of Traveling Salesman Problem with Parallel Genetic Algorithm and Ant Colony Algorithmen_US
dc.typeArticleen_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Yükleniyor...
Küçük Resim
İsim:
Data Collection from Wireless Sensor Networks OpenMP Application on the Solution of Traveling Salesman Problem with Parallel Genetic Algorithm and Ant Colony Algorithm.pdf
Boyut:
372.49 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Lisans paketi
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
İsim:
license.txt
Boyut:
1.44 KB
Biçim:
Item-specific license agreed upon to submission
Açıklama: