This partial inversion operator can be described as follows: assume current city is C, the next city is the nearest city D, if
cities C and D are non-adjacent, then the segment between the farthest city E and the
nearest city D (includes D) carry out inversion operator, after that, the next city of C
perform same partial inversion operator. The tour generated by the last city performs the
inversion operator is added to bulletin board, and the last city is regarded as new nest.
Figure 1 shows the flow chart of initial circuit construction.