Omar Ilaya
Papers
1
Total Citations
4
H-Index
1
About
Omar Ilaya’s research lies at the intersection of combinatorial optimisation, multi-agent systems, and graph theory. In his most-cited work, “A Particle Swarm Optimisation Approach to Graph Permutations” (2007, 4 citations), he introduced a novel application of particle swarm optimisation (PSO) to solve graph permutation problems—a key challenge in designing efficient distributed networks and multi-robotic systems. By demonstrating how PSO can be adapted to rearrange graph nodes for optimal performance, Ilaya provided a flexible, swarm-intelligence-based method for tackling complex combinatorial problems. Though his citation count remains modest, his contribution is notable for bridging bio-inspired algorithms with graph-theoretic applications, offering a practical tool for engineers working on coordination in multi-agent environments. This work stands as a thoughtful exploration of how nature-inspired computation can solve structural optimisation tasks, making it a valuable reference for researchers in swarm robotics and network design.
Research Focus
Key Achievements
Top Papers
- 1A Particle Swarm Optimisation Approach to Graph Permutations4 citations · 2007