2016
DOI: 10.1155/2016/9402503
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Parallel Sorting for Migrating Birds Optimization When Solving Machine-Part Cell Formation Problems

Abstract: The Machine-Part Cell Formation Problem (MPCFP) is a NP-Hard optimization problem that consists in grouping machines and parts in a set of cells, so that each cell can operate independently and the intercell movements are minimized. This problem has largely been tackled in the literature by using different techniques ranging from classic methods such as linear programming to more modern nature-inspired metaheuristics. In this paper, we present an efficient parallel version of the Migrating Birds Optimization m… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
4
3
1

Relationship

4
4

Authors

Journals

citations
Cited by 11 publications
(4 citation statements)
references
References 53 publications
0
4
0
Order By: Relevance
“…For future research, a more extensible configuration could be developed to cover a wider set of problems. It would also be interesting to implement this technique in conjunction with other recent metaheuristics where limited work on Autonomous Search exists such as cuckoo search, firefly optimization, or bat algorithms [75]. Finally, hybridization with learning techniques is another interesting research line to pursue, where feedback gathered for the self-tune phase could be processed with machine learning in order to better track the complete solving process.…”
Section: Discussionmentioning
confidence: 99%
“…For future research, a more extensible configuration could be developed to cover a wider set of problems. It would also be interesting to implement this technique in conjunction with other recent metaheuristics where limited work on Autonomous Search exists such as cuckoo search, firefly optimization, or bat algorithms [75]. Finally, hybridization with learning techniques is another interesting research line to pursue, where feedback gathered for the self-tune phase could be processed with machine learning in order to better track the complete solving process.…”
Section: Discussionmentioning
confidence: 99%
“…More recent metaheuristics have also been employed to solve the this problem, for instance, a migrating birds algorithm is used to solve 90 classic MPCF problems efficiently [40]. An extended version of this work, where the several sorting processes of the metaheuristic are paralleled, has also been published [41]. Finally, another group of modern metaheuristics is proposed to solve this same set of problems efficiently, some examples are artificial fish swarm algorithms [42], shuffled frog leaping algorithms [43], bat algorithms [44], and flower and pollination algorithms [45].…”
Section: Literature Reviewmentioning
confidence: 99%
“…For instance, the authors may cite the following works, among many others. In [39], a migrating bird algorithm was applied, which was later parallelized in [40]. The artificial fish swarm algorithm and the shuffled frog leaping algorithm were applied in [41,42].…”
Section: Related Workmentioning
confidence: 99%