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 economic lot scheduling problem
Tasgetiren, M.F.; Bulut, O.; Fadiloglu, M.M. (IEEE SSCI 2011 - Symposium Series on Computational Intelligence - SDE 2011: 2011 IEEE Symposium on Differential Evolution, 2011)In this study we provide a Differential Evolution (DE) based heuristic to solve the Economic Lot Scheduling Problem (ELSP) under basic period approach. The problem is to find the best cyclic production schedule of n items ... -
A differential evolution algorithm for the extraction of complex natural resonance frequencies of electromagnetic targets
Secmen, M.; Tasgetiren, M.F. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2011)This paper presents a differential evolution algorithm in order to find unique resonance frequencies of an electromagnetic target in the resonance scattering region. These frequencies are estimated from the roots of Laplace ... -
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 a variable neighborhood search for constrained function optimization
Tasgetiren, M.F.; Suganthan, P.N.; Ozcan, S.; Kizilay, D. (Adaptation, Learning, and Optimization, 2015)In this paper, a differential evolution algorithm based on a variable neighborhood search algorithm (DE_VNS) is proposed in order to solve the constrained real-parameter optimization problems. The performance of DE algorithm ... -
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 assignment and parallel machine scheduling problem in DYO paint company
Kizilay, D.; Tasgetiren, M.F.; Bulut, C.; Bostan, B. (Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014, 2014)This paper presents a discrete artificial bee colony algorithm to solve the assignment and parallel machine scheduling problem in DYO paint company. The aim of this paper is to develop some algorithms to be employed in the ... -
A discrete artificial bee colony algorithm for the economic lot scheduling problem
Tasgetiren, M.F.; Bulut, O.; Fadiloglu, M.M. (2011 IEEE Congress of Evolutionary Computation, CEC 2011, 2011)In this study we present a discrete artificial bee colony (DABC) algorithm to solve the economic lot scheduling problem (ELSP) under extended basic period (EBP) approach and power-of-two (PoT) policy. In specific, our ... -
A discrete artificial bee colony algorithm for the Economic Lot Scheduling problem with returns
Bulut, O.; Tasgetiren, M.F. (Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014, 2014)In this study, we model the Economic Lot Scheduling problem with returns (ELSPR) under the basic period (BP) policy with power-of-two (PoT) multipliers, and solve it with a discrete artificial bee colony (DABC) algorithm. ... -
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 discrete artificial bee colony algorithm for the traveling salesman problem with time windows
Karabulut, K.; Tasgetiren, M.F. (2012 IEEE Congress on Evolutionary Computation, CEC 2012, 2012)This paper presents a discrete artificial bee colony algorithm (DABC) for solving the traveling salesman problem with time windows (TSPTW) in order to minimize the total travel cost of a given tour. TSPTW is a difficult ... -
A discrete event simulation procedure for validating programs of requirements: The case of hospital space planning
Cubukcuoglu, C.; Nourian, P.; Sariyildiz, I.S.; Tasgetiren, M.F. (SoftwareX, 2020)This paper introduces a Discrete-Event Simulation (DES) tool developed as a parametric CAD program for validating a program of requirements (PoR) for hospital space planning. The DES model simulates the procedures of ... -
A discrete harmony search algorithm for the economic lot scheduling problem with power of two policy
Tasgetiren, M.F.; Bulut, O.; Fadiloglu, M.M. (2012 IEEE Congress on Evolutionary Computation, CEC 2012, 2012)In this paper, we present a problem specific discrete harmony search (DHS) algorithms to solve the economic lot scheduling problem (ELSP) under the extended basic period (EBP) approach and power-of-two (PoT) policy. In ...
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..