Ara
Toplam kayıt 137, listelenen: 41-50
Null control in linear antenna arrays with ensemble differential evolution
(Proceedings of the 2013 IEEE Symposium on Differential Evolution, SDE 2013 - 2013 IEEE Symposium Series on Computational Intelligence, SSCI 2013, 2013)
This paper describes a synthesis method for null insertion in linear antenna array geometries by using newly proposed ensemble differential evolution (DE) algorithm. The given ensemble DE algorithm uses the advantages of ...
Metaheuristic algorithms for the quadratic assignment problem
(Proceedings of the 2013 IEEE Symposium on Computational Intelligence in Production and Logistics Systems, CIPLS 2013 - 2013 IEEE Symposium Series on Computational Intelligence, SSCI 2013, 2013)
This paper presents two meta-heuristic algorithms to solve the quadratic assignment problem. The iterated greedy algorithm has two main components, which are destruction and construction procedures. The algorithm starts ...
Ensemble of differential evolution algorithms for electromagnetic target recognition problem
(IET Radar, Sonar and Navigation, 2013)
In this study, an ensemble of differential evolution (DE) algorithms is presented to classify electromagnetic targets in resonance scattering region. The algorithm aims to synthesize a special incident signal for each ...
A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
(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 discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
(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 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 ...
A discrete harmony search algorithm for the economic lot scheduling problem with power of two policy
(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 ...
A variable iterated greedy algorithm with differential evolution for solving no-idle flowshops
(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 ...
Solving fuzzy job-shop scheduling problem by a hybrid PSO algorithm
(Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012)
This paper proposes a hybrid particle swarm optimization (PSO) algorithm for solving the job-shop scheduling problem with fuzzy processing times. The objective is to minimize the maximum fuzzy completion time, i.e., the ...
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 ...