Skip to main content

Optimum Design of Four Mechanical Elements Using Cohort Intelligence Algorithm

  • Chapter
  • First Online:

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

Abstract

In this study, Cohort Intelligence (CI) algorithm is implemented for solving four mechanical engineering problems such as design of closed coil helical spring, belt pulley drive, hollow shaft, and helical spring. As these problems are constrained in nature, a penalty function approach is incorporated. The performance of the constrained CI is compared with other contemporary algorithms such as Genetic Algorithm (GA), Particle Swarm Optimization, Artificial Bee Colony (ABC), Teaching–Learning-Based Optimization (TLBO), and TLBO with Differential Operator (DTLBO). The performance of the constrained CI was better than other algorithms in terms of objective function. The computational cost was quite reasonable, and the algorithm exhibited robustness solving these problems.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.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

Learn about institutional subscriptions

References

  1. Shelokar PS, Siarry P, Jayaraman VK, Kulkarni BD (2007) Particle swarm and ant colony algorithms hybridized for improved continuous optimization. Appl Math Comput 188:129–142

    MathSciNet  MATH  Google Scholar 

  2. He S, Prempain E, Wu QH (2004) An improved particle swarm optimizer for mechanical design optimization problems. Eng Optim 36:585–605

    MathSciNet  Google Scholar 

  3. Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput J 8:687–697

    Google Scholar 

  4. Das S, Biswas A, Dasgupta S, Abraham A (2009) Foundations of computational intelligence volume 3: bacterial foraging optimization algorithm. In: Abraham A, Hassanien AE, Siarry P, Engelbrecht A (eds) Studies in computational intelligence. Springer, Berlin, Heidelberg, pp 23–55

    Google Scholar 

  5. Yang XS, Gandomi AH (2012) Bat algorithm—a novel approach for global engineering optimization. Eng Comput 29:464–483

    Google Scholar 

  6. Rajabioun R (2011) Cuckoo optimization algorithm. Appl Soft Comput 11:5508–5518

    Google Scholar 

  7. Krishnanand KN, Ghose D (2009) Glowworm swarm optimization for simultaneous capture of multiple local optima of multimodal functions. Swarm Intell 3:87–124

    Google Scholar 

  8. Lukasik S, Zak S (2009) Computational collective intelligence. In: Nguyen NT, Kowalczyk R, Chen SM (eds) Semantic web, social networks and multiagent systems: firefly algorithm for continuous constrained optimization tasks. Lecture notes in computer science. Springer, Berlin, Heidelberg, pp 97–106

    Google Scholar 

  9. Ahmed E, El-Sayed AMA, El-Saka HAA (2007) Equilibrium points, stability and numerical solutions of fractional-order predator–prey and rabies models. J Math Anal Appl 325:542–553

    MathSciNet  MATH  Google Scholar 

  10. Haq AN, Sivakumar K, Saravanan R, Muthiah V (2005) Tolerance design optimization of machine elements using genetic algorithm. Int J Adv Manuf Technol 25:385–391

    Google Scholar 

  11. Singh PK, Jain PK, Jain SC (2005) Advanced optimal tolerance design of mechanical assemblies with interrelated dimension chain and process precision limits. Comput Ind 56:179–194

    Google Scholar 

  12. Taylor PD, Jonker LB (1978) Evolutionary stable strategies and game dynamics. Math Biosci 40:145–156

    MathSciNet  MATH  Google Scholar 

  13. Simon D (2008) Biogeography-based optimization. IEEE Trans Evol Comput 12:702–713

    Google Scholar 

  14. Storn R, Price K (1997) Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11:341–359

    MathSciNet  MATH  Google Scholar 

  15. Hunt JE, Cooke DE (1996) Learning using an artificial immune system. J Netw Comput Appl 19:189–212

    Google Scholar 

  16. Moscato P, Cotta C (2003) Handbook of metaheuristics: a gentle introduction to memetic algorithms. In: Glover F, Kochenberger GA (eds) International series in operations research and management science. Springer US, pp 105–144

    Google Scholar 

  17. Sigaud O, Wilson SW (2007) Learning classifier systems: a survey. Soft Comput 11:1065–1078

    MATH  Google Scholar 

  18. Guney K, Durmus A, Basbug S (2014) Backtracking search optimization algorithm for synthesis of concentric circular antenna arrays. Int J Antennas Propag 2014:11

    Google Scholar 

  19. Geem ZW (2008) Novel derivative of harmony search algorithm for discrete design variables. Appl Math Comput 199:223–230

    MathSciNet  MATH  Google Scholar 

  20. Li J, Rhinehart RR (1998) Heuristic random optimization. Comput Chem Eng 22:427–444

    Google Scholar 

  21. Solis FJ, Wets RJB (1981) Minimization by random search techniques. Math Oper Res 6:19–30

    MathSciNet  MATH  Google Scholar 

  22. Debels D, Reyck BD, Leus R, Vanhoucke M (2006) A hybrid scatter search/electromagnetism meta-heuristic for project scheduling. Eur J Oper Res 169:638–653

    MathSciNet  MATH  Google Scholar 

  23. Costa D (1994) A tabu search algorithm for computing an operational timetable. Eur J Oper Res 76:98–110

    MATH  Google Scholar 

  24. Rao RV, More KC (2014) Advanced optimal tolerance design of machine elements using teaching learning based optimization algorithm. Prod Manuf Res 2:71–94

    Google Scholar 

  25. Kulkarni AJ, Durugkar IP, Kumar MR (2013) Cohort intelligence: a self-supervised learning behavior. In: Proceedings of IEEE international conference on systems, man and cybernetics, Manchester, UK, pp 1396–1400

    Google Scholar 

  26. Kulkarni AJ, Baki MF, Chaouch BA (2016) Application of the cohort–intelligence optimization method to three selected combinatorial optimization problems. Eur J Oper Res 250:427–447

    MathSciNet  MATH  Google Scholar 

  27. Kulkarni AJ, Shabir H (2016) Solving 0–1 knapsack problem using cohort intelligence algorithm. Int J Mach Learn Cybernet 7:427–441

    Google Scholar 

  28. Krishnasamy G, Kulkarni AJ, Paramesran R (2014) A hybrid approach for data clustering based on modified cohort intelligence and K-means. Expert Syst Appl 41:6009–6016

    Google Scholar 

  29. Arora JS (2008) Introduction to optimum design, 2nd edn. Elsevier Academic Press, Boston

    Google Scholar 

  30. Das AK, Pratihar DK (2002) Optimal design of machine elements using a genetic algorithm. J Inst Eng 83:97–104

    Google Scholar 

  31. Thamaraikannan B, Thirunavukkarasu V (2014) Design optimization of mechanical components using an enhanced teaching-learning based optimization algorithm with differential operator. Math Problems Eng 2014:10

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Anand J. Kulkarni .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Marde, K., Kulkarni, A.J., Singh, P.K. (2019). Optimum Design of Four Mechanical Elements Using Cohort Intelligence Algorithm. In: Kulkarni, A.J., Singh, P.K., Satapathy, S.C., Husseinzadeh Kashan, A., Tai, K. (eds) Socio-cultural Inspired Metaheuristics. Studies in Computational Intelligence, vol 828. Springer, Singapore. https://doi.org/10.1007/978-981-13-6569-0_1

Download citation

Publish with us

Policies and ethics