A Four Vertices and Three Lines Genetic Algorithm(4V3LGA)is proposed to resolve the traveling salesman problem, which is proven to be NP-complete. The special part of the proposed algorithm is two-phase strategies. The first local optimization strategy is the mutation operator, which is executed to reverse every Local Hamiltonian Path(LHP).Every LHP contains more than 2 vertices and generates the shorter Hamiltonian Cycles(HC). The second local optimization is HC segmentation, which is executed to divide HC...