2D P Colony for Vicinity Search Optimisation

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19240%2F24%3AA0001388" target="_blank" >RIV/47813059:19240/24:A0001388 - isvavai.cz</a>

Výsledek na webu

<a href="https://webusers.i3s.unice.fr/CMC2024/accepted/" target="_blank" >https://webusers.i3s.unice.fr/CMC2024/accepted/</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

2D P Colony for Vicinity Search Optimisation

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

2D P Colony for Vicinity Search Optimisation

Popis výsledku anglicky

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.

Druh

O - Ostatní výsledky

CEP obor

—

OECD FORD obor

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

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2024

Kód důvěrnosti údajů

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