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

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

This paper proposes a hybrid modified global-best harmony search (hmgHS) algorithm for solving the blocking permutation flow shop scheduling problem with the makespan criterion. First of all, the largest position value ...

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

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

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

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

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

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

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

The aim of this paper is to apply the variable block insertion heuristic (VBIH) algorithm recently proposed in the literature for solving the quadratic assignment problem (QAP). The VBIH algorithm is concerned with making ...

In this paper, we present a variable block insertion heuristic (VBIH) algorithm to solve the blocking flowshop scheduling problem with the total flowtime criterion. In the VBIH algorithm, we define a minimum and a maximum ...

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

This paper is concerned with the application of computational intelligence techniques to the conceptual design and development of a large-scale floating settlement. The settlement in question is a design for the area of ...