抄録
Recent years, several multipoint-search-based meta-heuristics such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO) have been proposed and have been proved to be efficient methods for global optimization problems. In this report, a new multipoint-search method, which is based on the interaction among search points is proposed. Some simulations using typical knapsack problems verify the search performance of the proposed method.
