Location-Aware Based Neighbor Network Construction Algorithm and P2P Neighbor Search in Maze;

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.

The algorithm of neighbor finding from back to front with decomposing Quaternary code is presented.

A neighbor finding algorithm is presented in details,and the relationships between diamonds and hierarchy,diamond and grid,and grids and hierarchy are constructed using their adjacent .

This predictor takes the K nearest neighbor searching method to gain the K neighbors of the sample to be predicted,trains a RBF network with these neighbors,and predicts the sample with well trained RBF network.