Search
Now showing items 41-50 of 103
A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem
(Information Sciences, 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 local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem
(Expert Systems with Applications, 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 ...
Dynamic multi-swarm particle swarm optimizer with harmony search
(Expert Systems with Applications, 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 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. [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 ...
Solving lot-streaming flow shop scheduling problems using a discrete harmony search algorithm
(2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010, 2010)
The harmony search (HS) algorithm is one of the recent evolutionary computation techniques to solve optimization problems. To make it applicable for lot-streaming flow shop problems, a discrete variant of the HS algorithm ...
An ensemble of differential evolution algorithms for constrained function optimization
(2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010, 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. ...
A local-best harmony search algorithm with dynamic subpopulations
(Engineering Optimization, 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 ...
A self-adaptive global best harmony search algorithm for continuous optimization problems
(Applied Mathematics and Computation, 2010)
This paper presents a self-adaptive global best harmony search (SGHS) algorithm for solving continuous optimization problems. In the proposed SGHS algorithm, a new improvisation scheme is developed so that the good information ...
Minimizing the total flow time in a flow shop with blocking by using hybridm harmony search algorithms
(Expert Systems with Applications, 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, ...
An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
(Applied Mathematics and Computation, 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) ...
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
