Search
Now showing items 131-137 of 137
A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion
(TAYLOR & FRANCIS LTD, 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 for the Economic Lot Scheduling Problem
(IEEE, 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 Discrete Artificial Bee Colony Algorithm for the Permutation Flow Shop Scheduling Problem with Total Flowtime Criterion
(IEEE, 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 ...
An Ensemble of Differential Evolution Algorithms for Constrained Function Optimization
(IEEE, 2010)
This paper presents an ensemble of differential evolution algorithms employing the variable parameter search and two distinct mutation strategies in the ensemble to solve real-parameter constrained optimization problems. ...
Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms
(PERGAMON-ELSEVIER SCIENCE LTD, 2010)
In this paper, three hybrid harmony search (HS) algorithms, namely, hybrid harmony search (hHS) algorithm, hybrid globalbest harmony search (hgHS) algorithm and hybrid modified globalbest harmony search (hmgHS) algorithm, ...
A local-best harmony search algorithm with dynamic subpopulations
(TAYLOR & FRANCIS LTD, 2010)
This article presents a local-best harmony search algorithm with dynamic subpopulations (DLHS) for solving the bound-constrained continuous optimization problems. Unlike existing harmony search algorithms, the DLHS algorithm ...
An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
(ELSEVIER SCIENCE INC, 2010)
In this paper, an ensemble of discrete differential evolution algorithms with parallel populations is presented. In a single populated discrete differential evolution (DDE) algorithm, the destruction and construction (DC) ...