The genetic algorithms (GAs) can be used as a global optimization tool for continuous and discrete functions problems. However, a simple GA may suffer from slow convergence, and instability of results. GAs' problem solution power can be increased by local searching. In this study a new local random search algorithm based on GAs is suggested in order to reach a quick and closer result to the optimum solution. (c) 2007 Elsevier Inc. All rights reserved.