Abstract
This letter presents a new multi-point combinatorial optimization method. The method construes the solution space as a hierarchical structure, and relates the structure to two strategies: the search of a local area and the movement to unsearched area. The strategies using a proximate optimality principle based interaction provide a move to a promising and unsearched area. The performance of the method is verified through simulations using benchmark problems.