Ara
Toplam kayıt 17, listelenen: 11-17
Ensemble of differential evolution algorithms for electromagnetic target recognition problem
(INST ENGINEERING TECHNOLOGY-IET, 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 ...
Null Control in Linear Antenna Arrays with Ensemble Differential Evolution
(IEEE, 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 ...
Lagrangian heuristic for scheduling a steelmaking-continuous casting process
(IEEE, 2013)
One of the biggest bottlenecks in iron and steel production is the steelmaking-continuous casting (SCC) process, which consists of steel-making, re ning and continuous casting. The production scheduling of SCC is a complex ...
A Discrete Artificial Bee Colony Algorithm for the Team Orienteering Problem with Time Windows
(IEEE, 2013)
This paper presents a discrete artificial bee colony algorithm (DABC) for solving the team orienteering problem with time windows (TOPTW). The proposed algorithm employs a destruction and construction procedure to generate ...
A General Variable Neighborhood Search Algorithm for the No-Idle Permutation Flowshop Scheduling Problem
(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 Populated Iterated Greedy Algorithm with Inver-Over Operator for Traveling Salesman Problem
(SPRINGER-VERLAG BERLIN, 2013)
In this study, we propose a populated iterated greedy algorithm with an Inver-Over operator to solve the traveling salesman problem. The iterated greedy (IG) algorithm is mainly based on the central procedures of destruction ...
Metaheuristic Algorithms for the Quadratic Assignment Problem
(IEEE, 2013)
This paper presents two meta-heuristic algorithms to solve the quadratic assignment problem. The iterated greedy algorithm has two main components, hich are destruction and construction procedures. The algorithm starts ...