Skip to Main Content
In this paper, we propose an original solution for the integer value combinatorial optimization problem using multi-agents. The characteristics of this algorithm are that the coupling structure and the coupling operation suitable for the assigned problem are assumed, and an optimal solution is obtained for mutual interference of multiple state transitions using multi-agents. To verify the performance, we apply this algorithm to the traveling salesman problem and report simulation results. We also discuss combination of some coupling operations to improve the convergence performance.