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.
Similar content being viewed by others
References
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
Belegundu AD (1982) A study of mathematical programming methods for structural optimization. PhD thesis. University of Iowa, Iowa, USA
Cagnina LC, Esquivel SC, Coello CA (2008) Solving engineering optimization problems with the simple constrained particle swarm optimizer. Informatica 32:319–326
Coello CAC, Montes EM (2002) Constraint-handling in genetic algorithms through the use of dominance-based tournament selection. Adv Eng Inform 16(3):193–203
De Jong KA (1975) Analysis of the behavior of a class of genetic adaptive systems. PhD thesis. University of Michigan, Ann Arbor, MI, USA
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–41
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
Franti P, Kivijarvi J, Nevalainen O (1998) Tabu search algorithm for codebook generation in vector quantization. Pattern Recogn. 31(8):1139–1148
Fogel LJ, Owens AJ, Walsh MJ (1966) Artificial intelligence through simulated evolution. Wiley, New York
Glover F (1989) Tabu search—part I. ORSA J Comput 1(3):190–206
He Q, Wang L (2007) An effective co-evolutionary particle swarm optimization for constrained engineering design problems. Eng Appl Artif Intell 20:89–99
Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor
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, Shi Y (2003) Engineering optimization with particle swarm. In: Proceedings of 2003 IEEE swarm intelligence symposium, pp 53–57
Kaveh A, Talatahari S (2010a) A novel heuristic optimization method: charged system search. Acta Mech 213(3–4):267–289
Kaveh A, Talatahari S (2010b) An improved ant colony optimization for constrained engineering design problems. Eng Comput 27(1):155–182
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–6808
Kirkpatrick S, Gelatt C, Vecchi M (1983) Optimization by simulated annealing. Science 220(4598):671–680
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
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–3933
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–194
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 (2008) An empirical study about the usefulness of evolution strategies to solve constrained optimization problems. Int J Gen Syst 37(4):443–473
Reynolds R (1994) An introduction to cultural algorithms. In: The 3rd annual conference on evolutionary programming, pp 131–139
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 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
Saleem SM (2001) Knowledge-based solution to dynamic optimization problems using cultural algorithms. PhD thesis, Wayne State University, USA
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
Sandgren E (1988) Nonlinear integer and discrete programming in mechanical design. In: Proceedings of the ASME design technology conference, pp 95–105
Sha D, Hsu C (2006) A hybrid particle swarm optimization for job shop scheduling problem. Comput Ind Eng 51(4):791–808
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–60
Siarry P, Berthiau G (1997) Fitting of Tabu search to optimize functions of continuous variables. Int J Numer Methods Eng 40:2449–2457. doi:10.1002/(SICI)1097-0207(19970715)40:13<2449:AID-NME172>3.0.CO;2-O
Storn R, Price K (1997) Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11(4):341–359
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
Thangaraj R, Pant M (2011) Particle swarm optimization: hybridization perspectives and experimental illustrations. Appl Math Comput 217(12):5208–5226
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–3742
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Y.-S. Ong.
Rights and permissions
About this article
Cite this article
Ali, M.Z., Reynolds, R.G. Cultural algorithms: a Tabu search approach for the optimization of engineering design problems. Soft Comput 18, 1631–1644 (2014). https://doi.org/10.1007/s00500-013-1169-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-013-1169-5