J 2025

2D P colony for vicinity search optimisation

LANGER, Miroslav; Daniel VALENTA; Petr SOSÍK a Pawan KUMAR PATNAIK

Základní údaje

Originální název

2D P colony for vicinity search optimisation

Autoři

LANGER, Miroslav; Daniel VALENTA; Petr SOSÍK a Pawan KUMAR PATNAIK

Vydání

Journal of Membrane Computing, London, Springer Nature, 2025, 2523-8906

Další údaje

Jazyk

angličtina

Typ výsledku

Článek v odborném periodiku

Obor

10201 Computer sciences, information science, bioinformatics

Stát vydavatele

Velká Británie a Severní Irsko

Utajení

není předmětem státního či obchodního tajemství

Impakt faktor

Impact factor: 2.900 v roce 2024

Označené pro přenos do RIV

Ano

Kód RIV

RIV/47813059:19240/25:A0001545

Organizační jednotka

Filozoficko-přírodovědecká fakulta v Opavě

EID Scopus

Klíčová slova anglicky

2D P colony; Ant colony simulation; Bio-inspired computing; Evolving environment; Optimisation; P systems

Štítky

Příznaky

Mezinárodní význam, Recenzováno
Změněno: 18. 12. 2025 11:41, Mgr. Kamil Matula, Ph.D.

Anotace

V originále

P colony is a formal computational model suitable for modelling behaviour of simple agents acting in a shared environment. It builds on the framework of membrane systems, where both the environment and agents contain abstract discrete objects and formal rules acting upon them. Adding a 2D geometrical structure and an evolution of the environment results in the model of 2D evolving P colonies. The model is suitable for the simulation of phenomena like stigmergy, hence also for the implementation of multi-agent optimisation strategies. The main motivation lies in the use of P colonies as a high-level description language for optimisation tasks, reconfigurable without programming, and ready for a highly parallel and efficient implementation by existing GPU libraries for P systems. In this paper, we use a 2D P colony to implement an ant colony-inspired optimisation algorithm. The agents—ants—search the environment for food representing the extrema of an objective function. The search is oriented with the help of pheromone trails left by previous agents. The trails are subject to a decay and can eventually vanish. In our previous research, we implemented via a 2D P colony a classical formulation of the ant algorithm where ants immediately collect found food in the nest. Here we introduce an improved 2D P colony implementation inspired by variants of ACO algorithms with local search. We call this variant a vicinity search and we demonstrate experimentally that it greatly improves the search results. Furthermore, the new solution decreases asymptotically the complexity of programs in agents.

Přiložené soubory

Langer-Valenta-Sosik-Patnaik_2D-P-colony-for-vinicity-search-optimisation.pdf
Požádat o autorskou verzi souboru