Now showing items 51-54 of 54
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) ...
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.  (Computers & Operations Research 36 (2009) 2638-2646) and Tseng and Lin  (European Journal of Operational Research 198 (2009) 84-92) presented a novel estimation distribution algorithm ...
A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops
(Information Sciences, 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. ...