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 (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 ...

This paper extends the applications of differential evolution algorithms to the Median Cycle Problem. The median cycle problem is concerned with constructing a simple cycle composed of a subset of vertices of a mixed graph. ...

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 ...

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 ...

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 ...

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 ...

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. ...

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 ...

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) ...