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
关键词
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 条
  • [31] On a Dynamic Traveling Salesman Problem
    Tarashnina, Svetlana
    Pankratova, Yaroslavna
    Purtyan, Aleksandra
    [J]. CONTRIBUTIONS TO GAME THEORY AND MANAGEMENT, VOL X, 2017, 10 : 326 - 338
  • [32] Dynamic Traveling Salesman Problem
    Fabry, Jan
    [J]. PROCEEDINGS OF THE 24TH INTERNATIONAL CONFERENCE ON MATHEMATICAL METHODS IN ECONOMICS 2006, 2006, : 137 - 145
  • [33] A columnar competitive model for solving multi-traveling salesman problem
    Qu, Hong
    Yi, Zhang
    Tang, HuaJin
    [J]. CHAOS SOLITONS & FRACTALS, 2007, 31 (04) : 1009 - 1019
  • [34] A deep reinforcement learning approach for solving the Traveling Salesman Problem with Drone
    Bogyrbayeva, Aigerim
    Yoon, Taehyun
    Ko, Hanbum
    Lim, Sungbin
    Yun, Hyokun
    Kwon, Changhyun
    [J]. TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2023, 148
  • [35] MAN-MACHINE APPROACH TOWARD SOLVING TRAVELING SALESMAN PROBLEM
    KROLAK, P
    FELTS, W
    MARBLE, G
    [J]. COMMUNICATIONS OF THE ACM, 1971, 14 (05) : 327 - &
  • [36] A MAN-MACHINE APPROACH TOWARD SOLVING TRAVELING SALESMAN PROBLEM
    KROLAK, PD
    FELTS, W
    MARBLE, G
    [J]. IEEE COMPUTER GROUP NEWS, 1970, 3 (03): : 67 - &
  • [37] Solving the traveling salesman problem using a hybrid genetic algorithm approach
    Lin, Wei
    Delgado-Frias, Jose G.
    Gause, Donald C.
    [J]. Artificial Neural Networks in Engineering - Proceedings (ANNIE'94), 1994, 4 : 1069 - 1074
  • [38] A new approach for solving the Traveling Salesman Problem using Neural Networks
    Siqueira, Paulo Henrique
    Scheer, Sergio
    Arns Steiner, Maria Teresinha
    [J]. CISCI 2007: 6TA CONFERENCIA IBEROAMERICANA EN SISTEMAS, CIBERNETICA E INFORMATICA, MEMORIAS, VOL III, 2007, : 36 - +
  • [39] A new hybrid heuristic approach for solving large traveling salesman problem
    Tsai, CF
    Tsai, CW
    Tseng, CC
    [J]. INFORMATION SCIENCES, 2004, 166 (1-4) : 67 - 81
  • [40] A bankruptcy based approach to solving multi-agent credit assignment problem
    Yarahmadi, Hossein
    Shiri, Mohammad Ebrahim
    Navidi, Hamidreza
    Sharifi, Arash
    [J]. INTERNATIONAL JOURNAL OF NONLINEAR ANALYSIS AND APPLICATIONS, 2021, 12 : 1987 - 2018