Abstract
In recent years, optimization methods for planning, operating, and controlling systems have been important with enlargement and complication of systems. Especially, it is important to develop effective algorithms for large scale combinatorial optimization problems. It is experientially known that Proximate Optimality Principle (POP) - good solutions possess some similar structure -holds in most of the engineering combinatorial optimization problems. This paper proposes an algorithm - Multi-Point Tabu Search - that considers POP. The proposed algorithm is applied to some typical combinatorial optimization problems in order to verify the performance of the proposed algorithm.
