M. Tasgetiren

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Yun-Chia Liang, 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

Metaheuristic algorithms for the hybrid flowshop scheduling problem

Quan-Ke Pan, M. Fatih Tasgetiren, Hande Öztop, 2019, Comput. Oper. Res..

Metaheuristics for Energy-Efficient No-Wait Flowshops: A Trade-off Between Makespan and Total Energy Consumption

Quan-Ke Pan, Damla Yüksel, Levent Kandiller, 2020, 2020 IEEE Congress on Evolutionary Computation (CEC).

A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ling Wang, 2011, Comput. Ind. Eng..

A Variable Block Insertion Heuristic for the Blocking Flowshop Scheduling Problem with Total Flowtime Criterion

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Damla Kizilay, 2016, Algorithms.

An Effective Multi-Objective Artificial Bee Colony Algorithm for Energy Efficient Distributed Job Shop Scheduling

M. Fatih Tasgetiren, Liang Gao, Quan-Ke Pan, 2019, Procedia Manufacturing.

An energy-efficient permutation flowshop scheduling problem

M. Fatih Tasgetiren, Hande Öztop, Deniz Türsel Eliiyi, 2020, Expert Syst. Appl..

Intelligent optimization under the makespan constraint: Rapid evaluation mechanisms based on the critical machine for the distributed flowshop group scheduling problem

Yu-yan Han, Yuting Wang, K. Gao, 2023, European Journal of Operational Research.

An Adaptive Iterated Greedy algorithm for distributed mixed no-idle permutation flowshop scheduling problems

Liang Gao, Mehmet Fatih Tasgetiren, Quan-Ke Pan, 2021, Swarm Evol. Comput..

A Novel General Variable Neighborhood Search through Q-Learning for No-Idle Flowshop Scheduling

Hande Öztop, Mehmet Fatih Tasgetiren, Quan-Ke Pan, 2020, 2020 IEEE Congress on Evolutionary Computation (CEC).

A Variable Iterated Local Search Algorithm for Energy-Efficient No-idle Flowshop Scheduling Problem

Xinyu Li, M. Fatih Tasgetiren, Liang Gao, 2019, Procedia Manufacturing.

A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai N. Suganthan, 2013, Comput. Oper. Res..

A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai N. Suganthan, 2011, Inf. Sci..

A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Yun-Chia Liang, 2008, Comput. Oper. Res..

A Multi-Objective Harmony Search Algorithm for Sustainable Design of Floating Settlements

Mehmet Fatih Tasgetiren, Quan-Ke Pan, I. Sevil Sariyildiz, 2016, Algorithms.

Solving lot-streaming flow shop scheduling problems using a discrete harmony search algorithm

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai N. Suganthan, 2010, IEEE Congress on Evolutionary Computation.

A Harmony Search Algorithm with Ensemble of Parameter Sets

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai N. Suganthan, 2009, 2009 IEEE Congress on Evolutionary Computation.

Future Trends and Current State of Smart City Concepts: A Survey

Ondrej Krejcar, M. Fatih Tasgetiren, Ayca Kirimtat, 2020, IEEE Access.

Differential evolution algorithm with ensemble of parameters and mutation strategies

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai N. Suganthan, 2011, Appl. Soft Comput..

A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion

Quan-Ke Pan, Ponnuthurai Nagaratnam Suganthan, M. Fatih Tasgetiren, 2013 .

A Discrete Particle Swarm Optimization Algorithm for the Permutation Flowshop Sequencing Problem with Makespan Criterion

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Yun-Chia Liang, 2006, SGAI Conf..

An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai N. Suganthan, 2010, Appl. Math. Comput..

An effective iterated greedy algorithm for solving a multi-compartment AGV scheduling problem in a matrix manufacturing workshop

M. Fatih Tasgetiren, Quan-Ke Pan, Wen-Qiang Zou, 2020, Appl. Soft Comput..

An Effective Discrete Artificial Bee Colony Algorithm for Scheduling an Automatic-Guided-Vehicle in a Linear Manufacturing Workshop

M. Fatih Tasgetiren, Quan-Ke Pan, Wen-Qiang Zou, 2020, IEEE Access.

Metaheuristic algorithms for the quadratic assignment problem

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai N. Suganthan, 2013, 2013 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS).

A discrete artificial bee colony algorithm for the assignment and parallel machine scheduling problem in DYO paint company

Mehmet Fatih Tasgetiren, Damla Kizilay, Önder Bulut, 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

Evolutionary Computation for Theatre Hall Acoustics

Mehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan, Ayca Kirimtat, 2018, Optimization in Industry.

Control of PV integrated shading devices in buildings: A review

Ayca Kirimtat, O. Krejcar, P. Brida, 2022, Building and Environment.

Multi-objective optimization based on self-adaptive differential evolution algorithm

Mehmet Fatih Tasgetiren, A. Kai Qin, Ponnuthurai N. Suganthan, 2007, 2007 IEEE Congress on Evolutionary Computation.

Hospital layout design renovation as a Quadratic Assignment Problem with geodesic distances

I. Sevil Sariyildiz, Cemre Cubukcuoglu, Pirouz Nourian, 2021 .

