Search
Now showing items 21-30 of 50
Solving lot-streaming flow shop scheduling problems using a discrete harmony search algorithm
(2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010, 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
(2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010, 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
(Engineering Optimization, 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 ...
A self-adaptive global best harmony search algorithm for continuous optimization problems
(Applied Mathematics and Computation, 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 ...
An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
(Applied Mathematics and Computation, 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) ...
Artificial bee colony algorithm for scheduling and rescheduling fuzzy flexible job shop problem with new job insertion
(ELSEVIER SCIENCE BV, 2016)
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 ...
A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
(ELSEVIER SCIENCE INC, 2013)
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 ...
A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
(PERGAMON-ELSEVIER SCIENCE LTD, 2013)
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 ...
Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
(PERGAMON-ELSEVIER SCIENCE LTD, 2017)
Recently, iterated greedy algorithms have been successfully applied to solve a variety of combinatorial optimization problems. This paper presents iterated greedy algorithms for solving the blocking flowshop scheduling ...
Multi-Objective Harmony Search Algorithm for Layout Design in Theatre Hall Acoustics
(IEEE, 2016)
The aim of the research is to find a feasible set of theatre hall design alternatives for two objectives, which are the total cost and the reverberation time, subject to several constraints. We formulate the problem as a ...