A proof of convergence for ant algorithms.

DOI10.1016/j.ins.2003.08.018zbMath1076.68070OpenAlexW2053735963MaRDI QIDQ1429868

Ahmed Fahmy, Amr Badr

Publication date: 27 May 2004

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2003.08.018

zbMATH Keywords

ConvergenceAnt algorithmsBirth-death processBranching random walkBranching Wiener process

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (5)

GSA: A gravitational search algorithm ⋮ Ant colony algorithm for traffic signal timing optimization ⋮ Convergence and monotonicity of the hormone levels in a hormone-based content delivery system ⋮ A parallel ant colony algorithm on massively parallel processors and its convergence analysis for the travelling salesman problem ⋮ Mining time series data for segmentation by using ant colony optimization

Cites Work

• Path properties of an infinite system of Wiener processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A proof of convergence for ant algorithms.