Operational Research

, Volume 18, Issue 3, pp 781–799 | Cite as

Dynamic group search algorithm for solving an engineering problem

  • Rui TangEmail author
  • Simon Fong
  • Suash Deb
  • Raymond Wong
Original Paper


Recently many researchers invented a wide variety of meta-heuristic optimization algorithms. Most of them achieved remarkable performance results by infusing the natural phenomena or biological behaviors into the search logics of the optimization algorithms, such as PSO, Cuckoo Search and so on. Although these algorithms have promising performance, there still exist a drawback—it is hard to find a perfect balance between the global exploration and local exploitation from the traditional swarm optimization algorithms. Like an either-or problem, algorithms that have better global exploration capability come with worse local exploitation capability, and vice versa. In order to address this problem, in this paper, we propose a novel Dynamic Group Search Algorithm (DGSA) with enhanced intra-group and inter-group communication mechanisms. In particular, we devise a formless “group” concept, where the vectors of solutions can move to different groups dynamically based on the group best solution fitness, the better group has the more vectors. Vectors inside a group mainly focus on the local exploitation for enhancing its local search. In contrast, inter-group communication assures strong capability of global exploration. In order to avoid being stuck at local optima, we introduce two types of crossover operators and an inter-group mutation. Experiments using benchmarking test functions for comparing with other well-known optimization algorithms are reported. DGSA outperforms other algorithms in most cases. The DGSA is also applied to solve welded beam design problem. The promising results on this real world problem show the applicability of DGSA for solving an engineering design problem.


Component Group search algorithm Optimization 



The authors are thankful for the financial support from the Research Grant Temporal Data Stream Mining by Using Incrementally Optimized Very Fast Decision Forest (iOVFDF), Grant No. MYRG2015-00128-FST, and Research Grant ‘Nature-Inspired Computing and Metaheuristics Algorithms for Optimizing Data Mining Performance’, Grant No. MYRG2016-00069-FST.offered by the University of Macau, FST, and RDAO.


  1. Bratton J (2015) Introduction to work and organizational behavior. Palgrave Macmillan, LondonCrossRefGoogle Scholar
  2. Ioannou G, Kritikos MN (2004) Optimization of material handling in production and warehousing facilities. Oper Res Int J 4(3):317CrossRefGoogle Scholar
  3. Kosmidou K, Zopounidis C (2002) An optimization scenario methodology for bank asset liability management. Oper Res Int J 2(2):279CrossRefGoogle Scholar
  4. Mantegna RN, Stanley HE (1994) Stochastic process with ultraslow convergence to a Gaussian: the truncated Lévy flight. Phys Rev Lett 73(22):2946CrossRefGoogle Scholar
  5. Noman N, Iba H (2008) Accelerating differential evolution using an adaptive local search. IEEE Trans Evol Comput 12(1):107–125CrossRefGoogle Scholar
  6. Pardalos PM (2006) Advances in global optimization: methods and applications. In: 5th international conference on advances in global optimization: methods and applications. Myconos, GreeceGoogle Scholar
  7. Pinter WN, Hobson EA, Smith JE, Edelman AJ, Shizuka D, De SS, Fewell J (2013) The dynamics of animal social networks: analytical, conceptual, and theoretical advances. Behav Ecol 25(2):242–255CrossRefGoogle Scholar
  8. Shlesinger MF, Zaslavsky GM, Frisch U (1995) Lévy flights and related topics in physics. Proceedings of the international workshop held at Nice, France, 27–30 June 1994, Lecture notes in physics, vol 450. Springer, Berlin Google Scholar
  9. Tang R, Fong S, Yang XS, Deb S (2012) Wolf search algorithm with ephemeral memory. In: Digital information management (ICDIM),2012 Seventh International Conference on IEEE, pp 165–172Google Scholar
  10. Wong KC, Wu CH, Mok RK, Peng C, Zhang Z (2012) Evolutionary multimodal optimization using the principle of locality. Inf Sci 194:138–170CrossRefGoogle Scholar
  11. Yang XS (2011) Bat algorithm for multi-objective optimisation. Int J Bio-Inspir Comput 3(5):267–274CrossRefGoogle Scholar
  12. Yang XS, Deb S (2009)Cuckoo search via Lévy flights. In: Nature & biologically inspired computing. NaBIC 2009. World Congress on IEEE, pp 210–214Google Scholar
  13. Yang XS, Ting TO, Karamanoglu M (2013) Random walks, Lévy flights, markov chains and metaheuristic optimization. In: Jung H-K, Kin JT, Sahama T, Yang C-H (eds) Future information communication technology and applications. Springer, Netherland, pp 1055–1064Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2017

Authors and Affiliations

  • Rui Tang
    • 1
    Email author
  • Simon Fong
    • 1
  • Suash Deb
    • 2
    • 3
  • Raymond Wong
    • 4
  1. 1.Department of Computer and Information ScienceUniversity of MacauTaipa, Macau SARChina
  2. 2.IT & Educational ConsultantRanchiIndia
  3. 3.Decision Sciences and Modelling ProgramVictoria UniversityMelbourneAustralia
  4. 4.School of Computer Science and EngineeringUniversity of New South WalesSydneyAustralia

Personalised recommendations