Memetic binary particle swarm optimization for discrete optimization problems

In recent decades, many researchers have been interested in algorithms inspired by the observation of natural phenomena to solve optimization problems. Among them, meta-heuristic algorithms have been extensively applied in continuous (real) and discrete (binary) search spaces. Such algorithms are appropriate for global searches because of their global exploration and local exploitation abilities. In this study, a memetic binary particle swarm optimization (BPSO) scheme is introduced based on hybrid local and global searches in BPSO. The algorithm, binary hybrid topology particle swarm optimization (BHTPSO), is used to solve the optimization problems in the binary search spaces. In addition, a variant of the proposed algorithm, binary hybrid topology particle swarm optimization quadratic interpolation (BHTPSO-QI), is proposed to enhance the global searching capability. These algorithms are tested on two set of problems in the binary search space. Several nonlinear high-dimension functions and benchmarks for the 0–1 multidimensional knapsack problem (MKP) are employed to evaluate their performances. Their results are compared with some well-known modified binary PSO and binary gravitational search algorithm (BGSA). The experimental results showed that the proposed methods improve the performance of BPSO in terms of convergence speed and solution accuracy.