Convergence Analysis for Ant Colony Algorithm
Baojiang Zhao;
Convergence Analysis for Ant Colony Algorithm
A general method for combinatorial optimization problems heuristically by the Ant System approach is proposed. According to the two different conditions, some convergence analysis for Ant Colony System (ACS) are obtained. The global searching and convergence ability are improved by adaptively changing the lower pheromone bound. It is proved that ACS finds an optimal solution with probability 1.
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
selected citations
Citations provided by BIP!
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
Citations provided by BIP!popularityPopularity provided by BIP!
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
Popularity provided by BIP! 0
Average
Average
Average
This action will publish the selected files and record in Zenodo. Are you sure you want to proceed?