Improved Backtracking Search Algorithm Based on Population Control Factor and Optimal Learning Strategy

• Published in: Mathematical problems in engineering Vol. 2017; no. 2017; pp. 1 - 13
• Main Authors: Guo, Yanju, Chen, Lei, Jia, Zhicheng, Zhao, Lei
• Format: Journal Article
• Language: English
• Published: Cairo, Egypt Hindawi Publishing Corporation 01.01.2017; Hindawi; John Wiley & Sons, Inc
• Subjects: Computer engineering; Computer simulation; Convergence; Differential equations; Evolutionary algorithms; Foraging behavior; Genetic algorithms; Machine learning; Mathematical problems; Mutation; Optimization algorithms; Particle swarm optimization; Population; Population control; Search algorithms; Searching; Software; China
• ISSN: 1024-123X; 1026-7077; 1563-5147; 1563-5147
• DOI: 10.1155/2017/3017608

Backtracking search algorithm (BSA) is a relatively new evolutionary algorithm, which has a good optimization performance just like other population-based algorithms. However, there is also an insufficiency in BSA regarding its convergence speed and convergence precision. For solving the problem shown in BSA, this article proposes an improved BSA named COBSA. Enlightened by particle swarm optimization (PSO) algorithm, population control factor is added to the variation equation aiming to improve the convergence speed of BSA, so as to make algorithm have a better ability of escaping the local optimum. In addition, enlightened by differential evolution (DE) algorithm, this article proposes a novel evolutionary equation based on the fact that the disadvantaged group will search just around the best individual chosen from previous iteration to enhance the ability of local search. Simulation experiments based on a set of 18 benchmark functions show that, in general, COBSA displays obvious superiority in convergence speed and convergence precision when compared with BSA and the comparison algorithms.