A Multi-Agent Approach To Solving Dynamic Traveling Salesman Problem

被引：0

作者：

Varga, Andrea ^{[1
]}

Chira, Camelia ^{[1
]}

Dumitrescu, D. ^{[1
]}

机构：

[1] Univ Babes Bolyai, Cluj Napoca 400084, Romania

来源：

ADVANCED BIO-INSPIRED COMPUTATIONAL METHODS | 2008年

关键词：

Dynamic TSP; Sensitive Stigmergic Agent System; multi-agent system; stigmergy;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

A multi-agent approach to solving dynamic Traveling Salesman Problem (TSP) is presented. In the dynamic version of TSP cities can be dynamically added or removed. Proposed multi-agent approach is based on the Sensitive Stigmergic Agent System model refined with new type of messages between agents. The agents send messages every time a change occurs, for instance, when an agent observes that a city has disappeared or appeared. The system is tested for various pheromone sensitivity level values and learning ability for agents. Numerical results and comparisons with the Ant Colony System and Ant System models indicate a good performance of the proposed model.

引用

页码：220 / 227

页数：8

共 7 条

[1]

CHIRA C, 2007, 2 INT WORKSH NAT INS

[2]

CHIRA C, 2007, MICC TECH REPORT SER, V704, P51

[3] Ant colony optimization theory: A survey [J].

Dorigo, M ;

Blum, C .

THEORETICAL COMPUTER SCIENCE, 2005, 344 (2-3) :243-278

[4] Ant algorithms for discrete optimization [J].

Dorigo, M ;

Di Caro, G ;

Gambardella, LM .

ARTIFICIAL LIFE, 1999, 5 (02) :137-172

[5]

Eyckelhof C. J., 2002, LNCS, V2463, P88, DOI DOI 10.1007/3-540-45724-08

[6]

GUNTSCH M, 2001, P GEN EV COMP C GECC, P860

[7]

Guntsch M., 2002, P ANT ALG BRUSSL BEL, P111, DOI 10.1007/3-540-45724-010

← 1 →