Please use this identifier to cite or link to this item: http://hdl.handle.net/11452/34289
Title: Performance comparison of the differential evolution and particle swarm optimization algorithms in free-space optical communications systems
Authors: Başgümüş, Arif
Namdar, Mustafa
Altuncu, Ahmet
Uludağ Üniversitesi/Mühendislik Fakültesi/Elektrik-Elektronik Mühendisliği Bölümü.
0000-0001-8972-1952
Yılmaz, Günes
AAH-4182-2021
7004543197
Keywords: Computer science
Engineering
Communication systems
Cooperative systems
Distance measurement
Evolutionary computation
Particle swarm optimization
Genetic algorithm
Issue Date: 2015
Publisher: Univ Suceava
Citation: Başgümüş, A. vd. (2015). "Performance comparison of the differential evolution and particle swarm optimization algorithms in free-space optical communications systems". Advances in Electrical and Computer Engineering, 15(2), 17-22.
Abstract: In this comparative study we evaluate the performance of Differential Evolution (DE) and Particle Swarm Optimization (PSO) algorithms in free space optical communications systems. In particular we obtain the optimal transmission distances for different relay nodes in the parallel decode-and-forward relaying schemes by optimizing the relay placements. We analyze that the cost functions are suitably minimized. Then we investigate the execution time and the stability of the DE and PSO algorithms for decode-and-forward relay-assisted free space optical links. The simulation results demonstrate that the PSO algorithm outperforms DE algorithm in terms of the minimization of the cost function. Furthermore the results indicate that we get the similar performance for the execution-time and optimization results in the DE and PSO algorithms.
URI: https://doi.org/10.4316/AECE.2015.02003
https://aece.ro/abstractplus.php?year=2015&number=2&article=3
http://hdl.handle.net/11452/34289
ISSN: 1582-7445
Appears in Collections:Scopus
Web of Science

Files in This Item:
File Description SizeFormat 
Yılmaz_vd_2015.pdf561.24 kBAdobe PDFThumbnail
View/Open


This item is licensed under a Creative Commons License Creative Commons