Deep-Mining Backtracking Search Optimization Algorithm Guided by Collective Wisdom. (26th December 2019)

• Record Type: Journal Article
• Authors: Li, Zheng; Hu, Zhongbo; Miao, Yongfei; Xiong, Zenggang; Xu, Xinlin; Dai, Canyun
• Other Names: Álvarez José Domingo Academic Editor.
• Is Part Of: Mathematical problems in engineering. Volume 2019(2019)
• Publication Date: 2019-12-26
• Subjects: Engineering mathematics -- Periodicals; 510.2462
• DOI: 10.1155/2019/2540102
• Languages: English
• ISSNs: 1024-123X

Abstract

Abstract : The backtracking search optimization algorithm (BSA) is a recently proposed evolutionary algorithm with simple structure and well global exploration capability, which has been widely used to solve optimization problems. However, the exploitation capability of the BSA is poor. This paper proposes a deep-mining backtracking search optimization algorithm guided by collective wisdom (MBSAgC) to improve its performance. The proposed algorithm develops two learning mechanisms, i.e., a novel topological opposition-based learning operator and a linear combination strategy, by deeply mining the winner-tendency of collective wisdom. The topological opposition-based learning operator guides MBSAgC to search the vertices in a hypercube about the best individual. The linear combination strategy contains a difference vector guiding individuals learning from the best individual. In addition, in order to balance the overall performance, MBSAgC simulates the clusterity-tendency strategy of collective wisdom to develop another difference vector in the above linear combination strategy. The vector guides individuals to learn from the mean value of the current generation. The performance of MBSAgC is tested on CEC2005 benchmark functions (including 10-dimension and 30-dimension), CEC2014 benchmark functions, and a test suite composed of five engineering design problems. The experimental results of MBSAgC are very competitive compared with those of the original BSA and state-of-the-art algorithms.