A Multi-agent Approach To Solving Dynamic Traveling Salesman Problem

被引：0

作者：

Varga, Andrea ^{[1
]}

Chira, Camelia ^{[1
]}

Dumitrescu, Dan ^{[1
]}

机构：

[1] Univ Babes Bolyai, Dept Comp Sci, Cluj Napoca 400084, Romania

来源：

BICS 2008: PROCEEDINGS OF THE 1ST INTERNATIONAL CONFERENCE ON BIO-INSPIRED COMPUTATIONAL METHODS USED FOR SOLVING DIFFICULT PROBLEMS-DEVELOPMENT OF INTELLIGENT AND COMPLEX SYSTEMS | 2008年 / 1117卷

关键词：

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.

引用

页码：189 / 197

页数：9