A Framework of Ant Colony P System

Yueguo Luo, Ping Guo, Mingzhe ZhangIEEE Access 2019 · DOI

Abstract

Ant colony algorithm is a swarm intelligence population-based algorithm, which is inspired from the foraging behavior of ant colonies. Nowadays, the ant colony algorithm has become a very popular topic, and has been widely used in many fields. Also, in the field of P systems, there are many researchers using ant colony algorithms as subalgorithms in their researches, while ant colony algorithms are not implemented in the form of evolutionary rules. In this paper, we proposed an ant colony P system Π <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ACPS</sub> based on the pure evolutionary rule. Π <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ACPS</sub> not only can provide a basic computational framework for the needy P systems researchers, but also can maximally perform the parallelism of ant colony algorithms.An example of solving TSP given in the article illustrates the effectiveness and feasibility Π <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ACPS</sub> .
BibTeX
@inproceedings{luo2019framework,
  author = {Yueguo Luo and Ping Guo and Mingzhe Zhang},
  title = {{A Framework of Ant Colony P System}},
  booktitle = {IEEE Access},
  year = {2019},
  doi = {10.1109/access.2019.2949952},
}

Loading related content...

Figure