Neighborhood: Neighborhood refers to a basic topological structure on a set. In set theory, it is any open interval centered on point A, which is denoted as: U(a). In the fields of topology and related mathematics, neighborhood is a basic concept in topological space. There are works about neighborhood axiom (neighborhood axiom is the basic concept of modern mathematical topology), open neighborhood, closed neighborhood and centripetal neighborhood.

Unified structure of generalized neighborhood search algorithm;

1. The optimization process is divided into two aspects: aspect 1, stratification based on optimization space (decomposing the original problem into sub-problems and finally reversely synthesizing the solution of each sub-problem into the solution of the original problem), and stratification based on optimization process (dividing the process hierarchy into several stages, and using different search algorithms or neighborhood functions to optimize each stage). At present, the structural types of hybrid algorithms can be summarized as serial, mosaic and parallel.

Serial structure.

Mosaic structure.

Parallel structure (divided into synchronous parallel, asynchronous parallel and network structure).

Synchronization: Each sub-algorithm is relatively independent, but the communication with the main process must be synchronized.

Asynchronous: the communication between the sub-algorithm and the main process is not limited by other sub-algorithms.

Network structure: each algorithm performs independent search on independent memory, and the communication between algorithms is transmitted to each other through the network? .