A hybrid method based on global search and local search is discussed and a hybrid algorithm based on neighborhood search and genetic algorithms is built. The hybrid algorithm is of good searching performance including global and local greedy search. Based on an analysis of the graph contacting characteristics in parking, a neighborhood assumption of parking is given. When the neighborhood assumption is met, the genetic algorithm + neighborhood search could work well. And when it is hard to judge the neighborhood assumption of parking, a genetic algorithm + matching neighborhood hybrid algorithm mechanism is built. And the genetic algorithm and matching variable neighborhood search is applied in parking to solve the problem that local search can  not work. When parking graphics are different, the complexity of solving the problem is different. The results of example parking show that a better parking scheme is found in different parking problems and it shows the hybrid algorithm is effective.