An Electromagnetism-like algorithm for cell formation and layout problem

Authors:
Fariborz Jolai;R. Tavakkoli-Moghaddam;A. Golmohammadi;Babak Javadi
Affiliations:
Department of Industrial Engineering, College of Engineering, University of Tehran, Iran;Department of Industrial Engineering, College of Engineering, University of Tehran, Iran;Department of Industrial Engineering, College of Engineering, University of Tehran, Iran;Department of Industrial Engineering, College of Engineering, University of Tehran, Iran
Venue:
Expert Systems with Applications: An International Journal
Year:
2012

Citing 5
Cited 0

An Electromagnetism-like Mechanism for Global Optimization

Journal of Global Optimization
CLASS: An algorithm for cellular manufacturing system and layout design using sequence data

Robotics and Computer-Integrated Manufacturing
A novel approach to determine cell formation, intracellular machine layout and cell layout in the CMS problem based on TOPSIS method

Computers and Operations Research
Hybrid simulated annealing algorithm with mutation operator to the cell formation problem with alternative process routings

Expert Systems with Applications: An International Journal
A hybrid electromagnetism-like algorithm for single machine scheduling problem

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	12.05

Visualization

Abstract

Implementation of cellular manufacturing systems (CMS) is thriving among manufacturing companies due to many advantages that are attained by applying this system. In this study CMS formation and layout problems are considered. An Electromagnetism like (EM-like) algorithm is developed to solve the mentioned problems. In addition the required modifications to make EM-like algorithm applicable in these problems are mentioned. A heuristic approach is developed as a local search method to improve the quality of solution of EM-like. Beside in order to examine its performance, it is compared with two other methods. The performance of EM-like algorithm with proposed heuristic and GA are compared and it is demonstrated that implementing EM-like algorithm in this problem can improve the results significantly in comparison with GA. In addition some statistical tests are conducted to find the best performance of EM-like algorithm and GA due to their parameters. The convergence diagrams are plotted for two problems to compare the convergence process of the algorithms. For small size problems the performances of the algorithms are compared with an exact algorithm (Branch & Bound).