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

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

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

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

This study addresses flexible job shop scheduling problem (FJSP) with two constraints, namely fuzzy processing time and new job insertion. The uncertainty of processing time and new job insertion are two scheduling related ...

In this paper, we present a discrete artificial bee colony algorithm to solve the no-idle permutation flowshop scheduling problem with the total tardiness criterion. The no-idle permutation flowshop problem is a variant ...

This paper presents a variable iterated greedy algorithm (IG) with differential evolution (vIG_DE), designed to solve the no-idle permutation flowshop scheduling problem. In an IG algorithm, size d of jobs are removed from ...