The method used a octant-search approach and experimental variation function to reduce the cluster effects and search distance,and adopted Java3D as virtual 3D-visualization environment so that the generated three-dimensional raster data could be showed in the environment.

A restricted genetic algorithm combined with area searching has been put forward in this paper, and some important characters of RGAAS have been discussed, and the control mechanism Of RGAAS has been analyzed.

A restricted genetic algorithm of area searching, which is based on automatic area parting, has been implemented, and the control strategy of area searching is discussed also.

An adaptive hybrid genetic algorithm was developed to solve VRPSDP,which used a special optimal splitting procedure to get the fitness values,and took a local search as the mutation operator.

An improved algorithm,combined ant algorithm with local search,is put forward to reduce the inherent deficiency of traditional ant algorithm in solving JSP.

A new local search algorithm for solving the minimum make span problem of job shop scheduling is presented.

Hybrid Constraint Satisfaction and Neighborhood Search Algorithm and its Application

Then a fast neighborhood search algorithm was presented.

In accordance with the characteristic of NPhard,a mutation based on neighborhood search is proposed,and a hybrid genetic algorithm is also established,which used the idea of neighborhood search and combined the heuristic algorithm and genetic algorithm.