Abstract
Recently, AGO with memory algorithm has been proposed to solve traveling salesman problems. In this article, we propose an improved AGO with memory algorithm which is applied 2-opt algorithm. We compare the solution search performance.
| Translated title of the contribution | Performance Comparison of Search Ability of ACO with Memory for TSP (Nonlinear Problems) |
|---|---|
| Original language | American English |
| Pages (from-to) | 71 - 74 |
| Journal | IEICE technical report. Nonlinear problems |
| Volume | 113 |
| Issue number | 341 |
| State | Published - 6 Dec 2013 |