Search
Now showing items 41-50 of 52
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. ...
A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion
(TAYLOR & FRANCIS LTD, 2011)
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 ...
A self-adaptive global best harmony search algorithm for continuous optimization problems
(ELSEVIER SCIENCE INC, 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 ...
A Discrete Artificial Bee Colony Algorithm for the Permutation Flow Shop Scheduling Problem with Total Flowtime Criterion
(IEEE, 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
(IEEE, 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
(IEEE, 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
(TAYLOR & FRANCIS LTD, 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 ...
An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
(ELSEVIER SCIENCE INC, 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) ...
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 ...
A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops
(Information Sciences, 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. ...
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
