Mehmet Fatih Tasgetiren

Artificial Intelligence · 2007–2020

A researcher in the Science corpus: 7 papers; trusts 14 researchers and is trusted by 12 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 33 citations into it; #13,243 of 35,345 by trust here, #12,761 by citations
• Computational Theory and Mathematics — 22 citations into it; #4,376 of 12,182 by trust here, #3,033 by citations
• Computer Networks and Communications — 17 citations into it
• Industrial and Manufacturing Engineering — 12 citations into it; #602 of 2,521 by trust here, #812 by citations
• Information Systems — 9 citations into it
• Civil and Structural Engineering — 8 citations into it
• Electrical and Electronic Engineering — 8 citations into it
• Statistics and Probability — 6 citations into it

Whom Mehmet Fatih Tasgetiren trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. R. Eberhart
2. Chandrasekharan Rajendran
3. Godfrey C. Onwubolu
4. Rubén Ruiz
5. Frans van den Bergh
6. James Kennedy
7. Pierre Hansen
8. Eric R. Ziegel
9. Mohammad Ali Abido
10. Hans-Peter Ziegler

Who trusts Mehmet Fatih Tasgetiren overall

1. Quan-Ke Pan
2. Konstantinos E. Parsopoulos
3. Rubén Ruiz
4. James Jian Qiao Yu
5. Ryoji Tanabe
6. Fei Kang
7. Pinar Çivicioglu
8. Swagatam Das
9. Victor O. K. Li
10. Yu-yan Han

Papers from Mehmet Fatih Tasgetiren's perspective

Ordered by how strongly the researchers Mehmet Fatih Tasgetiren trusts endorse each paper. Same corpus, a different order for every researcher.

1. A new optimizer using particle swarm theory
2. The NP-Completeness Column: An Ongoing Guide
3. Cooperative learning in neural networks using particle swarm optimizers (S. Afr. Comput. J.)
4. A genetic algorithm for flowshop sequencing
5. Variable neighborhood search (European Journal of Operational Research)
6. TWO NEW ROBUST GENETIC ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM
7. A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion (Computers & Operations Research)
8. Design and Analysis of Experiments
9. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs (European Journal of Operational Research)
10. Semisupervised Deep Reinforcement Learning in Support of IoT and Smart City Services

Their papers

• Differential evolution algorithm with ensemble of parameters and mutation strategies (2011) — 1,324 citations
• A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem (2011) — 611 citations
• A self-adaptive global best harmony search algorithm for continuous optimization problems (2010) — 378 citations
• Future Trends and Current State of Smart City Concepts: A Survey (2020) — 319 citations
• A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem (2008) — 468 citations
• A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (2007) — 570 citations
• A discrete differential evolution algorithm for the permutation flowshop scheduling problem (2007) — 313 citations