Troop search optimization algorithm for constrained problems

  • Biplab ChaudhuriEmail author
  • Kedar Nath Das
Original Article


Troop search optimization (TSO) algorithm is motivated by the dynamic controls of commander/captain over the troops before (during) each combat operation to concoct (active) a bravery battalion force. The attempt is focused to maintain the proper balance between exploration and exploitation in the search space during simulation. The inclusion of operators like ‘swapping crossover’ and ‘cut and fill’ provides additional features in TSO algorithm to make it more robust. The efficiency of TSO is tested over a set of constrained optimization problem test suite CEC 2010. Apart from that, TSO is also employed to solve five real life constrained engineering optimization problems. The empirical results, comparative statistical and graphical analysis concludes with the superiority of TSO over the state-of-art algorithms in solving constrained optimization problems.


Constrained optimization Constraint-handling Modified quadratic approximation 


  1. Akay B, Karaboga D (2012) Artificial bee colony algorithm for large-scale problems and engineering design optimization. J Intell Manuf 23:1001–1014CrossRefGoogle Scholar
  2. Coello CAC (2002) Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput Methods Appl Mech Eng 191(11–12):1245–1287MathSciNetCrossRefzbMATHGoogle Scholar
  3. Das KN, Singh TK (2014) Drosophila food-search optimization. Appl Math Comput 231:566–580MathSciNetzbMATHGoogle Scholar
  4. Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Methods Appl Mech Eng 186:311–338CrossRefzbMATHGoogle Scholar
  5. Deb K (2010) Optimization for engineering design algorithms and examples. Prentice Hall of India, New DelhiGoogle Scholar
  6. Deep K, Das KN (2008) Quadratic approximation based hybrid genetic algorithm for function optimization. Appl Math Comput 203:86–98zbMATHGoogle Scholar
  7. Floudas C.A, Pardalos PM (1987) A collection of test problems for constrained global optimization algorithms. In: Goos G, Hartmanis J (eds) LNCS, vol 455. Springer, NewyorkGoogle Scholar
  8. He Q, Wang L (2007) An effective co-evolutionary particle swarm optimization for constrained engineering design problems. Eng Appl Artif Intell 20:89–99CrossRefGoogle Scholar
  9. Ho PY, Shimizu K (2007) Evolutionary constrained optimization using an addition of ranking method and a percentage-based tolerance value adjustment scheme. Inf Sci 177:2985–3004CrossRefGoogle Scholar
  10. Homaifar A, Lai AHY, Qi X (1994) Constrained optimization via genetic algorithms. Simulation 2(4):242–254CrossRefGoogle Scholar
  11. Huang FZ, Wang L, He Q (2007) An effective co-evolutionary differential evolution for constrained optimization. Appl Math Comput 186:340–356MathSciNetzbMATHGoogle Scholar
  12. Jiao LC, Li L, Shang RH, Liu F, Stolkin R (2013) A novel selection evolutionary strategy for constrained optimization. Inf Sci 239:122–141MathSciNetCrossRefGoogle Scholar
  13. Joines JA, Houck CR (1994) On the use of non stationary penalty functions to solve nonlinear constrained optimization problems with GA’s. In: Proceedings of IEEE international conference on evolutionary computation, pp 579–585Google Scholar
  14. Juarez-Castillo E, Perez-Castro N, Mezura-Montes E (2015) A novel boundary constraint-handling technique for constrained numerical optimization problems. In: IEEE congress on evolutionary computation (CEC) pp 2034–2041Google Scholar
  15. Koziel S, Michalewicz Z (1999) Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization. Evol Comput 7:19–44CrossRefGoogle Scholar
  16. LaTorre A, Muelas S, Pena JM (2015) A comprehensive comparison of large scale global optimizers. Inf Sci 316:517–549CrossRefGoogle Scholar
  17. Lemonge ACC, Barbosa HJC (2004) Adaptive penalty scheme for genetic algorithms in structural optimization. Int J Numer Methods in Eng 59:703–736CrossRefzbMATHGoogle Scholar
  18. Liu H, Cai Z, Wang Y (2010) Hybridizing particle swarm optimization with differential evolution for constrained numerical and engineering optimization. Appl Soft Comput 10:629–640CrossRefGoogle Scholar
  19. Liu L, Mu H, Yang J (2015) Generic constraints handling techniques in constrained multi-criteria optimization and its application. Eur J Oper Res 244(2):576–591MathSciNetCrossRefzbMATHGoogle Scholar
  20. Mallipeddi R, Suganthan PN (2010) Ensemble of constraint handling techniques. IEEE Trans Evol Comput 14:561–579CrossRefGoogle Scholar
  21. Mezura-Montes E, Coello CAC (2005) Useful infeasible solutions in engineering optimization with evolutionary algorithms. In: Gelbukh A, de Albornoz A, Terashima-Marin H (eds) MICAI 2005 advances in artificial intelligence; lecture notes in computer science, vol 3789. Springer, Berlin, Heidelberg, pp 652–662 Google Scholar
  22. Michalewicz Z, Schoenauer M (1995) Evolutionary algorithms for constrained parameter optimization problems. Evol Comput 4(1):1–32CrossRefGoogle Scholar
  23. Mohammad AE, Shoukry AA (2014) Constrained dynamic differential evolution using a novel hybrid constraint handling technique. In: IEEE international conference on systems, man, and cybernetics (SMC) pp 2421–2426Google Scholar
  24. Mohan C, Shankar K (1994) A random search technique for global optimization based on quadratic approximation. Asia Pac J Oper Res 11:93–101Google Scholar
  25. Panda R, Agrawal S, Sahoo M, Nayak R (2016) A novel evolutionary rigid body docking algorithm for medical image registration. Swarm Evol Comput. doi: 10.1016/j.swevo.2016.11.002 Google Scholar
  26. Parsopoulos KE, Vrahatis MN (2005) Unified particle swarm optimization for solving constrained engineering optimization problems. Adv Nat Comput Lect Notes Comput Sci 3612:582–591Google Scholar
  27. Rao RV, Savsani VJ, Vakharia DP (2011) Teaching-learning-based optimization: a novel method for constrained mechanical design optimization problems. CAD 43:303–315Google Scholar
  28. Rodrigues MC, Lima BSLP, Guimaraes S (2016) Balanced ranking method for constrained optimization problems using evolutionary algorithms. Inf Sci 327:71–90CrossRefGoogle Scholar
  29. Runarsson TP, Yao X (2000) Stochastic ranking for constrained evolutionary optimization. IEEE Trans Evol Comput 4(3):274–283CrossRefGoogle Scholar
  30. Runarsson TP, Yao X (2002) Constrained evolutionary optimization: the penalty function approach, Chapter 4. In: Sarker R, Mohammadian M, Yao X (eds) Evolutionary optimization. Kluwer Academic Publishers, Dordrecht, pp 87–113. ISBN 0-7923-7654-4Google Scholar
  31. Sadollah A, Bahreininejad A, Eskandar H, Hamdi M (2013) Mine bomb algorithm: a new population based algorithm for solving constrained engineering optimization problems. Appl Soft Comput 13:2592–2612CrossRefGoogle Scholar
  32. Saha C, Das S, Pal K, Mukherjee S (2014) A fuzzy rule-based penalty function approach for constrained evolutionary optimization. IEEE Trans Cybern 46(12):2953–2965CrossRefGoogle Scholar
  33. Yang JM, Chen YP, Horng JT, Kao CY (1997) Applying family competition to evolution strategies for constrained optimization, vol 1213. Lecture notes in computer Science. Springer, Berlin, pp 201–211Google Scholar
  34. Zaman MF, Saber ME, Ray T, Sarker RA (2016) Evolutionary algorithms for dynamic economic dispatch problems. IEEE Trans Power Syst 31(2):1486–1495CrossRefGoogle Scholar
  35. Zhang H, Ishikawa M (2004) An extended hybrid genetic algorithm for exploring a large search space. In: 2nd International conference on autonomous robots and agents, Palmerston North, New Zealand, pp 244–248Google Scholar
  36. Zhang M, Luo W, Wang X (2008) Differential evolution with dynamic stochastic selection for constrained optimization. Inf Sci 178:3043–3074CrossRefGoogle Scholar
  37. Zhang G, Cheng J, Gheorghe M, Meng Q (2013) A hybrid approach based on differential evolution and tissue membrane systems for solving constrained manufacturing parameter optimization problems. Appl Soft Comput 13:1528–1542CrossRefGoogle Scholar
  38. Zhang C, Lin Q, Gao L, Li X (2015) Backtracking search algorithm with three constraint handling methods for constrained optimization problems. Expert Syst Appl 42(21):7831–7845CrossRefGoogle Scholar

Copyright information

© The Society for Reliability Engineering, Quality and Operations Management (SREQOM), India and The Division of Operation and Maintenance, Lulea University of Technology, Sweden 2017

Authors and Affiliations

  1. 1.Department of MathematicsNational Institute of TechnologySilcharIndia

Personalised recommendations