抄録
In this paper, a new algorithm for discrete optimization problems is proposed. The algorithm is called “Random Search Method with Intensification and Diversification - Discrete Version ‘RasID-D’. In intensification phase, RasID-D searches the neighborhood with small range, while in diversification phase, searches the large neighborhood. Therefore, RasID-D can search good solutions rapidly and can escape from local minimum. Simulation studies show that RasID-D is more useful and effective than the conventional methods for a certain discrete optimization problems.
