Abdullah Oktay Dündar

Abdullah Oktay Dündar

Auto-generated profile, based on publicly available information

Abdullah Oktay Dündar

Department of Logistic, University of Selcuk, 42460 Konya, Turkey

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2017 in Journal of Computational and Theoretical Nanoscience
Verified
Journal Article
Closed access
Mehmet Akif ŞahmanMehmet Akif Şahman
Mehmet Akif Şahman
AAAdem Alpaslan Altun
Adem Alpaslan Altun
ADAbdullah Oktay Dündar
Abdullah Oktay Dündar
Recently, many Computational-Intelligence algorithms have been proposed for solving continuous problem. The Differential Search Algorithm (DSA), a computational-intelligence based algorithm inspired by the migration movements of superorganisms, is developed to solve continuous problems. However, DSA proposed for solving problems with continuous search space proposed for solving should be modified for solving binary structured problems. When the DSA is intended for use in binary problems, continuous variables need to be converted into binary format due to solution space structure of this type of problem. In this study, the DSA is modified to solve binary optimization problems by using a conversion approach from continuous values to binary values. The new algorithm has been designated as the binary DSA or BDSA for short. First, when finding donors with the BDSA, four search methods (Bijective, Surjective, Elitist1 and Elitist2) with different iteration numbers are used and tested on 15 UFLP benchmark problems. The Elitist2 approach, which provides the best solution of the four methods, is used in the BDSA, and the results are compared with Continuous Particle Swarm Optimization (CPSO), Continuous Artificial Bee Colony (ABCbin), Improved Binary Particle Swarm Optimization (IBPSO), Binary Artificial Bee Colony (binABC) and Discrete Artificial Bee Colony (DisABC) algorithms using UFLP benchmark problems. Results from the tests and comparisons show that the BDSA is fast, effective and robust for binary optimization.

18 July 2016 in Neural Computing and Applications
Verified
Journal Article
Closed access
PDF file
Mehmet Akif ŞahmanMehmet Akif Şahman
Mehmet Akif Şahman
AAAdem Alparslan Altun
Adem Alparslan Altun
ADAbdullah Oktay Dündar
Abdullah Oktay Dündar

23 December 2016 in International Journal of Applied Mathematics Electronics and Computers
Verified
Journal Article
Closed access
PDF file
ADAbdullah Oktay Dündar
Abdullah Oktay Dündar
KPKenan Peker
Kenan Peker
MTMahmut Tekin
Mahmut Tekin
Mehmet Akif ŞahmanMehmet Akif Şahman
Mehmet Akif Şahman
MBMustafa Büber
Mustafa Büber