Linear adjustment of a search space in genetic algorithm

The concept of a search space adjustment is developed in order to improve a performance of genetic algorithms (GAs) for solving numerical constrained optimization problems. Implementation of a linear adjustment of a search space size significantly reduces a computational cost to obtain an optimal solution in comparison with other methods of GA. Ability of this approach is demonstrated by using several test cases. Other constrained optimization algorithms are also used to make comparisons with represented approach. (c) 2018 The Authors. Published by Elsevier B.V.