A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai N. Suganthan, 2011, Inf. Sci..

A populated local search with differential evolution for blocking flowshop scheduling problem

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Damla Kizilay, 2015, 2015 IEEE Congress on Evolutionary Computation (CEC).

A variable block insertion heuristic for permutation flowshops with makespan criterion

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Damla Kizilay, 2017, 2017 IEEE Congress on Evolutionary Computation (CEC).

Multi-zone optimisation of high-rise buildings using artificial intelligence for sustainable metropolises. Part 2: Optimisation problems, algorithms, results, and method validation

Michela Turrin, I. Sevil Sariyildiz, Berk Ekici, 2021, Solar Energy.

Optimising High-Rise Buildings for Self-Sufficiency in Energy Consumption and Food Production Using Artificial Intelligence Case of Europoint Complex in Rotterdam

M. F. Tasgetiren, M. Turrin, Berk Ekici, 2022 .

An artificial bee colony algorithm for the economic lot scheduling problem

Onder Bulut, M. Fatih Tasgetiren, M. F. Tasgetiren, 2014 .

A variable iterated greedy algorithm for the traveling salesman problem with time windows

Korhan Karabulut, M. Fatih Tasgetiren, Korhan Karabulut, 2014, Inf. Sci..

A Variable Block Insertion Heuristic for Solving Permutation Flow Shop Scheduling Problem with Makespan Criterion

Liang Gao, Mehmet Fatih Tasgetiren, Quan-Ke Pan, 2019, Algorithms.

An iterated greedy algorithm for the hybrid flowshop problem with makespan criterion

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Damla Kizilay, 2014, 2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS).

A Populated Iterated Greedy Algorithm with Inver-Over Operator for Traveling Salesman Problem

Mehmet Fatih Tasgetiren, Damla Kizilay, Ozge Buyukdagli, 2013, SEMCCO.

An Ensemble of Meta-Heuristics for the Energy-Efficient Blocking Flowshop Scheduling Problem

Damla Kizilay, Gürsel A. Süer, M. Fatih Tasgetiren, 2019, Procedia Manufacturing.

An effective discrete harmony search algorithm for flexible job shop scheduling problem with fuzzy processing time

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai Nagaratnam Suganthan, 2015 .

Dynamic multi-swarm particle swarm optimizer with harmony search

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai N. Suganthan, 2011, Expert Syst. Appl..

A self-adaptive global best harmony search algorithm for continuous optimization problems

Jing J. Liang, Mehmet Fatih Tasgetiren, Quan-Ke Pan, 2010, Appl. Math. Comput..

A Multi-Populated Differential Evolution Algorithm for Solving Constrained Optimization Problem

Mehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan, M. F. Tasgetiren, 2006, 2006 IEEE International Conference on Evolutionary Computation.

An evolution strategy approach to the team orienteering problem with time windows

M. Fatih Tasgetiren, Korhan Karabulut, Korhan Karabulut, 2020, Comput. Ind. Eng..

Differential Evolution Algorithm for Permutation Flowshop Sequencing Problem with Makespan Criterion

Mehmet Sevkli, M. Fatih Tasgetiren, 梁音勻嘉, 2004 .

A memetic algorithm with a variable block insertion heuristic for single machine total weighted tardiness problem with sequence dependent setup times

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Yucel Ozturkoglu, 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

A New Heuristic for PCBs Grouping Problem with Setup Times

Quan-Ke Pan, Ying-Ying Huang, M. F. Tasgetiren, 2020, 2020 39th Chinese Control Conference (CCC).

OPTIMUS: Self-Adaptive Differential Evolution with Ensemble of Mutation Strategies for Grasshopper Algorithmic Modeling

Mehmet Fatih Tasgetiren, I. Sevil Sariyildiz, Cemre Cubukcuoglu, 2019, Algorithms.

A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem

Mehmet Fatih Tasgetiren, Yun-Chia Liang, Mehmet Sevkli, 2007, Eur. J. Oper. Res..

Modeling and optimization of multiple traveling salesmen problems: An evolution strategy approach

Mehmet Fatih Tasgetiren, Korhan Karabulut, Hande Öztop, 2021, Comput. Oper. Res..

Differential Evolution Algorithms for the Generalized Assignment problem

Mehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan, Tay Jin Chua, 2009, 2009 IEEE Congress on Evolutionary Computation.

A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion

M. F. Tasgetiren, Ling Wang, Q. Pan, 2008 .

A local-best harmony search algorithm with dynamic subpopulations

Quan-Ke Pan, Ponnuthurai Nagaratnam Suganthan, Jing Liang, 2010 .

Dynamic multi-swarm particle swarm optimizer with local search for Large Scale Global Optimization

Jing J. Liang, Mehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan, 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

Multi-performance based computational model for the cuboid open traveling salesman problem in a smart floating city

Ondrej Krejcar, Enrique Herrera-Viedma, Ayca Kirimtat, 2021 .

Particle Swarm Optimization Algorithm for Permutation Flowshop Sequencing Problem

Mehmet Fatih Tasgetiren, Yun-Chia Liang, Mehmet Sevkli, 2004, ANTS Workshop.

