Sciencedirect Top 25 Hottest.

bigskymanAI and Robotics

Oct 24, 2013 (3 years and 9 months ago)

148 views


Dr. M. Fatih Tasgetiren received his BSc degree in I
ndustrial Engineering

from
Sakarya Engineering Faculty of Istanbul Technical University in 1982 and MSc
degree in I
ndustrial Engineering

from Istanbul Technical University in

1988,
respectively. He
joined the PhD program in Operations Management at Bosphorus
University in 1988, however he
received his PhD degree in Operations Management
from Istanbul University, in 1996. He has worked as a

faculty member in various
universities such as Sakarya Univer
sity (Turkey), Auburn University (USA),
University of Alabama in Tuscaloosa (USA), University of Puerto Rico (USA), Fatih
University (Turkey), and Sultan Qaboos University (Oman). He is currently an
associate professor
in
the Industrial Engineering Departm
ent
at

Yasar University,
Turkey.

He is the director of MSc in IMIS program at Yasar University.

Dr. M. Fatih Tasgetiren's research interests are in heuristic optimization applied to
both continuous and discrete/combinatorial optimization problems. He focus
es on
developing solution methods based on local search algorithms, evolutionary
computation and swarm intelligence such as

Iterated Greedy (IG) algorithm,

Variable
Neighborhood Search (VNS),

Tabu Search (TS),

Genetic Algorithms (GA),

Memetic
algorithms (M
A)
,
Ant Colony Optimization (ACO),

Particle Swarm Optimization
(PSO),

Differential Evolution (DE),

Harmony Search (HS),

and Artificial Bee Colony
(ABC) algorithm.

Selected Publications

1.

R. Mallipeddi, P.N. Suganthan, Q.K. Pan, M.F. Tasgetiren., (2010). “Dif
ferential
evolution algorithm with ensemble of parameters and mutation strategies”,
Appl.
Soft Comput. J
. (2010), doi:10.1016/j.asoc.2010.04.024

2.

Quan
-
Ke Pan, M. Fatih Tasgetiren, P.N. Suganthan, T.J. Chua, (2010) “A discrete
artificial bee colony algorithm

for the lot
-
streaming flow shop scheduling
problem”,
Inform. Sci.

(2010), doi:10.1016/j.ins.2009.12.025.
Sciencedirect
Top 25 Hottest
.

3.

Quan
-
Ke Pan, P.N. Suganthan, M. Fatih Tasgetiren, J.J. Liang, (2010), “A self
-
adaptive global best harmony search algori
thm for continuous optimization
problems”,
Applied Mathematics and Computation

216 (2010) 830

848.
Sciencedirect Top 25 Hottest

4.

M. Fatih Tasgetiren, P.N. Suganthan, Quan
-
Ke Pan, (2010), “An ensemble of
discrete differential evolution algorithms for solving

the generalized traveling
salesman problem”,
Applied Mathematics and Computation

215 (2010) 3356

3368.
Sciencedirect Top 25 Hottest.

5.

Ling Wang, Quan
-
Ke Pan, M. Fatih Tasgetiren, (2010), “Minimizing the total flow
time in a flow shop with blocking by using

hybrid harmony search algorithms”,
Expert Systems with Applications
(2010), doi:10.1016/j.eswa.2010.04.042

6.

Quan
-
Ke Pan, P. N. Suganthan, J.J. Liangc and M. Fatih Tasgetiren, “A local
-
best
harmony search algorithm with dynamic subpopulations”,
Engineering
Optimization,
Vol. 00, No. 0, 2009, 1

17

7.

Quan
-
Ke Pan, P.N. Suganthan, J.J. Liang, M. Fatih Tasgetiren, “A local
-
best
harmony search algorithm with dynamic sub
-
harmony memories for lot
-
streaming flow shop scheduling problem”,
Expert Systems with Application
s
,
(2010), doi:10.1016/j.eswa.2010.08.111.

8.

S. Z. Zhao, P. N. Suganthan, Quan
-
Ke Pan, M. Fatih Tasgetiren, “Dynamic Multi
-
Swarm Particle Swarm Optimizer with Harmony Search”,
Accepted to Expert
Systems with Applications
, (2010).

9.

M. Fatih Tasgetiren, Quan
-
Ke

Pan, P. N. Suganthan, Tay Jin Chua, “A Differential
Evolution Algorithm for the No
-
Idle Flowshop Scheduling Problem with Total
Tardiness Criterion”,
Accepted to International Journal of Production Research
,
2010.

10.

M. Fatih Tasgetiren, Quan
-
Ke Pan, P. N. Su
ganthan and Angela H
-
L Chen, “A
Discrete Artificial Bee Colony Algorithm for the Permutation Flow Shop
Scheduling Problem with Total Flowtime Criterion”, Accepted to
Inform. Sci.

(2010).

11.

M. Fatih Tasgetiren, Quan
-
Ke Pan, Yun
-
Chia Liang, “A discrete differe
ntial
evolution algorithm for the single machine total weighted tardiness problem with
sequence dependent setup times”,
Computers & Operations Research
, (2008), 36
(2009), pp. 1900
-
1915.

12.

Quan
-
Ke Pan, M. Fatih Tasgetiren, Yun
-
Chia Liang, “A Discrete
differential
evolution algorithm for the permutation flowshop scheduling problem”,
Computers & Industrial Engineering (2008),
Vol. 35, N0.4, pp.795
-
816.

13.

Quan
-
Ke Pan, M. Fatih Tasgetiren, Yun
-
Chia Liang, “A Discrete Particle Swarm
Optimization Algorithm for

the No
-
Wait Flowshop Scheduling Problem with
Makespan and Total Flowtime Criteria”,
Computers & Operations Research
35(2008)
, Vol. 35, No. 9, pp. 2807
-
2839, September 2008.
Sciencedirect Top
25 Hottest

14.

Quan
-
Ke Pan, Ling Wang, M. Fatih Tasgetiren, Bao
-
Hua
Zhao, “A hybrid discrete
particle swarm optimization algorithm for the no
-
wait flow shop scheduling
problem with makespan criterion”,
International Journal of Advanced
Manufacturing Technology (2008)

38:337

347.

15.

M. Fatih Tasgetiren, Mehmet Sevkli, Yun
-
Chia

Liang, and M. Mutlu Yenisey,
“Particle Swarm Optimization and Differential Evolution Algorithms for Job Shop
Scheduling Problem”,
International Journal of Operations Research (2006)
, vol.
3, no. 2, 2006, pp. 120
-
135.

16.

M. Fatih Tasgetiren, Yun
-
Chia Liang, M
ehmet Sevkli, and Gunes Gencyilmaz,
“Particle Swarm Optimization Algorithm for Makespan and Total Flowtime
Minimization in Permutation Flowshop Sequencing Problem”,
European Journal
of Operational Research (2007),
Vol. 177, No. 3,


pp. 1930
-
1947.
Sciencedir
ect
Top 25 Hottest.