Sciweavers

42 search results - page 1 / 9
» Solving a dynamic cell formation problem using metaheuristic...
Sort
View
AMC
2005
136views more  AMC 2005»
13 years 4 months ago
Solving a dynamic cell formation problem using metaheuristics
In this paper, solving a cell formation (CF) problem in dynamic condition is going to be discussed by using some traditional metaheuristic methods such as genetic algorithm (GA), ...
Reza Tavakkoli-Moghaddam, M. B. Aryanezhad, Nima S...
EUSFLAT
2009
194views Fuzzy Logic» more  EUSFLAT 2009»
13 years 2 months ago
A Fuzzy Particle Swarm Optimization Algorithm for a Cell Formation Problem
Group technology (GT) is a useful way to increase productivity with high quality in cellular manufacturing systems (CMSs), in which cell formation (CF) is a key step in the GT phil...
Esmaeil Mehdizadeh, Reza Tavakkoli-Moghaddam
ESWA
2010
105views more  ESWA 2010»
13 years 2 months ago
A numerical comparison between simulated annealing and evolutionary approaches to the cell formation problem
The Cell Formation Problem is a crucial component of a cell production design in a manufacturing system. This problem consists of a set of product parts to be manufactured in a gr...
Andres Pailla, Athila R. Trindade, Victor Parada, ...
FLAIRS
2006
13 years 6 months ago
Which Dynamic Constraint Problems Can Be Solved By Ants?
There exist a number of algorithms that can solve dynamic constraint satisfaction/optimization problems (DynCSPs or DynCOPs). Because of the large variety in the characteristics o...
Koenraad Mertens, Tom Holvoet, Yolande Berbers
EVOW
2005
Springer
13 years 10 months ago
Scatter Search Particle Filter to Solve the Dynamic Travelling Salesman Problem
This paper presents the Scatter Search Particle Filter (SSPF) algorithm and its application to the Dynamic Travelling Salesman Problem (DTSP). SSPF combines sequential estimation a...
Juan José Pantrigo, Abraham Duarte, Á...