A Deterministic Model for Analyzing the Dynamics of Ant System Algorithm and Performance Amelioration through a New Pheromone Deposition Approach
Ayan Acharya, Deepyaman Maiti, Amit Konar, Ramadoss Janarthanan

TL;DR
This paper introduces a differential equation-based deterministic model for Ant System dynamics and proposes an exponential pheromone deposition method, significantly enhancing solution quality and convergence speed in ant colony optimization algorithms.
Contribution
It presents a novel differential equation model for analyzing ant system dynamics and introduces an exponential pheromone deposition approach to improve algorithm performance.
Findings
Proposed deposition rule outperforms traditional in solution quality.
Enhanced convergence speed with the new pheromone strategy.
Established algebraic relationships between parameters and problem features.
Abstract
Ant Colony Optimization (ACO) is a metaheuristic for solving difficult discrete optimization problems. This paper presents a deterministic model based on differential equation to analyze the dynamics of basic Ant System algorithm. Traditionally, the deposition of pheromone on different parts of the tour of a particular ant is always kept unvarying. Thus the pheromone concentration remains uniform throughout the entire path of an ant. This article introduces an exponentially increasing pheromone deposition approach by artificial ants to improve the performance of basic Ant System algorithm. The idea here is to introduce an additional attracting force to guide the ants towards destination more easily by constructing an artificial potential field identified by increasing pheromone concentration towards the goal. Apart from carrying out analysis of Ant System dynamics with both traditional…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
