2010
DOI: 10.1016/j.cor.2010.02.007
|View full text |Cite
|
Sign up to set email alerts
|

An ant colony optimization metaheuristic for machine–part cell formation problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
30
0

Year Published

2011
2011
2018
2018

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 62 publications
(30 citation statements)
references
References 74 publications
0
30
0
Order By: Relevance
“…The part-machine clustering problems used in our computational analyses were collected for a study by Goncalves and Resende (2004), and been have used (either all or in part) for testing purposes by several other authors (James et al, 2007;Li et al, 2010;Noktehdan et al, 2010;Paydar & Saidi-Mehrabad, 2013;Tunnukij & Hicks, 2009). Although there were originally 35 test problems in this suite, we consider two versions of two of the problems, which yields a total of 37.…”
Section: Test Problemsmentioning
confidence: 99%
See 2 more Smart Citations
“…The part-machine clustering problems used in our computational analyses were collected for a study by Goncalves and Resende (2004), and been have used (either all or in part) for testing purposes by several other authors (James et al, 2007;Li et al, 2010;Noktehdan et al, 2010;Paydar & Saidi-Mehrabad, 2013;Tunnukij & Hicks, 2009). Although there were originally 35 test problems in this suite, we consider two versions of two of the problems, which yields a total of 37.…”
Section: Test Problemsmentioning
confidence: 99%
“…These methods include, but are not necessarily limited to, genetic algorithms (Tariq et al, 2009;Tunnukij & Hicks, 2009), simulated annealing (Wu et al, 2008), ant colony methods (Li et al, 2010), water flow-like algorithms (Wu et al, 2010), and evolutionary algorithms with embedded variable neighborhood search (Paydar & SaidiMehrabad, 2013). Reviews of implementations of different metaheuristics are provided by Papaioannou and Wilson (2010) and Ghosh, Sengupta, Chattopadhyay, and Dan (2011).…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Many exact and heuristic solution procedures have been developed to solve the CF problem including cluster analysis approaches, graph partitioning approaches, branch and bound algorithms, and metaheuristic algorithms. Detailed reviews of the various approaches to the CF problem are available in the literature [7][8][9][10].…”
Section: Introductionmentioning
confidence: 99%
“…Cell formation problems are often solved with metaheuristics, since they produce quick and good solutions. Li et al [30] utilized ant colony optimization, Onwubolu and Mitingi [38], Onwubolu and Songore [39] used genetic algorithm and Tabu search for solving these problems.…”
Section: Cell Formationmentioning
confidence: 99%