This paper defines the average keystrokes of English words and Chinese Pinyin, and rearranges the mobile telephone keyboard layout by Genetic-Iterative Local Search using it as a meteyard.

An evolutionary iterated local search algorithm with the features of multiple neighborhood structures and population-based evolution is designed to solve the model.

Finally, we present an iterated local search document clustering alglrithm based on K-medoid, which uses the improved K-medoid do.

This paper presents an Iterated Local Search document clustering algorithm based on K-means, it takes the solution by K-means algorithm as its initial solution, from which local search process is started; during the searching, some bad solutions are accepted.

Local search and perturbation are analyzed,which are the key techniques of iterated local search algorithm.

For the local search capability of quantum-inspired genetic algorithm(QGA) is Limited,a quantum-inspired genetic algorithm with local search(LSQGA) is presented to solve the reactive power optimization problem.

For this problem,it presents a new iterated local search algorithm based on dynasearch neighborhood with the following characters: 1) While traditional local search algorithms make a single move at each iteration,dynasearch allows a series of i.

In the second phase,we construct improved dynasearch algorithm for VRP,and combine dynasearch with the iterated local search algorithm,which is named as iterated dynasearch algorithm.