DocumentCode :
3408717
Title :
Integer value combinatorial optimization algorithm using multi-agents
Author :
Kobayashi, Yoko ; Aiyoshi, Eitaro
Author_Institution :
Tepco Syst. Corp., Tokyo, Japan
Volume :
5
fYear :
2002
fDate :
5-7 Aug. 2002
Firstpage :
3145
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.
Keywords :
combinatorial mathematics; multi-agent systems; optimisation; travelling salesman problems; integer value combinatorial optimization algorithm; multiple state transitions; mutual interference; traveling salesman problem; Cities and towns; Genetic algorithms; Ignition; Interference; Minimization methods; Optimization methods; Search methods; Simulated annealing; Testing; Traveling salesman problems;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
SICE 2002. Proceedings of the 41st SICE Annual Conference
Print_ISBN :
0-7803-7631-5
Type :
conf
DOI :
10.1109/SICE.2002.1195612
Filename :
1195612
Link To Document :
بازگشت