By improving the traditional algorithm of 8-Neighbor Searching,the average Neighbor Searching times can be reduced from eight to four.

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.

A variable neighborhood search operator and an inversion operator were used to keep the diversity of swarm and improve the algo.

A niche genetic algorithm combined with variable neighborhood search was proposed herein to solve the flow path design of unidirectional AGV systems.

Aiming at Flowshop scheduling problem with limited waiting time,a Hybrid Genetic Algorithm(HGA) combined with constraint satisfaction and variable neighborhood search is proposed.