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

共 50 条

[41] GEOMETRIC APPROACHES TO SOLVING TRAVELING SALESMAN PROBLEM
NORBACK, JP
LOVE, RF
[J]. MANAGEMENT SCIENCE, 1977, 23 (11) : 1208 - 1223
[42] A Dragonfly Algorithm for Solving Traveling Salesman Problem
Hammouri, Abdelaziz I.
Abu Samra, Enas Tawfiq
Al-Betar, Mohammed Azmi
Khalil, Raid M.
Alasmer, Ziad
Kanan, Monther
[J]. 2018 8TH IEEE INTERNATIONAL CONFERENCE ON CONTROL SYSTEM, COMPUTING AND ENGINEERING (ICCSCE 2018), 2018, : 136 - 141
[43] Solving the traveling salesman problem on a quantum annealer
Warren, Richard H.
[J]. SN APPLIED SCIENCES, 2020, 2 (01)
[44] Hybrid Algorithm for Solving Traveling Salesman Problem
Zhao, Ping
Xu, Degang
[J]. 2019 3RD INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE APPLICATIONS AND TECHNOLOGIES (AIAAT 2019), 2019, 646
[45] Development of the Software for Solving the Knapsack Problem by Solving the Traveling Salesman Problem
Sheveleva, Anna M.
Belyaev, Sergey A.
[J]. PROCEEDINGS OF THE 2021 IEEE CONFERENCE OF RUSSIAN YOUNG RESEARCHERS IN ELECTRICAL AND ELECTRONIC ENGINEERING (ELCONRUS), 2021, : 652 - 656
[46] Solving the traveling salesman problem on a quantum annealer
Richard H. Warren
[J]. SN Applied Sciences, 2020, 2
[47] Multi-objective traveling salesman problem: an ABC approach
Indadul Khan
Manas Kumar Maiti
Krishnendu Basuli
[J]. Applied Intelligence, 2020, 50 : 3942 - 3960
[48] Solving the time dependent traveling salesman problem
Li, FY
Golden, B
Wasil, E
[J]. NEXT WAVE IN COMPUTING, OPTIMIZATION, AND DECISION TECHNOLOGIES, 2005, 29 : 163 - 182
[49] Solving the traveling salesman problem with interdiction and fortification
Lozano, Leonardo
Smith, J. Cole
Kurz, Mary E.
[J]. OPERATIONS RESEARCH LETTERS, 2017, 45 (03) : 210 - 216
[50] Learning to cooperate in solving the traveling salesman problem
Qi, DH
Sun, R
[J]. INTERNATIONAL JOURNAL OF NEURAL SYSTEMS, 2005, 15 (1-2) : 151 - 162

← 1 2 3 4 5 →