In this paper, we propose the binary version of the Social Group Optimization (BSGO) algorithm for solving the 0-1 knapsack problem. The standard Social Group Optimization (SGO) is used for continuous optimization problems. So a transformation function is used to convert the continuous values generated from SGO into binary ones. The experiments are carried out using both low-dimensional and high-dimensional knapsack problems. The results obtained by the BSGO algorithm are compared with other binary optimization algorithms. Experimental results reveal the superiority of the BSGO algorithm in achieving a high quality of solutions over different algorithms and prove that it is one of the best finding algorithms especially in high-dimensional cases.

In this paper, a new optimization technique known as Teaching–Learning-Based Optimization (TLBO) is implemented for solving high dimensional function optimization problems. Even though there are several other approaches to address this issue but the cost of computations are more in handling high dimensional problems. In this work we simulate TLBO for high dimensional benchmark function optimizations and compare its results with very widely used alternate techniques like Differential Evolution (DE) and Particle Swarm Optimization (PSO). Results clearly reveal that TLBO is able to address the computational cost issue for all simulated functions to a large dimensions compared to other two techniques.

Teaching–Learning-Based Optimization (TLBO) is recently being used as a new, reliable, accurate and robust optimization technique scheme for global optimization over continuous spaces. This paper presents an improved variant of TLBO algorithm, called Improved Teaching–Learning-Based Optimization (ITLBO). A performance comparison of the proposed method is provided against the original TLBO and some other algorithms. The improved TLBO algorithm shows a marked improvement in performance over the traditional TLBO on several benchmark optimization problems.