First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008) 2008
DOI: 10.1109/wkdd.2008.1
|View full text |Cite
|
Sign up to set email alerts
|

A PSO-Based Clustering Algorithm for Manufacturing Cell Design

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2010
2010
2019
2019

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(8 citation statements)
references
References 7 publications
0
8
0
Order By: Relevance
“…There are many techniques that can be used to solve the clustering problem. In our study the clustering problem was solved by using the PSO algorithm (Kennedy and Eberhart 1995; Poli, Kennedy, and Blackwell 2007; Correa, Freitas, and Johnson 2008; Durán, Rodriguez, and Consalter 2008; Arumugam, Rao, and Tan 2009; DeBao and ChunXia 2009). A new population‐based stochastic algorithm, PSO, introduced by Kennedy and Eberhart (1995), is considered as one of the modern heuristic algorithms for optimization.…”
Section: Document Summarization Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…There are many techniques that can be used to solve the clustering problem. In our study the clustering problem was solved by using the PSO algorithm (Kennedy and Eberhart 1995; Poli, Kennedy, and Blackwell 2007; Correa, Freitas, and Johnson 2008; Durán, Rodriguez, and Consalter 2008; Arumugam, Rao, and Tan 2009; DeBao and ChunXia 2009). A new population‐based stochastic algorithm, PSO, introduced by Kennedy and Eberhart (1995), is considered as one of the modern heuristic algorithms for optimization.…”
Section: Document Summarization Methodsmentioning
confidence: 99%
“…The resulted changes in position are defined as follows: where 0 ≤ rand j ≤ 1 is a uniform random number, and is the sigmoid function. is a standard equation used to sample new particle positions in the binary PSO algorithm (Correa et al 2008; Durán et al 2008). The motivation to use the sigmoid function is to map interval [− v ij ( t ), v ij ( t )] for all i , j into the interval (0,1) which is equivalent to the interval of a probability function.…”
Section: Overview Of Pso Algorithmmentioning
confidence: 99%
“…Lim and Ponnambalam [21] implemented a hybrid search algorithm using GA and PSO for the concurrent design of cellular manufacturing system. Duran et al [15] addressed the problem of manufacturing Cell Formation by using a modified PSO algorithm. The proposed algorithm considers the concept of proportional probability with modifications, an approach that is used in data mining techniques.…”
Section: Literature Reviewmentioning
confidence: 99%
“…= Number of exceptional elements Total number of operations (15) ϕ = Number of voids in the diagonal blocks Total number of operations (16) Unlike grouping efficiency, one sees that grouping efficacy is not affected by the size of the matrix. However, both measures -grouping efficiency and grouping efficacy -treat all operations equally and are suitable only for the zero-one incidence matrix.…”
Section: Performance Measuresmentioning
confidence: 99%
“…In this algorithm a portion of solution space is assigned to each swarm to search in that particular portion for increasing the ability of good solution. Duran et al (2008) proposed a PSO based clustering algorithm for Manufacturing Cell Design. Proportional likelihood concept is used in this algorithm.…”
Section: Pso Application In Data Clusteringmentioning
confidence: 99%