Abstract Typically, Graph Coloring Problem (GCP) is one of the key features for graph
stamping in graph theory. The general approach is to paint at least edges, vertices, or the …

Metaheuristic algorithms (MHs) have a long history that can be traced back to genetic
algorithms and evolutionary computing in the 1950s. Since February 2008, with the birth of …

In this research paper, we present a sensitivity analysis of parameters utilized in an agent-
based model for crowd simulations. The model is made up of two types of agents that …

In this paper, we introduce some new methodologies in a general path problem. Finding a
good path is always a desirable task and it can be also crucial in emergency and panic …

Finding shortest path in a labyrinth, made up of roads, crosses and dead ends, and where
entrance and exit dynamically change during the time, is an important and challenging …

This paper introduces an agent-based model grounded in the ACO algorithm to investigate
the impact of partitioning ant colonies on algorithmic performance. The exploration focuses …

This paper presents an experimental analysis of how different behavior performed by a
group of ants affects the optimization efficiency of the entire colony. Two different interaction …

In this paper, we propose an agent-based model for crowd simulation. It is made up of two
types of agents that act differently: collaboratives, which share information about the paths …

Nature-inspired computing algorithms (NICs in short) inherit a certain length of history
tracing back to Genetic Algorithm and Evolutionary Computing in the 50's. Since February …

This doctoral thesis investigates competition dynamics within complex systems, particularly
within the framework of network science. It addresses the interplay between cooperation and …