Skip to main content
Top
Published in: Soft Computing 8/2014

01-08-2014 | Methodologies and Application

Cultural algorithms: a Tabu search approach for the optimization of engineering design problems

Authors: Mostafa Z. Ali, Robert G. Reynolds

Published in: Soft Computing | Issue 8/2014

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Cultural Algorithms and Tabu search algorithms are both powerful tools to solve intricate constrained engineering and large-scale multi-modal optimization problems. In this paper, we introduce a hybrid approach that combines Cultural Algorithms and Tabu search (CA–TS). Here, Tabu Search is used to transform History Knowledge in the Belief Space from a passive knowledge source to an active one. In each generation of the Cultural Algorithm, we calculate the best individual solution and then seek the best new neighbor of that solution in the social network for that population using Tabu search. In order to speed up the convergence process through knowledge dissemination, simple forms of social network topologies were used to describe the connectivity of individual solutions. This can reduce the number of needed generations while maintaining accuracy and increasing the search radius when needed. The integration of the Tabu search algorithm as a local enhancement process enables CA–TS to leap over false peaks and local optima. The proposed hybrid algorithm is applied to a set of complex non-linear constrained engineering optimization design problems. Furthermore, computational results are discussed to show that the algorithm can produce results that are comparable or superior to those of other well-known optimization algorithms from the literature, and can improve the performance and the speed of convergence with a reduced communication cost.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literature
go back to reference Angeline PJ (1998) Evolutionary optimization versus particle swarm optimization: philosophy and the performance difference. In: Porto VW, Waagen D (eds) EP. LNCS, vol 1447, pp 84–89 Angeline PJ (1998) Evolutionary optimization versus particle swarm optimization: philosophy and the performance difference. In: Porto VW, Waagen D (eds) EP. LNCS, vol 1447, pp 84–89
go back to reference Belegundu AD (1982) A study of mathematical programming methods for structural optimization. PhD thesis. University of Iowa, Iowa, USA Belegundu AD (1982) A study of mathematical programming methods for structural optimization. PhD thesis. University of Iowa, Iowa, USA
go back to reference Cagnina LC, Esquivel SC, Coello CA (2008) Solving engineering optimization problems with the simple constrained particle swarm optimizer. Informatica 32:319–326MATH Cagnina LC, Esquivel SC, Coello CA (2008) Solving engineering optimization problems with the simple constrained particle swarm optimizer. Informatica 32:319–326MATH
go back to reference Coello CAC, Montes EM (2002) Constraint-handling in genetic algorithms through the use of dominance-based tournament selection. Adv Eng Inform 16(3):193–203CrossRef Coello CAC, Montes EM (2002) Constraint-handling in genetic algorithms through the use of dominance-based tournament selection. Adv Eng Inform 16(3):193–203CrossRef
go back to reference De Jong KA (1975) Analysis of the behavior of a class of genetic adaptive systems. PhD thesis. University of Michigan, Ann Arbor, MI, USA De Jong KA (1975) Analysis of the behavior of a class of genetic adaptive systems. PhD thesis. University of Michigan, Ann Arbor, MI, USA
go back to reference Dorigo M, Maniezzo V, Colorni A (1996) The ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern B 26(1):29–41CrossRef Dorigo M, Maniezzo V, Colorni A (1996) The ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern B 26(1):29–41CrossRef
go back to reference Eberhart RC, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of the sixth international symposium on micro machine and human science, pp 39–43 Eberhart RC, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of the sixth international symposium on micro machine and human science, pp 39–43
go back to reference Franti P, Kivijarvi J, Nevalainen O (1998) Tabu search algorithm for codebook generation in vector quantization. Pattern Recogn. 31(8):1139–1148CrossRef Franti P, Kivijarvi J, Nevalainen O (1998) Tabu search algorithm for codebook generation in vector quantization. Pattern Recogn. 31(8):1139–1148CrossRef
go back to reference Fogel LJ, Owens AJ, Walsh MJ (1966) Artificial intelligence through simulated evolution. Wiley, New York Fogel LJ, Owens AJ, Walsh MJ (1966) Artificial intelligence through simulated evolution. Wiley, New York
go back to reference He Q, Wang L (2007) An effective co-evolutionary particle swarm optimization for constrained engineering design problems. Eng Appl Artif Intell 20:89–99CrossRef He Q, Wang L (2007) An effective co-evolutionary particle swarm optimization for constrained engineering design problems. Eng Appl Artif Intell 20:89–99CrossRef
go back to reference Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor
go back to reference Hu X, Eberhart R (2002) Solving constrained nonlinear optimization problems with particle swarm optimization. In: Proceedings of the sixth world multiconference on systemics, cybernetics and informatics Hu X, Eberhart R (2002) Solving constrained nonlinear optimization problems with particle swarm optimization. In: Proceedings of the sixth world multiconference on systemics, cybernetics and informatics
go back to reference Hu X, Eberhart R, Shi Y (2003) Engineering optimization with particle swarm. In: Proceedings of 2003 IEEE swarm intelligence symposium, pp 53–57 Hu X, Eberhart R, Shi Y (2003) Engineering optimization with particle swarm. In: Proceedings of 2003 IEEE swarm intelligence symposium, pp 53–57
go back to reference Kaveh A, Talatahari S (2010a) A novel heuristic optimization method: charged system search. Acta Mech 213(3–4):267–289CrossRefMATH Kaveh A, Talatahari S (2010a) A novel heuristic optimization method: charged system search. Acta Mech 213(3–4):267–289CrossRefMATH
go back to reference Kaveh A, Talatahari S (2010b) An improved ant colony optimization for constrained engineering design problems. Eng Comput 27(1):155–182CrossRefMATH Kaveh A, Talatahari S (2010b) An improved ant colony optimization for constrained engineering design problems. Eng Comput 27(1):155–182CrossRefMATH
go back to reference Kayhan A, Ceylan H, Ayvaz MT, Gürarslan G (2010) PSOLVER: a new hybrid particle swarm optimization algorithm for solving continuous optimization problems. Expert Syst Appl 37(10):6798–6808CrossRef Kayhan A, Ceylan H, Ayvaz MT, Gürarslan G (2010) PSOLVER: a new hybrid particle swarm optimization algorithm for solving continuous optimization problems. Expert Syst Appl 37(10):6798–6808CrossRef
go back to reference Koza JR (1990) Genetic programming: a paradigm for genetically breeding populations of computer programs to solve problems. Stanford University, Computer Science Department technical report STAN-CS-90-1314 Koza JR (1990) Genetic programming: a paradigm for genetically breeding populations of computer programs to solve problems. Stanford University, Computer Science Department technical report STAN-CS-90-1314
go back to reference Lee KS, Geem ZW (2005) A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice. Comput Methods Appl Mech Eng 194(36–38):3902–3933CrossRefMATH Lee KS, Geem ZW (2005) A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice. Comput Methods Appl Mech Eng 194(36–38):3902–3933CrossRefMATH
go back to reference Li J, Pan Q, Xie S, Jia B, Wang Y (2010) A hybrid particle swarm optimization and tabu search algorithm for flexible job-shop scheduling problem. IJCTE 2(2):189–194CrossRef Li J, Pan Q, Xie S, Jia B, Wang Y (2010) A hybrid particle swarm optimization and tabu search algorithm for flexible job-shop scheduling problem. IJCTE 2(2):189–194CrossRef
go back to reference Montes EM, Coello CAC (2003) Adding a diversity mechanism to a simple evolution strategy to solve constrained optimization problems. In: Proceedings of the congress on evolutionary computation 2003 (CEC 2003), vol 1, pp 6–13 Montes EM, Coello CAC (2003) Adding a diversity mechanism to a simple evolution strategy to solve constrained optimization problems. In: Proceedings of the congress on evolutionary computation 2003 (CEC 2003), vol 1, pp 6–13
go back to reference Montes EM, Coello CAC (2008) An empirical study about the usefulness of evolution strategies to solve constrained optimization problems. Int J Gen Syst 37(4):443–473 Montes EM, Coello CAC (2008) An empirical study about the usefulness of evolution strategies to solve constrained optimization problems. Int J Gen Syst 37(4):443–473
go back to reference Reynolds R (1994) An introduction to cultural algorithms. In: The 3rd annual conference on evolutionary programming, pp 131–139 Reynolds R (1994) An introduction to cultural algorithms. In: The 3rd annual conference on evolutionary programming, pp 131–139
go back to reference Reynolds R, Peng B (2005) Cultural algorithms: computational modeling of how cultures learn to solve problems: an engineering example. Cybern Syst 36(8):753–771 Reynolds R, Peng B (2005) Cultural algorithms: computational modeling of how cultures learn to solve problems: an engineering example. Cybern Syst 36(8):753–771
go back to reference Reynolds RG, Ali MZ (2008) The social fabric approach for a better knowledge integration in cultural algorithms. In: The IEEE world congress on computational intelligence, pp 1–6 Reynolds RG, Ali MZ (2008) The social fabric approach for a better knowledge integration in cultural algorithms. In: The IEEE world congress on computational intelligence, pp 1–6
go back to reference Saleem SM (2001) Knowledge-based solution to dynamic optimization problems using cultural algorithms. PhD thesis, Wayne State University, USA Saleem SM (2001) Knowledge-based solution to dynamic optimization problems using cultural algorithms. PhD thesis, Wayne State University, USA
go back to reference Salehi M (2008) Reverse engineering of temporal gene expression data using dynamic Bayesian networks and evolutionary search. MSc thesis, Queen’s University, Kingston, Ontario, Canada Salehi M (2008) Reverse engineering of temporal gene expression data using dynamic Bayesian networks and evolutionary search. MSc thesis, Queen’s University, Kingston, Ontario, Canada
go back to reference Sandgren E (1988) Nonlinear integer and discrete programming in mechanical design. In: Proceedings of the ASME design technology conference, pp 95–105 Sandgren E (1988) Nonlinear integer and discrete programming in mechanical design. In: Proceedings of the ASME design technology conference, pp 95–105
go back to reference Sha D, Hsu C (2006) A hybrid particle swarm optimization for job shop scheduling problem. Comput Ind Eng 51(4):791–808CrossRef Sha D, Hsu C (2006) A hybrid particle swarm optimization for job shop scheduling problem. Comput Ind Eng 51(4):791–808CrossRef
go back to reference Shen Q, Shi WM, Kong W (2008) Hybrid particle swarm optimization and tabu search approach for selecting genes for tumor classification using gene expression data. Comput Biol Chem 32:53–60CrossRefMATH Shen Q, Shi WM, Kong W (2008) Hybrid particle swarm optimization and tabu search approach for selecting genes for tumor classification using gene expression data. Comput Biol Chem 32:53–60CrossRefMATH
go back to reference Storn R, Price K (1997) Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11(4):341–359CrossRefMATHMathSciNet Storn R, Price K (1997) Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11(4):341–359CrossRefMATHMathSciNet
go back to reference Sun C, Zeng J, Pan J (2011) A modified particle swarm optimization with feasibility-based rules for mixed-variable optimization problems. Int J Innov Comput Inf Control 7(6):3081–3096 Sun C, Zeng J, Pan J (2011) A modified particle swarm optimization with feasibility-based rules for mixed-variable optimization problems. Int J Innov Comput Inf Control 7(6):3081–3096
go back to reference Thangaraj R, Pant M (2011) Particle swarm optimization: hybridization perspectives and experimental illustrations. Appl Math Comput 217(12):5208–5226CrossRefMATH Thangaraj R, Pant M (2011) Particle swarm optimization: hybridization perspectives and experimental illustrations. Appl Math Comput 217(12):5208–5226CrossRefMATH
go back to reference Zhao S, Suganthan P, Pan Q-K, Tasgetiren M (2011) Dynamic multi-swarm particle swarm optimizer with harmony search. Expert Syst Appl 38(4):3735–3742CrossRef Zhao S, Suganthan P, Pan Q-K, Tasgetiren M (2011) Dynamic multi-swarm particle swarm optimizer with harmony search. Expert Syst Appl 38(4):3735–3742CrossRef
Metadata
Title
Cultural algorithms: a Tabu search approach for the optimization of engineering design problems
Authors
Mostafa Z. Ali
Robert G. Reynolds
Publication date
01-08-2014
Publisher
Springer Berlin Heidelberg
Published in
Soft Computing / Issue 8/2014
Print ISSN: 1432-7643
Electronic ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-013-1169-5

Other articles of this Issue 8/2014

Soft Computing 8/2014 Go to the issue

Premium Partner