Yazar
-
A self-adaptive global best harmony search algorithm for continuous optimization problems
Pan, Q.K.; Suganthan, P.N.; Tasgetiren, M.F.; Liang, J.J. (Applied Mathematics and Computation, 2010)This paper presents a self-adaptive global best harmony search (SGHS) algorithm for solving continuous optimization problems. In the proposed SGHS algorithm, a new improvisation scheme is developed so that the good information ... -
A variable block insertion heuristic for permutation flowshops with makespan criterion
Tasgetiren, M.F.; Pan, Q.K.; Kizilay, D.; Velez-Gallego, M.C. (2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings, 2017)This paper proposes a populated variable block insertion heuristic (PVBIH) algorithm for solving the permutation flowshop scheduling problem with the makespan criterion. The PVBIH algorithm starts with a minimum block size ... -
A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion
Kizilay, D.; Tasgetiren, M.F.; Pan, Q.K.; Gao, L. (Algorithms, 2019)In this paper, we propose a variable block insertion heuristic (VBIH) algorithm to solve the permutation flow shop scheduling problem (PFSP). The VBIH algorithm removes a block of jobs from the current solution. It applies ... -
A Variable Block Insertion Heuristic for the Blocking Flowshop Scheduling Problem with Total Flowtime Criterion
Tasgetiren, M.F.; Pan, Q.K.; Kizilay, D.; Gao, K.Z. (Algorithms, 2016)In this paper, we present a variable block insertion heuristic (VBIH) algorithm to solve the blocking flowshop scheduling problem with the total flowtime criterion. In the VBIH algorithm, we define a minimum and a maximum ... -
A variable iterated greedy algorithm with differential evolution for solving no-idle flowshops
Tasgetiren, M.F.; Pan, Q.K.; Suganthan, P.N.; Buyukdagli, O. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012)In this paper, we present a variable iterated greedy algorithm where its parameters (basically destruction size and probability of whether or not to apply the iterated greedy algorithm to an individual) are optimized by ... -
A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
Tasgetiren, M.F.; Pan, Q.K.; Suganthan, P.N.; Buyukdagli, O. (Computers and Operations Research, 2013)This paper presents a variable iterated greedy algorithm (IG) with differential evolution (vIG-DE), designed to solve the no-idle permutation flowshop scheduling problem. In an IG algorithm, size d of jobs are removed from ... -
A Variable Iterated Local Search Algorithm for Energy-Efficient No-idle Flowshop Scheduling Problem
Tasgetiren, M.F.; Oztop, H.F.; Gao, L.; Pan, Q.K.; Li, X. (Procedia Manufacturing, 2019)No-idle permutation flowshop scheduling problem (NIPFSP) is a well-known NP-hard problem, in which each machine must perform the jobs consecutively without any idle time. Even though various algorithms have been proposed ... -
An Effective Discrete Artificial Bee Colony Algorithm for Scheduling an Automatic-Guided-Vehicle in a Linear Manufacturing Workshop
Zou, W.Q.; Pan, Q.K.; Tasgetiren, M.F. (IEEE Access, 2020)This paper deals with a new automatic guided vehicle (AGV) scheduling problem from the material handling process in a linear manufacturing workshop. The problem is to determine a sequence of Cells for AGV to travel to ... -
An effective discrete harmony search algorithm for flexible job shop scheduling problem with fuzzy processing time
Gao, K.Z.; Suganthan, P.N.; Pan, Q.K.; Tasgetiren, M.F. (International Journal of Production Research, 2015)This study addresses flexible job shop scheduling problem (FJSP) with fuzzy processing time. The fuzzy or uncertainty of processing time is one of seven characteristics in remanufacturing. A discrete harmony search (DHS) ... -
An energy-efficient permutation flowshop scheduling problem
Oztop, H.; Tasgetiren, M.F.; Tursel Eliiyi, D.; Pan, Q.K.; Kandiller, L. (Expert Systems with Applications, 2020)The permutation flowshop scheduling problem (PFSP) has been extensively explored in scheduling literature because it has many real-world industrial implementations. In some studies, multiple objectives related to production ... -
An energy-efficient single machine scheduling with release dates and sequence-dependent setup times
Eliiyi, U.; Tasgetiren, M.F.; Kizilay, D.; Oztop, H.; Pan, Q.K. (GECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion, 2018)This study considers single machine scheduling with the machine operating at varying speed levels for different jobs with release dates and sequence-dependent setup times, in order to examine the trade-off between makespan ... -
An ensemble of differential evolution algorithms for constrained function optimization
Tasgetiren, M.F.; Suganthan, P.N.; Pan, Q.K.; Mallipeddi, R.; Sarman, S. (2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010, 2010)This paper presents an ensemble of differential evolution algorithms employing the variable parameter search and two distinct mutation strategies in the ensemble to solve real-parameter constrained optimization problems. ... -
An ensemble of differential evolution algorithms with variable neighborhood search for constrained function optimization
Paldrak, M.; Tasgetiren, M.F.; Suganthan, P.N.; Pan, Q.K. (2016 IEEE Congress on Evolutionary Computation, CEC 2016, 2016)In this paper, an ensemble of differential evolution algorithms based on a variable neighborhood search algorithm (EDE-VNS) is proposed so as to solve the constrained real parameter-optimization problems. The performance ... -
An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
Tasgetiren, M.F.; Suganthan, P.N.; Pan, Q.K. (Applied Mathematics and Computation, 2010)In this paper, an ensemble of discrete differential evolution algorithms with parallel populations is presented. In a single populated discrete differential evolution (DDE) algorithm, the destruction and construction (DC) ... -
An improved discrete artificial bee colony algorithm for the distributed permutation flowshop scheduling problem with preventive maintenance
Mao, J.; Hu, X.; Pan, Q.K.; Miao, Z.; He, C.; Tasgetiren, M.F. (Chinese Control Conference, CCC, 2020)The distributed permutation flowshop scheduling problem with preventive maintenance operator (PM/DPFSP) is closely related to modem industry. This paper presents an improved discrete artificial bee colony (IDABC) algorithm ... -
An Iterated Greedy Algorithm for Distributed Blocking Flowshop Problems with Makespan Minimization
Chen, S.; Pan, Q.K.; Hu, X.; Tasgetiren, M.F. (Chinese Control Conference, CCC, 2020)In this paper, we study a distributed blocking flowshop scheduling problem (DBFSP) that is an extension of the traditional blocking flowshop scheduling problem (BFSP), in which an additional decision of which factory to ... -
An iterated greedy algorithm for the hybrid flowshop problem with makespan criterion
Kizilay, D.; Tasgetiren, M.F.; Pan, Q.K.; Wang, L. (IEEE SSCI 2014 - 2014 IEEE Symposium Series on Computational Intelligence - CIPLS 2014: 2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems, Proceedings, 2014)The main contribution of this paper is to present some novel constructive heuristics for the the hybrid flowshop scheduling (HFS) problem with the objective of minimizing the makespan for the first time in the literature. ... -
An iterated local search algorithm for distributed assembly permutation flowshop problem
Huang, Y.Y.; Pan, Q.K.; Hu, X.; Tasgetiren, M.F.; Huang, J.P. (Chinese Control Conference, CCC, 2020)Nowadays, the distributed assembly permutation flowshop problem (DAPFSP) has important applications in practice. In this paper, we propose a group iterated local search (gILS) algorithm to solve the problem with total ... -
Artificial bee colony algorithm for scheduling and rescheduling fuzzy flexible job shop problem with new job insertion
Gao, K.Z.; Suganthan, P.N.; Pan, Q.K.; Tasgetiren, M.F.; Sadollah, A. (Knowledge-Based Systems, 2016)This study addresses flexible job shop scheduling problem (FJSP) with two constraints, namely fuzzy processing time and new job insertion. The uncertainty of processing time and new job insertion are two scheduling related ... -
Differential evolution algorithm with ensemble of parameters and mutation strategies
Mallipeddi, R.; Suganthan, P.N.; Pan, Q.K.; Tasgetiren, M.F. (Applied Soft Computing Journal, 2011)Differential evolution (DE) has attracted much attention recently as an effective approach for solving numerical optimization problems. However, the performance of DE is sensitive to the choice of the mutation strategy and ...
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..