This paper proposes a new neighborhood search method for solving combinatorial optimization problems based on Proximate Optimality Principle (POP). The proposed combinatorial optimization method has higher optimality and lower computational complexity than conventional neighborhood search methods. The proposed method is applied to several typical combinatorial optimization problems in order to verify the performance of the proposed method.
