Tür
Toplam kayıt 320, listelenen: 1-20
-
A 2-dimensional model of polynomial type for oscillatory ATM-Wipl dynamics in p53 network
(2017 10th International Conference on Electrical and Electronics Engineering, ELECO 2017, 2018)Under gamma irradiation, p53 gene regulatory network is able to exhibit three different modes, namely low state, oscillations, and high state. There are experimental studies demonstrating that oscillatory behaviour of p53 ... -
A Bus Crew Scheduling Problem with Eligibility Constraints and Time Limitations
(Transportation Research Procedia, 2017)In this study, we consider a real life crew scheduling problem (CSP) of a public bus transportation authority, where the objective is to determine the optimal number of different types of crew members with a minimum cost ... -
A Case Study on the Selection of Optimum Loop Units for the Deployable Arch Structures Exposed to Lateral and Non-uniform Gravity Loads
(Procedia Manufacturing, 2020)Radially deployable arches may be created by using various types of units. However, for any deployable structure to be constructed in real life, it should satisfy the structural regulations and codes. Despite various ... -
A combined technology for wildfire detection using HS/RF
(5th International Conference on Wireless and Mobile Communications, ICWMC 2009, 2009)This paper addresses an effective early detection system of wildfires using high resolution images from low-light sensitive cameras linked to an innovative HS/RF (High Speed/Radio Frequency) communications grid. Using data ... -
A comparison between building energy simulation and measurement results for a municipality building
(CESB 2016 - Central Europe Towards Sustainable Building 2016: Innovations for Sustainable Future, 2016)European Commission published the core of Energy Performance of Buildings Directive (EPBD) in 2002 setting some compulsorics for the member states to develop national methodologies for increasing the energy performance of ... -
A comparison of feature selection algorithms for cancer classification through gene expression data: Leukemia case
(2017 10th International Conference on Electrical and Electronics Engineering, ELECO 2017, 2018)In this study, three different feature selection algorithms are compared using Support Vector Machines as classifier for cancer classification through gene expression data. The ability of feature selection algorithms to ... -
A computational intelligence decision-support environment for architectural and building design: CIDEA
(2016 IEEE Congress on Evolutionary Computation, CEC 2016, 2016)Environmentally friendly and comfortable buildings are a much sought after goal in today's architectural practice. In order to improve energy consumption of buildings without sacrificing indoor comfort, careful consideration ... -
A DE based variable iterated greedy algorithm for the no-idle permutation flowshop scheduling problem with total flowtime criterion
(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
(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
(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
(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 with variable neighborhood search for multidimensional knapsack problem
(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 disassembly line balancing problem with fixed number of workstations
(European Journal of Operational Research, 2016)In this study, a Disassembly Line Balancing Problem with a fixed number of workstations is considered. The product to be disassembled comprises various components, which are referred to as its parts. There is a specified ... -
A discrete artificial bee colony algorithm for the assignment and parallel machine scheduling problem in DYO paint company
(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
(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
(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
(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 permutation flow shop scheduling problem with total flowtime criterion
(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
(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 traveling salesman problem with time windows
(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 ...
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
