While proximate optimality of a solution space is evaluated by a correlation coefficient of objective function values and distances among solutions, a Proximate Optimality Principle (POP) based new meta-heuristics for combinatorial optimization problems is proposed in this letter. The performance of the proposed combinatorial optimization method is verified through simulations using two types of typical benchmark problems.
