基于增强、敏感和刺激Agent的E-GTSP方法的统一综述
A Unifying Survey of Reinforced, Sensitive and Stigmergic Agent-Based Approaches for E-GTSP
摘要:
广义旅行商问题(GTSP)是一类NP难的组合优化问题。GTSP的一个变体是E-GTSP,其中E,意思是相等,具有约束:来自图分区的簇的恰好一个节点被访问。E-GTSP的主要目标是从无向图的每个簇中找到一个只经过一个节点的最小费用旅行。基于Agent的方法,涉及到成功地用于解决现实生活中的复杂问题。目前的文件的目的是说明一些变种的基于代理的算法,包括基于蚂蚁的模型,具有特定的属性,用于解决E-GTSP。
英文摘要:
The Generalized Traveling Salesman Problem (GTSP) is one of the NP-hard combinatorial optimization problems. A variant of GTSP is E-GTSP where E, meaning equality, has the constraint: exactly one node from a cluster of a graph partition is visited. The main objective of the E-GTSP is to find a minimum cost tour passing through exactly one node from each cluster of an undirected graph. Agent-based approaches involving are successfully used nowadays for solving real life complex problems. The aim of the current paper is to illustrate some variants of agent-based algorithms including ant-based models with specific properties for solving E-GTSP.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。