M. F. Tasgetiren

发表

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 .

Particle Swarm Optimization Algorithm for Permutation Flowshop Sequencing Problem

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

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..

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.

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 differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion

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

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 evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times

M. F. Tasgetiren, Korhan Karabulut, Damla Kizilay, 2022, Comput. 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..

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 .

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

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

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..

Dynamic multi-swarm particle swarm optimizer with harmony search

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

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).

A Memetic Algorithm for the Bi-Objective Quadratic Assignment Problem

M. Fatih Tasgetiren, Liang Gao, I. Sevil Sariyildiz, 2019, Procedia Manufacturing.

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

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

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 discrete event simulation procedure for validating programs of requirements: The case of hospital space planning

I. Sevil Sariyildiz, Cemre Cubukcuoglu, Pirouz Nourian, 2020, SoftwareX.

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 Differential Evolution algorithm for the economic lot scheduling problem

Mehmet Fatih Tasgetiren, Önder Bulut, Mehmet Murat Fadiloglu, 2011, 2011 IEEE Symposium on Differential Evolution (SDE).

An ensemble of differential evolution algorithms for constrained function optimization

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

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

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

Multi-objective harmony search algorithm for layout design in theatre hall acoustics

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai N. Suganthan, 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

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 .

A discrete harmony search algorithm for the economic lot scheduling problem with power of two policy

Mehmet Fatih Tasgetiren, Önder Bulut, Mehmet Murat Fadiloglu, 2012, 2012 IEEE Congress on Evolutionary Computation.

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..

Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ling Wang, 2010, Expert Syst. Appl..

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 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 local-best harmony search algorithm with dynamic subpopulations

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

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.

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

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

Differential evolution algorithm with ensemble of parameters and mutation strategies

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

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.

An improved discrete artificial bee colony algorithm for the distributed permutation flowshop scheduling problem with preventive maintenance

Zhonghua Miao, Chuangxin He, M. F. Tasgetiren, 2020, 2020 39th Chinese Control Conference (CCC).

A discrete artificial bee colony algorithm for the permutation flowshop scheduling problem with sequence-dependent setup times

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

A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities

M. Fatih Tasgetiren, Junqing Li, Quan-Ke Pan, 2014 .

An artificial bee colony algorithm for the economic lot scheduling problem

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

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 artificial bee colony algorithm for the team orienteering problem with time windows

Mehmet Fatih Tasgetiren, Korhan Karabulut, M. F. Tasgetiren, 2013, 2013 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS).

A discrete artificial bee colony algorithm for the traveling salesman problem with time windows

Mehmet Fatih Tasgetiren, Korhan Karabulut, M. F. Tasgetiren, 2012, 2012 IEEE Congress on Evolutionary Computation.

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 discrete artificial bee colony algorithm for the economic lot scheduling problem

Mehmet Fatih Tasgetiren, Önder Bulut, Mehmet Murat Fadiloglu, 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).

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 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.

Optimal Design of new Hospitals: A Computational Workflow for Stacking, Zoning, and Routing

M. F. Tasgetiren, I. Sariyildiz, Pirouz Nourian, 2022, Automation in Construction.

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

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

A discrete differential evolution algorithm for the permutation flowshop scheduling problem

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

Artificial bee colony algorithm for scheduling and rescheduling fuzzy flexible job shop problem with new job insertion

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai N. Suganthan, 2016, Knowl. Based Syst..

Effective ensembles of heuristics for scheduling flexible job shop problem with new job insertion

Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai N. Suganthan, 2015, Comput. Ind. Eng..

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.

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).

A discrete differential evolution algorithm for single machine total weighted tardiness problem with sequence dependent setup times

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

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).

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..

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.

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).

Metaheuristics for Common Due Date Total Earliness and Tardiness Single Machine Scheduling Problem

Quan-Ke Pan, Ponnuthurai Nagaratnam Suganthan, Yun-Chia Liang, 2009 .

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 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 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..

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.

Particle Swarm Optimization Algorithm for Makespan and Maximum Lateness Minimization in Permutation Flowshop Sequencing Problem

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

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 discrete artificial bee colony algorithm for distributed hybrid flowshop scheduling problem with sequence-dependent setup times

Xinyu Li, M. Fatih Tasgetiren, Liang Gao, 2020, Int. J. Prod. Res..

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).

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.

A differential evolution algorithm with variable neighborhood search for multidimensional knapsack problem

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