A novel algorithm which is based on space contraction for solving MINLP problems is proposed. The algorithm applies fast and effective non-complete evolution to the search for the information of better solutions, by which locates the possible area of optimal solutions, determines next search space by the information of elite individuals. The result shows that it is better than other existing evolutionary algorithms in search efficiency, range of applications, accuracy and robustness of solutions.