Skip to main content

Part of the book series: Studies in Computational Intelligence ((SCI,volume 284))

Abstract

The Tool Switching Problem (ToSP) is a hard combinatorial optimization problem of relevance in the field of flexible manufacturing systems (FMS), that has been tackled in the literature using both complete and heuristic methods, including local-search metaheuristics, population-based methods and hybrids thereof (e.g., memetic algorithms). This work approaches the ToSP using several hybrid cooperative models where spatially-structured agents are endowed with specific localsearch/ population-based strategies. Issues such as the intervening techniques and the communication topology are analyzed via an extensive empirical evaluation. It is shown that the cooperative models provide better results than their constituent parts. Furthermore, they not only provide solutions of similar quality to those returned by the memetic approach but raise interest prospects with respect to its scalability.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Al-Fawzan, M., Al-Sultan, K.: A tabu search based algorithm for minimizing the number of tool switches on a flexible machine. Computers & Industrial Engineering 44(1), 35–47 (2003)

    Article  Google Scholar 

  2. Amaya, J., Cotta, C., Fernández, A.: A memetic algorithm for the tool switching problem. In: Blesa, M.J., Blum, C., Cotta, C., Fernández, A.J., Gallardo, J.E., Roli, A., Sampels, M. (eds.) HM 2008. LNCS, vol. 5296, pp. 190–202. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. Bard, J.F.: A heuristic for minimizing the number of tool switches on a flexible machine. IIE Transactions 20(4), 382–391 (1988)

    Article  Google Scholar 

  4. Belady, L.: A study of replacement algorithms for virtual storage computers. IBM Systems Journal 5, 78–101 (1966)

    Article  Google Scholar 

  5. Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput. Surv. 35(3), 268–308 (2003)

    Article  Google Scholar 

  6. Crainic, T.G., Gendreau, M.: Cooperative parallel tabu search for capacitated network design. Journal of Heuristics 8(6), 601–627 (2002)

    Article  Google Scholar 

  7. Crainic, T.G., Gendreau, M., Hansen, P., Mladenović, N.: Cooperative parallel variable neighborhood search for the p-median. Journal of Heuristics 10(3), 293–314 (2004)

    Article  Google Scholar 

  8. Crama, Y., Kolen, A., Oerlemans, A., Spieksma, F.: Minimizing the number of tool switches on a flexible machine. International Journal of Flexible Manufacturing Systems 6, 33–54 (1994)

    Article  Google Scholar 

  9. Cruz, C., Pelta, D.A.: Soft computing and cooperative strategies for optimization. Applied Soft Computing 9(1), 30–38 (2009)

    Article  Google Scholar 

  10. Djellab, H., Djellab, K., Gourgand, M.: A new heuristic based on a hypergraph representation for the tool switching problem. International Journal of Production Economics 64(1-3), 165–176 (2000)

    Article  Google Scholar 

  11. ElMaraghy, H.: Automated tool management in flexible manufacturing. Journal of Manufacturing Systems 4(1), 1–14 (1985)

    Article  Google Scholar 

  12. Friedman, M.: The use of ranks to avoid the assumption of normality implicit in the analysis of variance. Journal of the American Statistical Association 32(200), 675–701 (1937)

    Article  Google Scholar 

  13. Hertz, A., Widmer, M.: An improved tabu search approach for solving the job shop scheduling problem with tooling constraints. Discrete Applied Mathematics 65, 319–345 (1993)

    Article  MathSciNet  Google Scholar 

  14. Hertz, A., Laporte, G., Mittaz, M., Stecke, K.: Heuristics for minimizing tool switches when scheduling part types on a flexible machine. IIE Transactions 30, 689–694 (1998)

    Google Scholar 

  15. Holm, S.: A simple sequentially rejective multiple test procedure. Scandinavian Journal of Statistics 6, 65–70 (1979)

    MATH  MathSciNet  Google Scholar 

  16. Iman, R., Davenport, J.: Approximations of the critical region of the Friedman statistic. Communications in Statistics 9, 571–595 (1980)

    Article  Google Scholar 

  17. Keung, K.W., Ip, W.H., Lee, T.C.: A genetic algorithm approach to the multiple machine tool selection problem. Journal of Intelligent Manufacturing 12(4), 331–342 (2001)

    Article  Google Scholar 

  18. Kiran, A., Krason, R.: Automated tooling in a flexible manufacturing system. Industrial Engineering 20, 52–57 (1988)

    Google Scholar 

  19. Krasnogor, N., Smith, J.: A tutorial for competent memetic algorithms: model, taxonomy, and design issues. IEEE Transactions on Evolutionary Computation 9(5), 474–488 (2005)

    Article  Google Scholar 

  20. Laporte, G., Salazar-González, J., Semet, F.: Exact algorithms for the job sequencing and tool switching problem. IIE Transactions 36(1), 37–45 (2004)

    Article  Google Scholar 

  21. Larrañaga, P., Kuijpers, C., Murga, R., Inza, I., Dizdarevic, S.: Genetic algorithms for the travelling salesman problem: A review of representations and operators. Articial Intelligence Review 13, 129–170 (1999)

    Article  Google Scholar 

  22. Lehmann, E., D’Abrera, H.: Nonparametrics: statistical methods based on ranks. Prentice-Hall, Englewood Cliffs (1998)

    Google Scholar 

  23. Lu, S., Sun, C.: Coevolutionary quantum-behaved particle swarm optimization with hybrid cooperative search. In: Proceedings of the Pacific-Asia Workshop on Computational Intelligence and Industrial Applications PACIIA 2008, vol. 1, pp. 109–113 (2008)

    Google Scholar 

  24. Malek, R.: Collaboration of metaheuristic algorithms through a multi-agent system. In: Mařík, V., Strasser, T., Zoitl, A. (eds.) Holonic and Multi-Agent Systems for Manufacturing. LNCS, vol. 5696, pp. 72–81. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  25. Milano, M., Roli, A.: Magma: a multiagent architecture for metaheuristics. IEEE Transactions on Systems, Man, and Cybernetics, Part B 34(2), 925–941 (2004)

    Article  Google Scholar 

  26. Moscato, P., Cotta, C.: Memetic algorithms. In: González, T. (ed.) Handbook of Approximation Algorithms and Metaheuristics, ch. 27. Chapman & Hall/CRC Press (2007)

    Google Scholar 

  27. Oerlemans, A.: Production planning for flexible manufacturing systems. Ph.d. dissertation, University of Limburg, Maastricht, Limburg, Netherlands (1992)

    Google Scholar 

  28. Pelta, D., Cruz, C., Sancho-Royo, A., Verdegay, J.: Using memory and fuzzy rules in a co-operative multi-thread strategy for optimization. Information Sciences 176, 1849–1868 (2006)

    Article  Google Scholar 

  29. Puchinger, J., Raidl, G.R.: Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification. In: Mira, J., Álvarez, J.R. (eds.) IWINAC 2005. LNCS, vol. 3562, pp. 41–53. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  30. Shirazi, R., Frizelle, G.: Minimizing the number of tool switches on a flexible machine: an empirical study. International Journal of Production Research 39(15), 3547–3560 (2001)

    Article  Google Scholar 

  31. Talbi, E.G., Bachelet, V.: Cosearch: A parallel cooperative metaheuristic. Journal of Mathematical Modelling and Algorithms 5(1), 5–22 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  32. Tang, C., Denardo, E.: Models arising from a flexible manufacturing machine, part I: minimization of the number of tool switches. Operations Research 36(5), 767–777 (1988)

    Article  MATH  Google Scholar 

  33. Toulouse, M., Crainic, T.G., Sanso, B., Thulasiraman, K.: Self-organization in cooperative tabu search algorithms. In: Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, vol. 3, pp. 2379–2384 (1998)

    Google Scholar 

  34. Toulouse, M., Thulasiraman, K., Glover, F.: Multi-level cooperative search: A new paradigm for combinatorial optimization and an application to graph partitioning. In: Amestoy, P.R., Berger, P., Daydé, M., Duff, I.S., Frayssé, V., Giraud, L., Ruiz, D. (eds.) Euro-Par 1999. LNCS, vol. 1685, pp. 533–542. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  35. Tzur, M., Altman, A.: Minimization of tool switches for a flexible manufacturing machine with slot assignment of different tool sizes. IIE Transactions 36(2), 95–110 (2004)

    Article  Google Scholar 

  36. Zhou, B.H., Xi, L.F., Cao, Y.S.: A beam-search-based algorithm for the tool switching problem on a flexible machine. The International Journal of Advanced Manufacturing Technology 25(9-10), 876–882 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Amaya, J.E., Cotta, C., Leiva, A.J.F. (2010). Hybrid Cooperation Models for the Tool Switching Problem. In: González, J.R., Pelta, D.A., Cruz, C., Terrazas, G., Krasnogor, N. (eds) Nature Inspired Cooperative Strategies for Optimization (NICSO 2010). Studies in Computational Intelligence, vol 284. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12538-6_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12538-6_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12537-9

  • Online ISBN: 978-3-642-12538-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics