2D P colony for vicinity search optimisation

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19240%2F25%3AA0001545" target="_blank" >RIV/47813059:19240/25:A0001545 - isvavai.cz</a>

Result on the web

<a href="https://link.springer.com/article/10.1007/s41965-025-00193-0" target="_blank" >https://link.springer.com/article/10.1007/s41965-025-00193-0</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s41965-025-00193-0" target="_blank" >10.1007/s41965-025-00193-0</a>

Result language

angličtina

Original language name

2D P colony for vicinity search optimisation

Original language description

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.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2025

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Journal of Membrane Computing

ISSN

2523-8906

e-ISSN

2523-8914

Volume of the periodical

2025

Issue of the periodical within the volume

14 November 2025

Country of publishing house

GB - UNITED KINGDOM

Number of pages

11

Pages from-to

1-11

UT code for WoS article

001614395700001

EID of the result in the Scopus database

2-s2.0-105021820599