A tabu search approach to the cell formation problem

Original Article

Abstract

The cell formation problem determines the decomposition of the manufacturing cells of a production system in which machines are assigned to these cells to process one or more part families so that each cell is operated independently and the intercellular flows are minimised or the number of parts flow processed within cells is maximised. In this paper, a tabu search heuristic—TSCF—that consists of dynamic tabu tenure with a long-term memory mechanism is presented to solve the cell formation problem. Test problems adopted from the literature and generated randomly are used to evaluate the performance of the proposed algorithm. In addition, two methods for quickly generating the initial solutions are proposed, namely the group-and-assign (GAA) method, and the random approach. Computational results indicate that the GAA method, accompanied by the TSCF algorithm can produce optimal solutions in less than or equal to 0.005 s for all small- and medium-sized problems. The proposed algorithm should thus be useful to both practitioners and researchers.

Keywords

Tabu search Cell formation problem 

References

  1. 1.
    Garey MR, Johnson DS (1979) Computers and Intractability. Freeman, San FranciscoGoogle Scholar
  2. 2.
    Chen CH (1992) Algorithms for grouping machines groups in group technology. Omega 20:493–501CrossRefGoogle Scholar
  3. 3.
    Chu CH (1989) Cluster analysis in manufacturing cellular formation. Omega 17:289–295CrossRefGoogle Scholar
  4. 4.
    Moon C, Kim J (1999) Genetic algorithm for maximizing the parts flow within cells in manufacturing cell design. Comput Ind Eng 36:379–389CrossRefGoogle Scholar
  5. 5.
    Harlalakis J, Nagi R, Proth JM (1990) An efficient heuristic in manufacturing cell formation for group technology applications. Int J Prod Res 28:185–198Google Scholar
  6. 6.
    Rajagopalan R, Batra J (1975) Design of cellular production systems-a graph theoretical approach. Int J Prod Res 13:256–268Google Scholar
  7. 7.
    Vohra T, Chen D, Chang J, Chen H (1990) A network approach to cell formation in cellular manufacturing. Int J Prod Res 28:2075–2084Google Scholar
  8. 8.
    Wu N, Salvendy G (1993) Modified network approach for the design of cellular manufacturing systems. Int J Prod Res 31:1409–1421Google Scholar
  9. 9.
    Sun D, Lin L, Batta R (1995) Cell formation using tabu search. Comput Ind Eng 28:485–494Google Scholar
  10. 10.
    Aljaber N, Baek W, Chen C-L (1997) A tabu search approach to the cell formation problem. Comput Ind Eng 32:169–185CrossRefGoogle Scholar
  11. 11.
    Wu TH (1997) A note on a global approach for general 0–1 fractional programming. Eur J Oper Res 101:220-223CrossRefGoogle Scholar
  12. 12.
    Glover F (1989) Tabu search—Part I. ORSA J Comput 1:190–206Google Scholar
  13. 13.
    Glover F (1990) Tabu search—Part II. ORSA J Comput 2:4–32Google Scholar
  14. 14.
    Glover F, Laguna M (1997) Tabu search. Kluwer Academic Publishers, BostonGoogle Scholar
  15. 15.
    Battiti R, Tecchiolli G (1994) The reactive tabu search. ORSA J Comput 6:126–140Google Scholar
  16. 16.
    Rolland E, Schilling DA, Current JR (1996) An efficient tabu search procedure for the p-median problem. Eur J Oper Res 96:329–342CrossRefGoogle Scholar
  17. 17.
    Sun M, Aronson JE, McKeown PG, Drinka D (1998) A tabu search heuristic procedure for the fixed charge transportation problem. Eur J Oper Res 106:441–456CrossRefGoogle Scholar
  18. 18.
    Wu T-H, Low C, Wu W-T (2003) A tabu search approach to generalized assignment problem. Technical report, department of industrial engineering, Da-Yeh University, TaiwanGoogle Scholar

Copyright information

© Springer-Verlag London Limited 2004

Authors and Affiliations

  1. 1.Department of Industrial EngineeringDa-Yeh UniversityChanghuaTaiwan 515 ROC
  2. 2.UMCScience-Based Industrial ParkHsinchuTaiwan 300 ROC

Personalised recommendations