Multi-agent approach to distributed ant colony optimization

被引：30

作者：

Ilie, Sorin ^{[1
]}

Badica, Costin ^{[1
]}

机构：

[1] Univ Craiova, Software Engn Dept, Craiova 200440, Romania

来源：

SCIENCE OF COMPUTER PROGRAMMING | 2013年 / 78卷 / 06期

关键词：

Distributed multi-agent middleware; Ant colony optimization; Traveling salesman problem; TRAVELING SALESMAN PROBLEM;

D O I：

10.1016/j.scico.2011.09.001

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

This paper presents a configurable distributed architecture for ant colony optimization. We represent the problem environment as a distributed multi-agent system, and we reduce ant management to messages that are asynchronously exchanged between agents. The experimental setup allows the deployment of the system on computer clusters, as well as on ordinary computer networks. We present experimental results that we obtained by utilizing our system to solve nontrivial instances of the traveling salesman problem. The results support the effectiveness and scalability of our proposal. (C) 2011 Elsevier B.V. All rights reserved.

引用

页码：762 / 774

页数：13

共 22 条

[1]

Ali Al-Dahoud, 2010, American Journal of Applied Sciences, V7, P428, DOI 10.3844/ajassp.2010.428.433

[2]

[Anonymous], 2002, An Introduction to MultiAgent Systems

[3]

[Anonymous], P INT C WEB INT MIN

[4]

[Anonymous], 2004, ANT COLONY OPTIMIZAT

[5]

[Anonymous], COMPUTING INFORM

[6]

[Anonymous], APPL SOFT C IN PRESS

[7]

[Anonymous], P 1 INT S NAT INSP S

[8]

[Anonymous], P 8 INT WORKSH DISTR

[9]

[Anonymous], INT J COMPUTER INTER

[10] A Kohonen-like decomposition method for the Euclidean traveling salesman problem - KNIES_DECOMPOSE [J].

Aras, N ;

Altinel, IK ;

Oommen, J .

IEEE TRANSACTIONS ON NEURAL NETWORKS, 2003, 14 (04) :869-890

← 1 2 3 →