A discrete differential evolution algorithm for the permutation flowshop scheduling problem

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Yun-Chia Liang, 2007, GECCO '07.

Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Hande Öztop, 2021, Comput. Oper. Res..

Ensemble of metaheuristics for energy-efficient hybrid flowshops: Makespan versus total energy consumption

M. Fatih Tasgetiren, Liang Gao, Hande Öztop, 2020, Swarm Evol. Comput..

A Variable Block Insertion Heuristic for Single Machine with Release Dates and Sequence Dependent Setup Times for Makespan Minimization

Mehmet Fatih Tasgetiren, Damla Kizilay, Liang Gao, 2019, 2019 IEEE Symposium Series on Computational Intelligence (SSCI).

A General Variable Neighborhood Search for the NoIdle Flowshop Scheduling Problem with Makespan Criterion

Mehmet Fatih Tasgetiren, Liang Gao, Hande Öztop, 2019, 2019 IEEE Symposium Series on Computational Intelligence (SSCI).

Energy-Efficient Single Machine Total Weighted Tardiness Problem with Sequence-Dependent Setup Times

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Hande Öztop, 2018, ICIC.

Iterated greedy algorithms for the hybrid flowshop scheduling with total flow time minimization

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Hande Öztop, 2018, GECCO.

A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion

M. F. Tasgetiren, P. Suganthan, Q. Pan, 2011 .

Upper bounds on Taillard’s benchmark suite for the no-wait flowshop scheduling problem with makespan criterion

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai N. Suganthan, 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

A Discrete Differential Evolution Algorithm for the No-Wait Flowshop Scheduling Problem with Total Flowtime Criterion

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai N. Suganthan, 2007, 2007 IEEE Symposium on Computational Intelligence in Scheduling.

A Variable Block Insertion Heuristic for the Energy-Efficient Permutation Flowshop Scheduling with Makespan Criterion

Quan-Ke Pan, M. Fatih Tasgetiren, Hande Öztop, 2020 .

Variable block insertion heuristic for the quadratic assignment problem

Quan-Ke Pan, Yucel Ozturkoglu, M. Fatih Tasgetiren, 2017, 2017 IEEE Congress on Evolutionary Computation (CEC).

Particle swarm optimization algorithm for single machine total weighted tardiness problem

Mehmet Fatih Tasgetiren, Yun-Chia Liang, Mehmet Sevkli, 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

A Novel Differential Evolution Algorithm with Q-Learning for Economical and Statistical Design of X-Bar Control Charts

Damla Kizilay, Ahmad Abdulla Al-Buenain, Ozge Buyukdagli, 2020, 2020 IEEE Congress on Evolutionary Computation (CEC).

A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem

Jing J. Liang, Mehmet Fatih Tasgetiren, Quan-Ke Pan, 2011, Expert Syst. Appl..

A genetic algorithm for the orienteering problem

Alice E. Smith, M. F. Tasgetiren, Alice E. Smith, 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

A Genetic Algorithm with an Adaptive Penalty Function for the Orienteering Problem

M. F. Tasgetiren, M. Tasgetiren, 2005 .

An energy-efficient bi-objective no-wait permutation flowshop scheduling problem to minimize total tardiness and total energy consumption

M. Fatih Tasgetiren, Liang Gao, Damla Yüksel, 2020, Comput. Ind. Eng..

A Discrete Artificial Bee Colony Algorithm for the Energy-Efficient No-Wait Flowshop Scheduling Problem

M. Fatih Tasgetiren, Liang Gao, Peigen Li, 2019, Procedia Manufacturing.

A Discrete Particle Swarm Optimization Algorithm for Single Machine Total Earliness and Tardiness Problem with a Common Due Date

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Yun-Chia Liang, 2006, 2006 IEEE International Conference on Evolutionary Computation.

An iterated local search algorithm for distributed assembly permutation flowshop problem

Ying-Ying Huang, Quan-ke Pan, XiaoLu Hu, 2020, 2020 39th Chinese Control Conference (CCC).

A discrete artificial bee colony algorithm for the permutation flow shop scheduling problem with total flowtime criterion

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai N. Suganthan, 2010, IEEE Congress on Evolutionary Computation.

Multi-zone optimisation of high-rise buildings using artificial intelligence for sustainable metropolises. Part 1: Background, methodology, setup, and machine learning results

Michela Turrin, I. Sevil Sariyildiz, Berk Ekici, 2021, Solar Energy.

Design of multi-product multi-period two-echelon supply chain network to minimize bullwhip effect through differential evolution

Mehmet Fatih Tasgetiren, Ozgur Kabadurmus, M. Serdar Erdogan, 2017, 2017 IEEE Congress on Evolutionary Computation (CEC).

Addressing the high-rise form finding problem by evolutionary computation

Mehmet Fatih Tasgetiren, I. Sevil Sariyildiz, Berk Ekici, 2015, 2015 IEEE Congress on Evolutionary Computation (CEC).

Dynamic multi-swarm particle swarm optimizer with local search for Large Scale Global Optimization

Jing J. Liang, P. Suganthan, M. Tasgetiren, 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).