Genetic Algorithms with Local Minimum Escaping Technique

Abstract

In this paper, we propose a genetic algorithm(GA) with local minimum escaping technique. This proposed method uses the local minimum escaping techique. It can escape from the local minimum by correcting parameters when genetic algorithm falls into a local minimum. Simulations are performed to scheduling problem without buffer capacity using this proposed method, and its validity is shown. © 2004, The Institute of Electrical Engineers of Japan. All rights reserved.