A Graph-based Ant System and its convergence

: A general framework for solving combinatorial optimization problems heuristically by the Ant System approach is developed. The framework is based on the concept of a construction graph, a graph assigned to an instance of the optimization problem under consideration, encoding feasible solutions by walks. It is shown that under certain conditions, the solutions generated in each iteration of this Graph

• Type: Journal
• Year: 2000
• Where: FGCS
• Authors: Walter J. Gutjahr
• Keywords: Ant System, Ant System Approach, FGCS 2000, Optimization Problem