## Search

Now showing items 31-40 of 50

#### Metaheuristic Algorithms for the Quadratic Assignment Problem

(IEEE, 2013)

This paper presents two meta-heuristic algorithms to solve the quadratic assignment problem. The iterated greedy algorithm has two main components, hich are destruction and construction procedures. The algorithm starts ...

#### A General Variable Neighborhood Search Algorithm for the No-Idle Permutation Flowshop Scheduling Problem

(SPRINGER-VERLAG BERLIN, 2013)

In this study, a general variable neighborhood search (GVNS) is presented to solve no-idle permutation flowshop scheduling problem (NIPFS), where idle times are not allowed on machines. GVNS is a metaheuristic, where inner ...

#### A Variable Iterated Greedy Algorithm with Differential Evolution for Solving No-Idle Flowshops

(SPRINGER-VERLAG BERLIN, 2012)

In this paper, we present a variable iterated greedy algorithm where its parameters (basically destruction size and probability of whether or not to apply the iterated greedy algorithm to an individual) are optimized by ...

#### Solving Fuzzy Job-Shop Scheduling Problem by a Hybrid PSO Algorithm

(SPRINGER-VERLAG BERLIN, 2012)

This paper proposes a hybrid particle swarm optimization (PSO) algorithm for solving the job-shop scheduling problem with fuzzy processing times. The objective is to minimize the maximum fuzzy completion time, i.e., the ...

#### A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem

(ELSEVIER SCIENCE INC, 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 discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops

(ELSEVIER SCIENCE INC, 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. ...

#### A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem

(PERGAMON-ELSEVIER SCIENCE LTD, 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

(PERGAMON-ELSEVIER SCIENCE LTD, 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 ...

#### Differential evolution algorithm with ensemble of parameters and mutation strategies

(ELSEVIER, 2011)

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

#### A Differential Evolution Algorithm for the Median Cycle Problem

(IEEE, 2011)

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