A Novel Discrete Fruit Fly Optimization Algorithm for Intelligent Parallel Test Sheets Generation

Parallel test sheet generation (PTSG) is a NP-hard combinational optimization problem, in which test sheet generation algorithm with high quality and efficiency is the core technology. Basic fruit fly optimization algorithm (FOA) has the defects of easily relapsing into local optimal and low convergence precision when solving PTSG problem. In this paper, a novel discrete fruit fly optimization algorithm is proposed to solve the PTSG problem, in which a discrete osphesis searching operator based on the problem-specific knowledge is designed to help the FOA escaping from being trapped in local minima. To evaluate the performance of the proposed algorithm, the simulation experiments were conducted using a series of item banks with different scales. The superiority of the proposed algorithm is demonstrated by comparing it with the particle swarm optimization algorithm and differential evolution algorithm.