Doğan Aydın
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Doğan Aydın has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Ali Savaş Koparal
Open Education Faculty, Anadolu University, Eskişehir 26470, Turkey
2 shared publications - Aybars Uğur
Ege Universitesi
1 shared publication Burhanettin Durmuş
1 shared publication- Derya Deliktaş
Kutahya Dumlupinar Universitesi
1 shared publication - Durmuş Özdemir
Kütahya Dumlupinar University
1 shared publication Erman Uzgur
Anadolu University
1 shared publication
Latest Publications
- 1 March 2026
- Published by Konya Muhendislik Bilimleri Dergisi in Konya Journal of Engineering Sciences
- Vol. 14 (1) , 193-209
COMPARATIVE OPTIMIZATION OF BLDC MOTOR PERFORMANCE PARAMETERS USED AS ELECTRIC VEHICLE TRACTION MOTOR WITH PSOSAV ALGORITHM
Electric Vehicle (EV) technology has been gaining attention these last few years, with huge possibilities of reducing the environmental burden in comparison with fossil fuel-powered vehicles. This has made the comparison of different types of motors for traction applications an interesting topic. Among these, brushless DC (BLDC) motors have superior torque density, near-unity power factor, and minimal maintenance. When there are a growing interest and demand for these specialized BLDC motors for numerous applications, to develop design methodologies and optimize motor performance. This paper proposes an algorithm called Particle Swarm Optimization with Self-Adaptive Velocity Update Strategy (PSOSAV) and its application to the BLDC motor design problems. The self-adaptive mechanism adjusts the trade-off between explorative and exploitative behaviors in the right amount throughout the entire process of optimization, ensuring better motor performance. The primary performance criteria targeted by the proposed algorithm are Total Harmonic Distortion (THD), torque, and back electromotive force (back-EMF), which have been optimized to improve motor efficiency and reliability. The PSOSAV algorithm achieved optimized parameters of Br = 1.3481 T, g = 7.5×10⁻⁴ m, and α = 0.7663, resulting in a torque constant of 0.11408 and a THD value of 8.85%, outperforming conventional PSO and other recent metaheuristic algorithms. A prototype traction BLDC motor based on the proposed algorithm has achieved a power output of 2.45 kW, with results superior to theoretical predictions than those predicted through theoretical models. A comparative study shows the superiority of the proposed PSOSAV over canonical PSO and some other recently proposed metaheuristic algorithms for parameter optimization of BLDC motors.
- 1 March 2026
- Published by Konya Muhendislik Bilimleri Dergisi in Konya Journal of Engineering Sciences
- Vol. 14 (1) , 193-209
COMPARATIVE OPTIMIZATION OF BLDC MOTOR PERFORMANCE PARAMETERS USED AS ELECTRIC VEHICLE TRACTION MOTOR WITH PSOSAV ALGORITHM
Electric Vehicle (EV) technology has been gaining attention these last few years, with huge possibilities of reducing the environmental burden in comparison with fossil fuel-powered vehicles. This has made the comparison of different types of motors for traction applications an interesting topic. Among these, brushless DC (BLDC) motors have superior torque density, near-unity power factor, and minimal maintenance. When there are a growing interest and demand for these specialized BLDC motors for numerous applications, to develop design methodologies and optimize motor performance. This paper proposes an algorithm called Particle Swarm Optimization with Self-Adaptive Velocity Update Strategy (PSOSAV) and its application to the BLDC motor design problems. The self-adaptive mechanism adjusts the trade-off between explorative and exploitative behaviors in the right amount throughout the entire process of optimization, ensuring better motor performance. The primary performance criteria targeted by the proposed algorithm are Total Harmonic Distortion (THD), torque, and back electromotive force (back-EMF), which have been optimized to improve motor efficiency and reliability. The PSOSAV algorithm achieved optimized parameters of Br = 1.3481 T, g = 7.5×10⁻⁴ m, and α = 0.7663, resulting in a torque constant of 0.11408 and a THD value of 8.85%, outperforming conventional PSO and other recent metaheuristic algorithms. A prototype traction BLDC motor based on the proposed algorithm has achieved a power output of 2.45 kW, with results superior to theoretical predictions than those predicted through theoretical models. A comparative study shows the superiority of the proposed PSOSAV over canonical PSO and some other recently proposed metaheuristic algorithms for parameter optimization of BLDC motors.
- 30 September 2025
- Published by Kütahya Dumlupinar Üniversitesi in Journal of Scientific Reports-A
- No. 062,p. 71-89
An energy efficient cluster head selection in priority region aware wireless sensor networks using metaheuristic algorithms
The cluster head (CH) selection problem is one of the challenges posed by wireless sensor network (WSN) design, where nodes assume leadership roles. The primary objective of this problem is energy conservation, as becoming a CH requires high energy consumption. Therefore, optimizing the CH selection process is crucial. Despite numerous attempts to solve this problem, existing algorithms do not consider area prioritization, where certain regions such as industrial facilities with hazardous zones and military surveillance areas require special attention. This work first describes the standard CH selection problem in non-priority environments and then introduces priority region-aware WSNs. It then presents how energy-efficient CH selection using metaheuristics, with a priority- and energy-aware fitness function developed in this study, can be performed in such networks for the first time in the literature. The findings from comprehensive simulation-based experiments demonstrate the superior performance of both classical and state-of-the-art metaheuristic-driven approaches compared to the baseline Low-Energy Adaptive Clustering Hierarchy (LEACH) algorithm. Specifically, the Adaptive Differential Evolution with Optional External Archive (JADE) algorithm improves the performance of LEACH by up to 16% in terms of the total priority of transferred packets. Additionally, it can extend the lifetime of nodes in high-priority regions by up to 27% to 44%.
- 30 September 2025
- Published by Kütahya Dumlupinar Üniversitesi in Journal of Scientific Reports-A
- No. 062,p. 71-89
An energy efficient cluster head selection in priority region aware wireless sensor networks using metaheuristic algorithms
The cluster head (CH) selection problem is one of the challenges posed by wireless sensor network (WSN) design, where nodes assume leadership roles. The primary objective of this problem is energy conservation, as becoming a CH requires high energy consumption. Therefore, optimizing the CH selection process is crucial. Despite numerous attempts to solve this problem, existing algorithms do not consider area prioritization, where certain regions such as industrial facilities with hazardous zones and military surveillance areas require special attention. This work first describes the standard CH selection problem in non-priority environments and then introduces priority region-aware WSNs. It then presents how energy-efficient CH selection using metaheuristics, with a priority- and energy-aware fitness function developed in this study, can be performed in such networks for the first time in the literature. The findings from comprehensive simulation-based experiments demonstrate the superior performance of both classical and state-of-the-art metaheuristic-driven approaches compared to the baseline Low-Energy Adaptive Clustering Hierarchy (LEACH) algorithm. Specifically, the Adaptive Differential Evolution with Optional External Archive (JADE) algorithm improves the performance of LEACH by up to 16% in terms of the total priority of transferred packets. Additionally, it can extend the lifetime of nodes in high-priority regions by up to 27% to 44%.
- 17 October 2023
- Published by Emerald Publishing in Engineering Computations
- Vol. 40 (9/10) , 2453-2482
An artificial bee colony based-hyper heuristic algorithm with local search for the assembly line balancing problems
Purpose: Assembly lines are widely employed in manufacturing processes to produce final products in a flow efficiently. The simple assembly line balancing problem is a basic version of the general problem and has still attracted the attention of researchers. The type-I simple assembly line balancing problems (SALBP-I) aim to minimise the number of workstations on an assembly line by keeping the cycle time constant.Design/methodology/approach: This paper focuses on solving multi-objective SALBP-I problems by utilising an artificial bee colony based-hyper heuristic (ABC-HH) algorithm. The algorithm optimises the efficiency and idleness percentage of the assembly line and concurrently minimises the number of workstations. The proposed ABC-HH algorithm is improved by adding new modifications to each phase of the artificial bee colony framework. Parameter control and calibration are also achieved using the irace method. The proposed model has undergone testing on benchmark problems, and the results obtained have been compared with state-of-the-art algorithms.Findings: The experimental results of the computational study on the benchmark dataset unequivocally establish the superior performance of the ABC-HH algorithm across 61 problem instances, outperforming the state-of-the-art approach.Originality/value: This research proposes the ABC-HH algorithm with local search to solve the SALBP-I problems more efficiently.
- 17 October 2023
- Published by Emerald Publishing in Engineering Computations
- Vol. 40 (9/10) , 2453-2482
An artificial bee colony based-hyper heuristic algorithm with local search for the assembly line balancing problems
Purpose: Assembly lines are widely employed in manufacturing processes to produce final products in a flow efficiently. The simple assembly line balancing problem is a basic version of the general problem and has still attracted the attention of researchers. The type-I simple assembly line balancing problems (SALBP-I) aim to minimise the number of workstations on an assembly line by keeping the cycle time constant.Design/methodology/approach: This paper focuses on solving multi-objective SALBP-I problems by utilising an artificial bee colony based-hyper heuristic (ABC-HH) algorithm. The algorithm optimises the efficiency and idleness percentage of the assembly line and concurrently minimises the number of workstations. The proposed ABC-HH algorithm is improved by adding new modifications to each phase of the artificial bee colony framework. Parameter control and calibration are also achieved using the irace method. The proposed model has undergone testing on benchmark problems, and the results obtained have been compared with state-of-the-art algorithms.Findings: The experimental results of the computational study on the benchmark dataset unequivocally establish the superior performance of the ABC-HH algorithm across 61 problem instances, outperforming the state-of-the-art approach.Originality/value: This research proposes the ABC-HH algorithm with local search to solve the SALBP-I problems more efficiently.
- Open Access
- 21 August 2023
- Published by Journal of the Faculty of Engineering and Architecture of Gazi University in Gazi Üniversitesi Mühendislik-Mimarlık Fakültesi Dergisi
- Vol. 39 (1) , 29-38
Kazancı düzleştirilmiş fiber raman yükselteç modelinin ikili arama denklemli adaptif yapay arı kolonisi (İADAYAK) algoritması ile optimizasyonu
Yüksek bant genişliğine duyulan ihtiyaç sebebiyle dağınık fiber Raman yükselteçlerine (FRY) olan ilgi artmaktadır. FRY’ler geniş bant aralığını kullanmasının yanında düşük gürültü faktörü avantajı ve kullanımdaki basitlik ile de ön plana çıkmaktadır. Bu çalışmada SMF-28 türü fiberlerde kazancı düzleştirilmeye çalışılan 50 km mesafeye sahip bir fiber hatta ilerleyen 100 adet optik sinyale zıt yönde sırasıyla 4, 8, 16 adet pompa sinyali göndererek dağınık fiber raman yükselteç sistemi kurulmuştur. Kurulan sistemde sinyal kazancını düzleştirmek için lineer olmayan FRY modeli, optimizasyon problemi olarak tanımlanarak ikili arama denklemli adaptif yapay arı kolonisi algoritması (İADAYAK) ile çözülmüştür. Sonuçlar incelendiğinde 4 adet pompa kullanılarak elde edilen ortalama net kazanç farkı 0,16 dB, net kazanç farkı ise 0 ± 0,4 dB olarak bulunmuştur. 8 adet pompa kullanılarak elde edilen ortalama net kazanç farkı 0,043 dB, net kazanç farkı ise 0 ± 0,1 dB olarak ortaya çıkmıştır. 16 adet pompa kullanılarak elde edilen ortalama net kazanç farkı 0,028 dB, net kazanç farkı ise 0 ± 0,05 dB olarak tespit edilmiştir. Yapay zekâ teknolojisi kapsamında üretilen algoritmaların gelişmesi paralelinde bu çalışmaya benzer çözüm performanslarının gelişeceği ve bu sayede elde edilen verimin artacağı düşünülmektedir.
- 21 August 2023
- Published by Journal of the Faculty of Engineering and Architecture of Gazi University in Gazi Üniversitesi Mühendislik-Mimarlık Fakültesi Dergisi
- Vol. 39 (1) , 29-38
Open AccessKazancı düzleştirilmiş fiber raman yükselteç modelinin ikili arama denklemli adaptif yapay arı kolonisi (İADAYAK) algoritması ile optimizasyonu
Yüksek bant genişliğine duyulan ihtiyaç sebebiyle dağınık fiber Raman yükselteçlerine (FRY) olan ilgi artmaktadır. FRY’ler geniş bant aralığını kullanmasının yanında düşük gürültü faktörü avantajı ve kullanımdaki basitlik ile de ön plana çıkmaktadır. Bu çalışmada SMF-28 türü fiberlerde kazancı düzleştirilmeye çalışılan 50 km mesafeye sahip bir fiber hatta ilerleyen 100 adet optik sinyale zıt yönde sırasıyla 4, 8, 16 adet pompa sinyali göndererek dağınık fiber raman yükselteç sistemi kurulmuştur. Kurulan sistemde sinyal kazancını düzleştirmek için lineer olmayan FRY modeli, optimizasyon problemi olarak tanımlanarak ikili arama denklemli adaptif yapay arı kolonisi algoritması (İADAYAK) ile çözülmüştür. Sonuçlar incelendiğinde 4 adet pompa kullanılarak elde edilen ortalama net kazanç farkı 0,16 dB, net kazanç farkı ise 0 ± 0,4 dB olarak bulunmuştur. 8 adet pompa kullanılarak elde edilen ortalama net kazanç farkı 0,043 dB, net kazanç farkı ise 0 ± 0,1 dB olarak ortaya çıkmıştır. 16 adet pompa kullanılarak elde edilen ortalama net kazanç farkı 0,028 dB, net kazanç farkı ise 0 ± 0,05 dB olarak tespit edilmiştir. Yapay zekâ teknolojisi kapsamında üretilen algoritmaların gelişmesi paralelinde bu çalışmaya benzer çözüm performanslarının gelişeceği ve bu sayede elde edilen verimin artacağı düşünülmektedir.
- 8 August 2022
- Published by Springer Nature in Neural Computing and Applications
- Vol. 34 (20) , 17455-17471
A new modified artificial bee colony algorithm for energy demand forecasting problem
- 8 August 2022
- Published by Springer Nature in Neural Computing and Applications
- Vol. 34 (20) , 17455-17471
A new modified artificial bee colony algorithm for energy demand forecasting problem
- 1 February 2022
- Published by Elsevier in Applied Soft Computing
- Vol. 116
Artificial Bee Colony Algorithm with Distant Savants for constrained optimization
- 1 February 2022
- Published by Elsevier in Applied Soft Computing
- Vol. 116
Artificial Bee Colony Algorithm with Distant Savants for constrained optimization
- 31 August 2021
- Published by Eskisehir Osmangazi Universitesi Muhendislik ve Mimarlik Fakultesi Dergisi in Eskişehir Osmangazi Üniversitesi Mühendislik ve Mimarlık Fakültesi Dergisi
- Vol. 29 (2) , 235-248
BÜYÜK ÖLÇEKLİ SÜREKLİ OPTİMİZASYON PROBLEMLERİ İÇİN ELİT BİREY TABANLI YAPAY ARI KOLONİSİ ALGORİTMASI
Optimizasyon problemlerinde boyutu büyüdükçe çözümleri de zorlaşmaktadır. Bu problemlerin üstesinden gelmek için sürü zekâsı algoritmalarından faydalanılabilir. Birçok sürü zekâsı algoritmalarından bir tanesi de Yapay Arı Kolonisi (Artificial Bee Colony, ABC) algoritmasıdır. Büyük ölçekli optimizasyon problemlerinde yapay arı kolonisi algoritmasından faydalanabilmek için orijinal ABC algoritmasında bazı iyileştirmeler yapmak gerekmektedir. Bu çalışmada, ABC algoritması için yapılan iyileştirmeler “Elit Ajan Tabanlı Kendi Kendine Uyarlanabilir Yapay Arı Kolonisi Algoritması’ adını verdiğimiz yeni bir ABC algoritması içerisinde tanımlanmıştır. Klasik ABC algoritmalarından farklı olarak işçi ve gözcü arı adımlarında farklı arama denklemleri kullanılmış ve bu arama denklemlerinde elit bireylerden yararlanılmıştır. Ayrıca bir yerel arama tekniği ile algoritma performansı güçlendirilmiştir. Algoritmalara ait parametre değerlerinin doğru olarak seçilmesi algoritmaların başarısında büyük etkiye sahiptirler. Bu çalışmada irace aracı kullanılarak algoritmaya ait parametreler en iyi bir şekilde ayarlanmaya çalışılmıştır. Geliştirdiğimiz algoritma büyük ölçekli sürekli optimizasyon fonksiyonlarını barındıran SOCO11 ölçüt fonksiyon kümesinde test edilmiştir. Elde ettiğimiz sonuçlar ABC algoritmalarıyla ve SOCO11 yarışmasına katılan algoritmalar ile karşılaştırılmış ve başarılı sonuçlar elde edilmiştir.
- 31 August 2021
- Published by Eskisehir Osmangazi Universitesi Muhendislik ve Mimarlik Fakultesi Dergisi in Eskişehir Osmangazi Üniversitesi Mühendislik ve Mimarlık Fakültesi Dergisi
- Vol. 29 (2) , 235-248
BÜYÜK ÖLÇEKLİ SÜREKLİ OPTİMİZASYON PROBLEMLERİ İÇİN ELİT BİREY TABANLI YAPAY ARI KOLONİSİ ALGORİTMASI
Optimizasyon problemlerinde boyutu büyüdükçe çözümleri de zorlaşmaktadır. Bu problemlerin üstesinden gelmek için sürü zekâsı algoritmalarından faydalanılabilir. Birçok sürü zekâsı algoritmalarından bir tanesi de Yapay Arı Kolonisi (Artificial Bee Colony, ABC) algoritmasıdır. Büyük ölçekli optimizasyon problemlerinde yapay arı kolonisi algoritmasından faydalanabilmek için orijinal ABC algoritmasında bazı iyileştirmeler yapmak gerekmektedir. Bu çalışmada, ABC algoritması için yapılan iyileştirmeler “Elit Ajan Tabanlı Kendi Kendine Uyarlanabilir Yapay Arı Kolonisi Algoritması’ adını verdiğimiz yeni bir ABC algoritması içerisinde tanımlanmıştır. Klasik ABC algoritmalarından farklı olarak işçi ve gözcü arı adımlarında farklı arama denklemleri kullanılmış ve bu arama denklemlerinde elit bireylerden yararlanılmıştır. Ayrıca bir yerel arama tekniği ile algoritma performansı güçlendirilmiştir. Algoritmalara ait parametre değerlerinin doğru olarak seçilmesi algoritmaların başarısında büyük etkiye sahiptirler. Bu çalışmada irace aracı kullanılarak algoritmaya ait parametreler en iyi bir şekilde ayarlanmaya çalışılmıştır. Geliştirdiğimiz algoritma büyük ölçekli sürekli optimizasyon fonksiyonlarını barındıran SOCO11 ölçüt fonksiyon kümesinde test edilmiştir. Elde ettiğimiz sonuçlar ABC algoritmalarıyla ve SOCO11 yarışmasına katılan algoritmalar ile karşılaştırılmış ve başarılı sonuçlar elde edilmiştir.
- 2 March 2021
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 77 (9) , 10252-10288
A hybrid list-based task scheduling scheme for heterogeneous computing
- 2 March 2021
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 77 (9) , 10252-10288
A hybrid list-based task scheduling scheme for heterogeneous computing
- 15 May 2012
- Published by SAGE Publications in Textile Research Journal
- Vol. 82 (17) , 1731-1742
Antibacterial functionalization of cotton and polyester fabrics with a finishing agent based on silver-doped calcium phosphate powders
Textiles are suitable materials for the growth of pathogenic microorganisms. Therefore, various antibacterial finishes have already been developed for textile products. In this work an antibacterial finishing agent containing calcium phosphate-based silver-doped powder was developed for the functionalization of textiles and applied to 100% cotton and 100% polyester knitted fabric samples. Firstly, silver-doped antibacterial powder was synthesized by using a wet chemical method. A size reduction process was applied for reducing the particle size of the powder from micron size to submicron scale. The aqueous dispersion was stabilized by coating the powder surfaces with polyethylene glycol. In order to obtain laundering durability, an aqueous emulsion of an acrylic copolymer was added to the antibacterial solution. The resultant product was applied to all fabric samples by a conventional pad-dry-cure method. The treated fabrics were washed 20 times and the antibacterial efficiency was evaluated after each 10 laundry cycles according to the JIS-L 1902:2002 method against Gram (-) E. coli bacteria. To see the effect of antibacterial finishing on the physical properties of fabrics, the bursting strength, air permeability and color efficiency of the treated and untreated samples were measured and compared. It was found that the antibacterial solution did not affect significantly the bursting strength and color efficiency values of the fabrics, while air permeability was decreased. On the other hand, treated fabric samples preserved their strong antibacterial activities against E. coli after 20 laundry cycles.
- 15 May 2012
- Published by SAGE Publications in Textile Research Journal
- Vol. 82 (17) , 1731-1742
Antibacterial functionalization of cotton and polyester fabrics with a finishing agent based on silver-doped calcium phosphate powders
Textiles are suitable materials for the growth of pathogenic microorganisms. Therefore, various antibacterial finishes have already been developed for textile products. In this work an antibacterial finishing agent containing calcium phosphate-based silver-doped powder was developed for the functionalization of textiles and applied to 100% cotton and 100% polyester knitted fabric samples. Firstly, silver-doped antibacterial powder was synthesized by using a wet chemical method. A size reduction process was applied for reducing the particle size of the powder from micron size to submicron scale. The aqueous dispersion was stabilized by coating the powder surfaces with polyethylene glycol. In order to obtain laundering durability, an aqueous emulsion of an acrylic copolymer was added to the antibacterial solution. The resultant product was applied to all fabric samples by a conventional pad-dry-cure method. The treated fabrics were washed 20 times and the antibacterial efficiency was evaluated after each 10 laundry cycles according to the JIS-L 1902:2002 method against Gram (-) E. coli bacteria. To see the effect of antibacterial finishing on the physical properties of fabrics, the bursting strength, air permeability and color efficiency of the treated and untreated samples were measured and compared. It was found that the antibacterial solution did not affect significantly the bursting strength and color efficiency values of the fabrics, while air permeability was decreased. On the other hand, treated fabric samples preserved their strong antibacterial activities against E. coli after 20 laundry cycles.
- 15 May 2004
- Published by Trans Tech Publications, Ltd. in Key Engineering Materials
- Vol. 264-268, 1573-1576
Applications of Calcium Phosphate Based Antibacterial Ceramics on Sanitary and Tile Wares
- 15 May 2004
- Published by Trans Tech Publications, Ltd. in Key Engineering Materials
- Vol. 264-268, 1573-1576
Applications of Calcium Phosphate Based Antibacterial Ceramics on Sanitary and Tile Wares