Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

Integer value combinatorial optimization algorithm using multi-agents

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kobayashi, Y. ; Tepco Syst. Corp., Tokyo, Japan ; Aiyoshi, E.

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.

Published in:

SICE 2002. Proceedings of the 41st SICE Annual Conference  (Volume:5 )

Date of Conference:

5-7 Aug. 2002