An enhanced heuristic searching algorithm for complicated constrained optimization problems

Abstract

In many complicated constrained optimization problems, intelligent searching technique based algorithms are very inefficient even to get a feasible solution. This paper presents an enhanced heuristic searching algorithm to solve this kind of problems. The proposed algorithm uses known feasible solutions as heuristic information, then orients and shrinks the search spaces towards the feasible set. It is capable of improving the search performance significantly without any complicated and specialized operators. Benchmark problems are tested to validate the effectiveness of the proposed algorithm. © Springer-Verlag Berlin Heidelberg 2006.