Search
Now showing items 131-140 of 162
A Variable Iterated Greedy Algorithm with Differential Evolution for Solving No-Idle Flowshops
(SPRINGER-VERLAG BERLIN, 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
(SPRINGER-VERLAG BERLIN, 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 discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem
(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 total flowtime minimization in permutation flow shops
(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 hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem
(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 ...
Dynamic multi-swarm particle swarm optimizer with harmony search
(PERGAMON-ELSEVIER SCIENCE LTD, 2011)
In this paper, the dynamic multi-swarm particle swarm optimizer (DMS-PSO) is improved by hybridizing it with the harmony search (HS) algorithm and the resulting algorithm is abbreviated as DMS-PSO-HS. We present a novel ...
A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem
(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 ...
Differential evolution algorithm with ensemble of parameters and mutation strategies
(ELSEVIER, 2011)
Differential evolution (DE) has attracted much attention recently as an effective approach for solving numerical optimization problems. However, the performance of DE is sensitive to the choice of the mutation strategy and ...
A Differential Evolution Algorithm for the Extraction of Complex Natural Resonance Frequencies of Electromagnetic Targets
(SPRINGER-VERLAG BERLIN, 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 Discrete Artificial Bee Colony Algorithm For the Economic Lot Scheduling Problem
(IEEE, 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 ...