This paper proposes an algorithm—multipoint Tabu Search (MPTS) based on POP—which has several advantages for solving combinatorial optimization problems. The proposed algorithm is applied to some problems of traveling salesmen, which are typical combinatorial optimization problems, in order to verify the performance of the proposed algorithm. The simulation results indicate that the proposed method has higher optimality than the conventional Tabu Search (TS).
No takes yet. Share an insight, caveat, or question.
Niizuma et al. (2006) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: