Yazar
-
A DE based variable iterated greedy algorithm for the no-idle permutation flowshop scheduling problem with total flowtime criterion
Tasgetiren, M.F.; Pan, Q.K.; Wang, L.; Chen, A.H.L. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2011)In this paper, we present a variable iterated greedy (vIGP-DE) algorithm where its parameters (basically destruction size and cooling parameter for the simulated annealing type of acceptance criterion) are optimized by the ... -
A differential evolution algorithm for the median cycle problem
Tasgetiren, M.F.; Pan, Q.K.; Bulut, C.; Suganthan, P.N. (IEEE SSCI 2011 - Symposium Series on Computational Intelligence - SDE 2011: 2011 IEEE Symposium on Differential Evolution, 2011)This paper extends the applications of differential evolution algorithms to the Median Cycle Problem. The median cycle problem is concerned with constructing a simple cycle composed of a subset of vertices of a mixed graph. ... -
A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion
Tasgetiren, M.F.; Pan, Q.K.; Suganthan, P.N.; Jin Chua, T. (International Journal of Production Research, 2011)In this paper, we investigate the use of a continuous algorithm for the no-idle permutation flowshop scheduling (NIPFS) problem with tardiness criterion. For this purpose, a differential evolution algorithm with variable ... -
A differential evolution algorithm with variable neighborhood search for multidimensional knapsack problem
Tasgetiren, M.F.; Pan, Q.K.; Kizilay, D.; Suer, G. (2015 IEEE Congress on Evolutionary Computation, CEC 2015 - Proceedings, 2015)This paper presents a differential evolution algorithm with a variable neighborhood search to solve the multidimensional knapsack problem. Unlike the studies employing check and repair operators, we employ some sophisticated ... -
A discrete artificial bee colony algorithm for the energy-efficient no-wait flowshop scheduling problem
Tasgetiren, M.F.; Yuksel, D.; Gao, L.; Pan, Q.K.; Li, P. (Procedia Manufacturing, 2019)No-wait permutation flow shop scheduling problem (NWPFSP) is a variant of permutation flow shop scheduling problem (PFSP), where the processing of each job must be continuous from start to end without any interruption. ... -
A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem
Pan, Q.K.; Tasgetiren, M.F.; Suganthan, P.N.; Chua, T.J. (Information Sciences, 2011)In this paper, a discrete artificial bee colony (DABC) algorithm is proposed to solve the lot-streaming flow shop scheduling problem with the criterion of total weighted earliness and tardiness penalties under both the ... -
A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities
Li, J.; Pan, Q.K.; Tasgetiren, M.F. (Applied Mathematical Modelling, 2014)This paper presents a novel discrete artificial bee colony (DABC) algorithm for solving the multi-objective flexible job shop scheduling problem with maintenance activities. Performance criteria considered are the maximum ... -
A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
Tasgetiren, M.F.; Pan, Q.K.; Suganthan, P.N.; Oner, A. (Applied Mathematical Modelling, 2013)In this paper, we present a discrete artificial bee colony algorithm to solve the no-idle permutation flowshop scheduling problem with the total tardiness criterion. The no-idle permutation flowshop problem is a variant ... -
A discrete artificial bee colony algorithm for the permutation flow shop scheduling problem with total flowtime criterion
Tasgetiren, M.F.; Pan, Q.K.; Suganthan, P.N.; Chen, A.H.L. (2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010, 2010)Very recently, Jarboui et al. [1] (Computers & Operations Research 36 (2009) 2638-2646) and Tseng and Lin [2] (European Journal of Operational Research 198 (2009) 84-92) presented a novel estimation distribution algorithm ... -
A discrete artificial bee colony algorithm for the permutation flowshop scheduling problem with sequence-dependent setup times
Ince, Y.; Karabulut, K.; Tasgetiren, M.F.; Pan, Q.K. (2016 IEEE Congress on Evolutionary Computation, CEC 2016, 2016)A discrete artificial bee colony (DABC) algorithm for the permutation flowshop scheduling problem with sequence-dependent setup times (PFSP-SDST) is presented in this paper. PFSP-SDST is an important problem that has ... -
A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops
Tasgetiren, M.F.; Pan, Q.K.; Suganthan, P.N.; Chen, A.H.L. (Information Sciences, 2011)Obtaining an optimal solution for a permutation flowshop scheduling problem with the total flowtime criterion in a reasonable computational timeframe using traditional approaches and optimization tools has been a challenge. ... -
A general variable neighborhood search algorithm for the no-idle permutation flowshop scheduling problem
Tasgetiren, M.F.; Buyukdagli, O.; Pan, Q.K.; Suganthan, P.N. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013)In this study, a general variable neighborhood search (GVNS) is presented to solve no-idle permutation flowshop scheduling problem (NIPFS), where idle times are not allowed on machines. GVNS is a metaheuristic, where inner ... -
A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem
Wang, L.; Pan, Q.K.; Tasgetiren, M.F. (Computers and Industrial Engineering, 2011)This paper proposes a hybrid modified global-best harmony search (hmgHS) algorithm for solving the blocking permutation flow shop scheduling problem with the makespan criterion. First of all, the largest position value ... -
A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem
Pan, Q.K.; Suganthan, P.N.; Liang, J.J.; Tasgetiren, M.F. (Expert Systems with Applications, 2011)In this paper, a local-best harmony search (HS) algorithm with dynamic sub-harmony memories (HM), namely DLHS algorithm, is proposed to minimize the total weighted earliness and tardiness penalties for a lot-streaming flow ... -
A local-best harmony search algorithm with dynamic subpopulations
Pan, Q.K.; Suganthan, P.N.; Liang, J.J.; Tasgetiren, M.F. (Engineering Optimization, 2010)This article presents a local-best harmony search algorithm with dynamic subpopulations (DLHS) for solving the bound-constrained continuous optimization problems. Unlike existing harmony search algorithms, the DLHS algorithm ... -
A memetic algorithm with a variable block insertion heuristic for single machine total weighted tardiness problem with sequence dependent setup times
Tasgetiren, M.F.; Pan, Q.K.; Ozturkoglu, Y.; Chen, A.H.L. (2016 IEEE Congress on Evolutionary Computation, CEC 2016, 2016)In this paper, a memetic algorithm with a variable block insertion heuristic is presented to solve the single machine total weighted tardiness problem with sequence dependent setup times. Together with the traditional ... -
A multi-objective harmony search algorithm for sustainable design of floating settlements
Cubukcuoglu, C.; Chatzikonstantinou, I.; Tasgetiren, M.F.; Sariyildiz, I.S.; Pan, Q.K. (Algorithms, 2016)This paper is concerned with the application of computational intelligence techniques to the conceptual design and development of a large-scale floating settlement. The settlement in question is a design for the area of ... -
A multi-objective self-adaptive differential evolution algorithm for conceptual high-rise building design
Ekici, B.; Chatzikonstantinou, I.; Sariyildiz, I.S.; Tasgetiren, M.F.; Pan, Q.K. (2016 IEEE Congress on Evolutionary Computation, CEC 2016, 2016)This paper presents a multi-objective self-adaptive differential evolution algorithm to solve the form-finding problem of high-rise building design in the conceptual phase. The aim of the research is to reach suitable ... -
A New Heuristic for PCBs Grouping Problem with Setup Times
Huang, J.P.; Pan, Q.K.; Tasgetiren, M.F.; Huang, Y.Y. (Chinese Control Conference, CCC, 2020)In this paper, we present a new heuristic to divide a batch of printed circuit boards (PCBs) into subgroups to save the setup time for loading and unloading components from the assembly machine. In the heuristic, we propose ... -
A populated local search with differential evolution for blocking flowshop scheduling problem
Tasgetiren, M.F.; Pan, Q.K.; Kizilay, D.; Suer, G. (2015 IEEE Congress on Evolutionary Computation, CEC 2015 - Proceedings, 2015)This paper presents a populated local search algorithm through a differential evolution algorithm for solving the blocking flowshop scheduling problem under makespan criterion. Iterated greedy and iterated local search ...
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..