Abstract
Facility layout planning plays an important role in the manufacturing process and seriously impacts a company’s profitability. A well-planned layout can significantly reduce the total material handling cost. The purpose of this paper is to develop a two-stage inter-cell layout optimization approach by using one of the popular meta-heuristics — the Ant Colony Optimization algorithm. At the first stage, the cells are formed based on the part-machine clustering results obtained through the ant system algorithm. In other words, we get the initial inter-cell layout after this stage. The work at the second stage uses a hybrid ant system algorithm to improve the solution obtained at previous stage. Different performance measures are also employed in this paper to evaluate the results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dorigo, M., Socha, K.: An introduction to ant colony optimization. IRIDIA, Universite Libre de Bruxelles, Belgium (2007)
Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B 26, 1–13 (1996)
Gambardella, L.M., Dorigo, M.: Ant-Q: a reinforcement learning approach to the traveling salesman problem. In: Twelfth International Conference on Machine Learning, Tahoe City, CA (1995)
Stützle, T., Hoos, H.H.: MAX-MIN ant system. Future Generation Computer Systems 16, 889–914 (2000)
Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1, 53–66 (1997)
Cheng, K.: Applying Ant Colony Optimization to Rearranged Matrix Partitioning Problems for cellular manufacturing Department of Information Management, Master of Science. Tatung University (2006)
Chandrasekharan, M.P., Rajagopalan, R.: An ideal seed non-hierarchical clustering algorithm for cellular manufacturing. International Journal of Production Research 24, 451–464 (1986)
Yin, Y., Yasuda, K.: Similarity coefficient methods applied to the cell formation problem: a comparative investigation. Computers & Industrial Engineering 48, 471–489 (2005)
Kumar, C.S., Chandasekharan, M.P.: Grouping efficacy: a quantitative criterion for goodness of block diagonal forms of binary matrices in group technology. International Journal of Production Research 28, 233–243 (1990)
Koopmans, T.C., Beckmann, M.J.: Assignment problems and the location of economics ativities. Econometrica 25, 53–76 (1957)
Shani, S., Gonzalez, T.: P-complete approximation problems. Journal of ACM 23, 555–565 (1976)
Engelbrecht, A.P.: Computational intelligence: an introduction. John Wiley & Sons Ltd., West Sussex (2007)
Gambardella, L.M., Taillard, E., Dorigo, M.: Ant colonies for the quadratic assignment problem. Journal of Operational Research Society 50, 167–176 (1999)
Shang, J.: Ant colony heuristics for the dynamic facility layout problem. Department of Industrial and Management Systems Engineering, Master of Science. West Virginia University, Morgantown, West Virginia (2002)
Nagi, R., Harhalakis, G., Proth, J.M.: Multiple routings and capacity considerations in group technology applications. International Journal of Production Research 28, 22–43 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xing, B., Gao, Wj., Nelwamondo, F.V., Battle, K., Marwala, T. (2010). Two-Stage Inter-Cell Layout Design for Cellular Manufacturing by Using Ant Colony Optimization Algorithms. In: Tan, Y., Shi, Y., Tan, K.C. (eds) Advances in Swarm Intelligence. ICSI 2010. Lecture Notes in Computer Science, vol 6145. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13495-1_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-13495-1_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13494-4
Online ISBN: 978-3-642-13495-1
eBook Packages: Computer ScienceComputer Science (R0)