具有指数信息素沉积规则的Max-Min蚂蚁系统的推广
Extension of Max-Min Ant System with Exponential Pheromone Deposition Rule
摘要：
提出了一种指数信息素沉积方法，以提高经典蚂蚁算法的性能，采用均匀沉积规则。利用微分方程的简化分析方法，研究了具有指数沉积规则和常数沉积规则的基本蚂蚁系统动力学的稳定性。以求解两个城市间最短路径的连通城市路线图为平台，比较了最大最小蚂蚁系统模型（一种改进的、流行的蚂蚁系统模型）与指数和常数沉积规则的异同。进行了大量的模拟，以找到最佳的非均匀沉积方法的参数设置和实验与这些参数设置显示，上述方法在很大程度上超过了传统的解决方案的质量和收敛时间。
英文摘要：
The paper presents an exponential pheromone deposition approach to improve the performance of classical Ant System algorithm which employs uniform deposition rule. A simplified analysis using differential equations is carried out to study the stability of basic ant system dynamics with both exponential and constant deposition rules. A roadmap of connected cities, where the shortest path between two specified cities are to be found out, is taken as a platform to compare Max-Min Ant System model (an improved and popular model of Ant System algorithm) with exponential and constant deposition rules. Extensive simulations are performed to find the best parameter settings for non-uniform deposition approach and experiments with these parameter settings revealed that the above approach outstripped the traditional one by a large extent in terms of both solution quality and convergence time.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
