2004Unpublished venueRequires access

Integer value combinatorial optimization algorithm using multi-agents

Yôko Kobayashi, E. Aiyoshi

Open publisher page 1 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Convergence (economics), Travelling salesman problem, Mathematical optimization, Integer (computer science), Combinatorial optimization, Computer science, Coupling (piping), Algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
Integer value combinatorial optimization algorithm using multi-agents — Research Paper | ScholarLens