Skip to main content
SpringerLink
Log in

A new solution for a dynamic cell formation problem with alternative routing and machine costs using simulated annealing

  • Special Issue Paper
  • Published:
Journal of the Operational Research Society

Abstract

This paper presents an integer-linear programming approach for a cell formation problem (CFP) in a dynamic environment with a multi-period planning horizon. The objectives are to minimize the inter-cell movement and machine costs simultaneously. In dynamic environments, the product mix and demand are different but deterministic in each period. As a consequence, the formed cells in the current period may not be optimal for the next period. Thus, the reconfiguration of cells is required. Reconfiguration consists of re-forming part families, machine groups, and machine relocation. The CFP belongs to the category of NP-hard problems, thus we develop an efficient simulated annealing (SA) method to solve such a problem. The proposed mathematical model is optimally solved and the associated results are compared with the results obtained by the SA run. The results show that the gap between optimal and SA solutions is less than 4%, which indicates the efficiency of the developed SA scheme.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9
Figure 10

References

  • Adenso-Diaz B, Lozano S, Racero J and Guerrero F (2001). Machine cell formation in generalized group technology. Comput Ind Eng 41: 227–240.

    Article  Google Scholar 

  • Adil GK, Rajamani D and Strong D (1993). A mathematical model for cell formation considering investment and operational costs. Eur J Opl Res 69: 330–341.

    Article  Google Scholar 

  • Adil GK, Rajamani D and Strong D (1997). Assignment allocation and simulated annealing algorithms for cell formation. IIE Trans 29: 53–67.

    Article  Google Scholar 

  • Akturk MS (1996). A note on the within-cell layout problem based on operation sequences. Prod Plann Control 7: 99–105.

    Article  Google Scholar 

  • Askin RG, Selim HM and Vakharia AJ (1997). A methodology for designing flexible cellular manufacturing systems. IIE Trans 29: 599–610.

    Google Scholar 

  • Balakrishnan J and Cheng CH (2005). Dynamic cellular manufacturing under multi-period planning Horizons. J Manuf Technol Mngt 16: 516–530.

    Article  Google Scholar 

  • Baykasoğlu A (2004). A meta-heuristic algorithm to solve quadratic assignment formulations of cell formation problems without presetting number of cells. J Intell Manuf 15: 753–759.

    Article  Google Scholar 

  • Baykasoğlu A and Gindy N (2001). A simulated annealing algorithm for dynamic layout problem. Comput Opns Res 28: 1403–1426.

    Article  Google Scholar 

  • Bhide P, Bhandwale A and Kesavadas T (2005). Cell formation using multiple process plans. J Intell Manuf 16: 53–65.

    Article  Google Scholar 

  • Black JT (1991). The Design of the Factory with a Future. McGraw-Hill: New York.

    Google Scholar 

  • Bofill P, Guimerà R and Torras C (2003). Comparison of simulated annealing and mean field annealing as applied to the generation of block designs. Neural Network 16: 1421–1428.

    Article  Google Scholar 

  • Caux C, Bruniaux R and Pierreval H (2000). Cell formation with alternative process plans and machine capacity constraints: A new combined approach. Int J Prod Econ 64: 279–284.

    Article  Google Scholar 

  • Chen M (1998). A mathematical programming model for system reconfiguration in a dynamic cellular manufacturing environment. Ann Opns Res 77: 109–128.

    Article  Google Scholar 

  • Chen CL, Cotruvo NA and Baek W (1995). A simulated annealing solution to the cell formation problem. Int J Prod Res 33: 2601–2614.

    Article  Google Scholar 

  • Foulds LR and Neumann K (2003). A network flow model of group technology. Math Comput Model 38: 623–635.

    Article  Google Scholar 

  • Gutzmann KM (1987). Combinatorial optimization using a continuous state Boltzmann machine. In: Proceedings of IEEE First International Conference of Neural Networks, Vol. III, San Diego, CA, pp. 721–728.

  • Harhalaks G, Nagi R and Proth J (1990). An effective heuristic in manufacturing cell formation for group technology applications. Int J Prod Res 28: 185–198.

    Article  Google Scholar 

  • Harlahakis G, Ioannou G, Minis I and Nagi R (1994). Manufacturing cell formation under random product demand. Int J Prod Res 32: 47–64.

    Article  Google Scholar 

  • Kirkpatrick S, Gelatt CD and Vecchi MP (1983). Optimization by simulated annealing. Science 220: 671–680.

    Article  Google Scholar 

  • Lacksonen TA (1994). Static and dynamic layout problems with varying areas. J Opl Res Soc 45: 59–69.

    Article  Google Scholar 

  • Lacksonen TA (1997). Preprocessing for static and dynamic facility layout problems. Int J Prod Res 35: 1095–1106.

    Article  Google Scholar 

  • Logendran R, Ramakrishna P and Srikandarajah C (1994). Tabu search based heuristic for cellular manufacturing systems in the presence of alternative process plans. Int J Prod Res 32: 273–297.

    Article  Google Scholar 

  • Montreuil B and Laforge A (1992). Dynamic layout design given a scenario tree of probable futures. Eur J Opl Res 63: 271–286.

    Article  Google Scholar 

  • Rogers G and Bottaci L (1997). Modular production systems: A new manufacturing paradigm. J Intell Manuf 8: 147–156.

    Article  Google Scholar 

  • Schaller JE, Erenguc SS and Vakharia AJ (2000). A mathematical approach for integrating the cell design and production planning decision. Int J Prod Res 38: 3953–3971.

    Article  Google Scholar 

  • Shafer S and Rogers D (1991). A goal programming approach to the cell formation problem. J Opns Mngt 10: 28–43.

    Google Scholar 

  • Sofianopoulou S (1997). Application of simulated annealing to a linear model for the formulation of machine cells in group technology. Int J Prod Res 35: 501–511.

    Article  Google Scholar 

  • Song S and Hitomi K (1996). Integrating the production planning and cellular layout for flexible cellular manufacturing. Int J Prod Plann Control 7: 585–593.

    Article  Google Scholar 

  • Su CT and Hsu CM (1998). Multi-objective machine-part cell formation through parallel simulated annealing. Int J Prod Res 36: 2185–2207.

    Article  Google Scholar 

  • Tavakkoli-Moghaddam R, Aryanezhad MB, Safaei N and Azaron A (2005a). Solving a dynamic cell formation problem using meta-heuristics. Appl Math Comput 170: 761–780.

    Google Scholar 

  • Tavakkoli-Moghaddam R, Safaei N and Babakhani M (2005b). Solving a dynamic cell formation problem with machine cost and alternative process plan by memetic algorithms, In: Lupanov OB, Kasim-Zade OM, Chaskin AV and Steinhofel K, (eds). Stochastic Algorithms: Foundation and Applications, Lecture Notes in Computer Science 3777, Springer-Verlag: Berlin, pp. 213–227.

  • Vakharia AJ and Kaku BK (1993). Redesigning a cellular manufacturing system to handle long-term demand changes: A methodology and investigation. Decis Sci 24: 909–929.

    Article  Google Scholar 

  • Wemmerlov U and Hyer N (1989). Cellular manufacturing in the US industry: A survey of users. Int J Prod Res 27: 1511–1530.

    Article  Google Scholar 

  • Wemmerlov U and Johnson DJ (1997). Cellular manufacturing at 46 user plants: Implementation experiences and performance improvements. Int J Prod Res 35: 29–49.

    Article  Google Scholar 

  • Wilhelm W, Chiou C and Chang D (1998). Integrating design and planning considerations in cellular manufacturing. Ann Opns Res 77: 97–107.

    Article  Google Scholar 

  • Xambre AR and Vilarinho PM (2003). A simulated annealing approach for manufacturing cell formation with multiple identical machines. Eur J Opl Res 15: 434–446.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Tehran, Tehran, Iran

    R Tavakkoli-Moghaddam

  2. Iran University of Science and Technology, Tehran, Iran

    N Safaei

  3. The University of British Columbia, Vancouver, Canada

    R Tavakkoli-Moghaddam, N Safaei & F Sassani

Authors
  1. R Tavakkoli-Moghaddam
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N Safaei
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. F Sassani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to R Tavakkoli-Moghaddam.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tavakkoli-Moghaddam, R., Safaei, N. & Sassani, F. A new solution for a dynamic cell formation problem with alternative routing and machine costs using simulated annealing. J Oper Res Soc 59, 443–454 (2008). https://doi.org/10.1057/palgrave.jors.2602436

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/palgrave.jors.2602436

Keywords

Search

Navigation