Unidirectional Loop Layout Problem with Balanced Flow

  • Feristah Ozcelik
  • A. Attila Islier
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4031)


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.


Flexible Manufacturing System Hybrid Genetic Algorithm Linear Programming Relaxation Layout Problem Material Handling System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Kouvelis, P., Kim, M.W.: Unidirectional loop network layout problem in automated manufacturing systems. Operations Research 40(3), 533–550 (1992)CrossRefGoogle Scholar
  2. 2.
    Afentakis, P.: A loop layout design problem for flexible manufacturing systems. International Journal of Flexible Manufacturing Systems 1(2), 175–196 (1989)CrossRefGoogle Scholar
  3. 3.
    Bozer, Y.A., Rim, S.C.: Exact solution procedures for the circular layout problem, Technical Report 89-33, University of Michigan, USA (1989)Google Scholar
  4. 4.
    Kiran, A.S., Karabati, S.: Exact and approximate algorithms for the loop layout problem. Production Planning&Control 4(3), 253–259 (1993)Google Scholar
  5. 5.
    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)CrossRefMATHGoogle Scholar
  6. 6.
    Kaku, B.K., Rachamadugu, R.: Layout design for flexible manufacturing systems. European Journal of Operational Research 57, 224–230 (1992)CrossRefMATHGoogle Scholar
  7. 7.
    Tansel, B.C., Bilen, C.: Move based heuristics for the unidirectional loop network layout problem. European Journal of Operational Research 108, 36–48 (1998)CrossRefMATHGoogle Scholar
  8. 8.
    Lee, S., Huang, K., Chiang, C.: Configuring layout in unidirectional loop manufacturing systems. International Journal of Production Research 39(6), 1183–1201 (2001)CrossRefMATHGoogle Scholar
  9. 9.
    Malakooti, B.: Unidirectional loop network layout by a LP heuristic and design of telecommunications networks. Journal of Intelligent Manufacturing 15, 117–125 (2004)CrossRefGoogle Scholar
  10. 10.
    Altınel, İ.K., Öncan, T.: Design of unidirectional cyclic layouts. International Journal of Production Research 43(19), 3983–4008 (2005)CrossRefMATHGoogle Scholar
  11. 11.
    Gen, M., Cheng, R.: Genetic algorithms and engineering design. Wiley, New York (1997)Google Scholar
  12. 12.
    Wang, H.F., Wu, K.Y.: Hybrid genetic algorithm for optimization problems with permutation property. Computers & Operations Research 31, 2453–2471 (2004)CrossRefMATHMathSciNetGoogle Scholar
  13. 13.
    Cheng, R., Gen, M.: Loop layout design problem in flexible manufacturing systems using genetic algorithms. Computers and Industrial Engineering 34(1), 53–61 (1998)CrossRefGoogle Scholar
  14. 14.
    Mühlenbein, H., GorgesSchleuter, M., Krämer, O.: Evolution algorithms in combinatorial optimization. Parallel Computing 7, 65–85 (1988)CrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Feristah Ozcelik
    • 1
  • A. Attila Islier
    • 1
  1. 1.Department of Industrial EngineeringEskişehir Osmangazi UniversityEskisehirTurkey

Personalised recommendations