Skip to main content

An Imperialist Competitive Algorithm to Solve the Manufacturing Cell Design Problem

  • Conference paper
  • First Online:
Applied Computational Intelligence and Mathematical Methods (CoMeSySo 2017)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 662))

Included in the following conference series:

  • 1050 Accesses

Abstract

The manufacturing cell design problem is part of the cellular manufacturing system and it has been widely studied as an optimization problem. It consists of grouping machines in parts into manufacturing cells in order to minimize the inter-cell movements. In recent years, different approximate methods have been used to solve this problem. In this paper, we propose a new approximate method inspired on the phenomenon of the colonial age, called imperialist competitive algorithm. In the colonial age, the most powerful countries competed to conquer colonies for increasing their power, where the country with highest power was considered the imperialist one. We performed several experiments on a set of 90 instances, where the proposed approach is able to produce optimal values for the whole set of tested instances.

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 EPUB and 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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Atashpaz-Gargari, E., Lucas, C.: Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In: 2007 IEEE Congress on Evolutionary Computation. Institute of Electrical & Electronics Engineers (IEEE), September 2007

    Google Scholar 

  2. Boctor, F.F.: A jinear formulation of the machine-part cell formation problem. Int. J. Prod. Res. 29(2), 343–356 (1991)

    Article  Google Scholar 

  3. Burbidge, J.L.: Production flow analysis for planning group technology. J. Oper. Manag. 10(1), 5–27 (1991)

    Article  Google Scholar 

  4. Durán, O., Rodriguez, N., Consalter, L.A.: Collaborative particle swarm optimization with a data mining technique for manufacturing cell design. Expert Syst. Appl. 37(2), 1563–1567 (2010)

    Article  Google Scholar 

  5. Forouharfard, S., Zandieh, M.: An imperialist competitive algorithm to schedule of receiving and shipping trucks in cross-docking systems. Int. J. Adv. Manuf. Technol. 51(9–12), 1179–1193 (2010)

    Article  Google Scholar 

  6. Hosseini, S., Al Khaled, A.: A survey on the imperialist competitive algorithm metaheuristic: implementation in engineering domain and directions for future research. Appl. Soft Comput. J. 24, 1078–1094 (2014)

    Article  Google Scholar 

  7. Kusiak, A.: The part families problem in flexible manufacturing systems. Ann. Oper. Res. 3(6), 277–300 (1985)

    Article  Google Scholar 

  8. Shargal, M., Shekhar, S., Irani, S.: Evaluation of search algorithms and clustering efficiency measures for machine-part matrix clustering. IIE Trans. 27(1), 43–59 (1995)

    Article  Google Scholar 

  9. Soto, R., Crawford, B., Almonacid, B., Paredes, F.: A migrating birds optimization algorithm for machine-part cell formation problems. In: Mexican International Conference on Artificial Intelligence, pp. 270–281. Springer (2015)

    Google Scholar 

  10. Soto, R., Crawford, B., Almonacid, B., Paredes, F.: Efficient parallel sorting for migrating birds optimization when solving machine-part cell formation problems. Sci. Program. (2016)

    Google Scholar 

  11. Soto, R., Crawford, B., Carrasco, C., Almonacid, B., Reyes, V., Araya, I., Misra, S., Olguín, E.: Solving manufacturing cell design problems by using a dolphin echolocation algorithm. In: International Conference on Computational Science and Its Applications, pp. 77–86. Springer (2016)

    Google Scholar 

  12. Soto, R., Crawford, B., Castillo, C., Paredes, F.: Solving the manufacturing cell design problem via invasive weed optimization. In: Artificial Intelligence Perspectives in Intelligent Systems, pp. 115–126. Springer (2016)

    Google Scholar 

  13. Soto, R., Crawford, B., Vega, E., Johnson, F., Paredes, F.: Solving manufacturing cell design problems using a shuffled frog leaping algorithm. In: The 1st International Conference on Advanced Intelligent System and Informatics (AISI2015), 28–30 November, 2015, Beni Suef, Egypt, pp. 253–261. Springer (2016)

    Google Scholar 

Download references

Acknowledgments

Broderick Crawford is supported by Grant CONICYT/FONDECYT/REGULAR/1171243. Ricardo Soto is supported by Grant CONICYT/FONDECYT/REGULAR/1160455. Rodrigo Olivares is supported by CONICYT/FONDEF/IDeA/ID16I10449 and Postgraduate Grant Pontificia Universidad Católica de Valparaíso (INF-PUCV 2015-2017). Finally, Boris Almonacid are supported by Postgraduate Grant Pontificia Universidad Católica de Valparaíso, Chile (INF-PUCV 2015).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rodrigo Olivares .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Soto, R., Crawford, B., Olivares, R., Ortega, H., Almonacid, B. (2018). An Imperialist Competitive Algorithm to Solve the Manufacturing Cell Design Problem. In: Silhavy, R., Silhavy, P., Prokopova, Z. (eds) Applied Computational Intelligence and Mathematical Methods. CoMeSySo 2017. Advances in Intelligent Systems and Computing, vol 662. Springer, Cham. https://doi.org/10.1007/978-3-319-67621-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67621-0_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67620-3

  • Online ISBN: 978-3-319-67621-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics