k 2024

2D P Colony for Vicinity Search Optimisation

LANGER, Miroslav; Daniel VALENTA a Petr SOSÍK

Základní údaje

Originální název

2D P Colony for Vicinity Search Optimisation

Autoři

LANGER, Miroslav; Daniel VALENTA a Petr SOSÍK

Vydání

25th Conference on Membrane Computing (CMC 2024), 2024

Další údaje

Jazyk

angličtina

Typ výsledku

Prezentace na konferencích

Obor

10201 Computer sciences, information science, bioinformatics

Stát vydavatele

Francie

Utajení

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

Označené pro přenos do RIV

Ano

Kód RIV

RIV/47813059:19240/24:A0001388

Organizační jednotka

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

Klíčová slova anglicky

2D P Colony; Ant Colony Simulation; P systems; Evolving Environment; Optimisation; Bio-inspired computation

Štítky

Příznaky

Mezinárodní význam, Recenzováno
Změněno: 30. 1. 2025 11:00, 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. We build on the original concept of formal colonies where both the environment and agents were implemented by tools of formal grammars. P colonies transformed this concept into the framework of membrane systems, i.e., the environment and agents contain abstract discrete objects and formal rules acting upon them. Adding a 2D geometrical structure and evolution of the environment resulted in the model of 2D evolving P colonies. The model is suitable for simulation of phenomena like stigmergy, hence also for implementation of multi-agent optimisation strategies. The motivation for such an implementation lies in a possible future highly parallel and efficient bio-hardware implementation of 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 extrema of the objective function. The search is oriented with the help of pheromone trails left by previous agents. The trails are subject to a decay and they can eventually vanish. The original formulation of ant algorithms counts on ants immediately collecting found food in the nest. Here we allow the ants to decide randomly whether to collect the food or to continue the search for another food in the vicinity of an already found food source. We demonstrate experimentally that this behaviour improves the search results.

Přiložené soubory

Langer-Valenta-Sosik_2D-P-Colony-for-Vicinity-Search-Optimisation_conference-paper.pdf
Požádat o autorskou verzi souboru
Langer-Valenta-Sosik_2D-P-Colony-for-Vicinity-Search-Optimisation_conference-presentation.pdf
Požádat o autorskou verzi souboru