Author
Now showing items 1-20 of 47
-
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. (SPRINGER-VERLAG BERLIN, 2012)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, O.; Suganthan, P.N. (IEEE, 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.; Chua, T.J. (TAYLOR & FRANCIS LTD, 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. (IEEE, 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 lot-streaming flow shop scheduling problem
Pan, Q.K.; Tasgetiren, M.F.; Suganthan, P.N.; Chua, T.J. (ELSEVIER SCIENCE INC, 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.Q.; Pan, Q.K.; Tasgetiren, M.F. (ELSEVIER SCIENCE INC, 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. (ELSEVIER SCIENCE INC, 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. (IEEE, 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. (IEEE, 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. (ELSEVIER SCIENCE INC, 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. (SPRINGER-VERLAG BERLIN, 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. (PERGAMON-ELSEVIER SCIENCE LTD, 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. (PERGAMON-ELSEVIER SCIENCE LTD, 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. (TAYLOR & FRANCIS LTD, 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. (IEEE, 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. (MDPI AG, 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. (IEEE, 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 Populated Local Search with Differential Evolution for Blocking Flowshop Scheduling Problem
Tasgetiren, M.F.; Pan, Q.K.; Kizilay, D.; Suer, G. (IEEE, 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 ... -
A self-adaptive global best harmony search algorithm for continuous optimization problems
Pan, Q.K.; Suganthan, P.N.; Tasgetiren, M.F.; Liang, J.J. (ELSEVIER SCIENCE INC, 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. (IEEE, 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 ...
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..