Abstract
The unidirectional loop is an economical and flexible materials handling system transporting materials around a loop network in one direction only. There are n candidate locations around the loop to allocate n machines. This configuration is easily adaptable to changes in product mix and routing requirements. The challenge here is to find an assignment for machines to available sites to minimize the handling cost. If the material flow is conserved at each workstation, that is, if total inflow is equal to total outflow then such a loop is called as a balanced loop. This work addresses the unidirectional loop layout design problem with balanced flow. The problem is known to be NP-complete, and thus heuristic methods and artificial intelligence techniques are appropriate to solve such difficult problems in reasonable time. A hybrid Genetic Algorithm (GA) based on a move heuristic is developed to solve the problem. The performance of the GA is tested by using well known data sets from literature and considerable improvements are obtained.
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
Kouvelis, P., Kim, M.W.: Unidirectional loop network layout problem in automated manufacturing systems. Operations Research 40(3), 533–550 (1992)
Afentakis, P.: A loop layout design problem for flexible manufacturing systems. International Journal of Flexible Manufacturing Systems 1(2), 175–196 (1989)
Bozer, Y.A., Rim, S.C.: Exact solution procedures for the circular layout problem, Technical Report 89-33, University of Michigan, USA (1989)
Kiran, A.S., Karabati, S.: Exact and approximate algorithms for the loop layout problem. Production Planning&Control 4(3), 253–259 (1993)
Kiran, A.S., Unal, A.T., Karabati, S.: A location problem on unicyclic networks: Balanced case. European Journal of Operational Research 62, 194–202 (1992)
Kaku, B.K., Rachamadugu, R.: Layout design for flexible manufacturing systems. European Journal of Operational Research 57, 224–230 (1992)
Tansel, B.C., Bilen, C.: Move based heuristics for the unidirectional loop network layout problem. European Journal of Operational Research 108, 36–48 (1998)
Lee, S., Huang, K., Chiang, C.: Configuring layout in unidirectional loop manufacturing systems. International Journal of Production Research 39(6), 1183–1201 (2001)
Malakooti, B.: Unidirectional loop network layout by a LP heuristic and design of telecommunications networks. Journal of Intelligent Manufacturing 15, 117–125 (2004)
Altınel, İ.K., Öncan, T.: Design of unidirectional cyclic layouts. International Journal of Production Research 43(19), 3983–4008 (2005)
Gen, M., Cheng, R.: Genetic algorithms and engineering design. Wiley, New York (1997)
Wang, H.F., Wu, K.Y.: Hybrid genetic algorithm for optimization problems with permutation property. Computers & Operations Research 31, 2453–2471 (2004)
Cheng, R., Gen, M.: Loop layout design problem in flexible manufacturing systems using genetic algorithms. Computers and Industrial Engineering 34(1), 53–61 (1998)
Mühlenbein, H., GorgesSchleuter, M., Krämer, O.: Evolution algorithms in combinatorial optimization. Parallel Computing 7, 65–85 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ozcelik, F., Islier, A.A. (2006). Unidirectional Loop Layout Problem with Balanced Flow. In: Ali, M., Dapoigny, R. (eds) Advances in Applied Artificial Intelligence. IEA/AIE 2006. Lecture Notes in Computer Science(), vol 4031. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779568_80
Download citation
DOI: https://doi.org/10.1007/11779568_80
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35453-6
Online ISBN: 978-3-540-35454-3
eBook Packages: Computer ScienceComputer Science (R0)