Lamia Benameur

Papers

1

Total Citations

10

H-Index

1

About

Dr. Lamia Benameur is a distinguished researcher in computational intelligence and combinatorial optimisation, with a particular focus on swarm intelligence algorithms for solving NP-hard problems. Her most notable contribution is the pioneering application of the fireworks algorithm (FW) to the travelling salesman problem (TSP), a classic and notoriously difficult combinatorial optimisation challenge. In her highly cited 2017 paper, which has garnered 10 citations, Dr. Benameur demonstrated how the explosive dynamics of fireworks can be elegantly translated into an effective search strategy for finding near-optimal solutions in complex solution spaces. This work bridges nature-inspired computation with real-world logistics and routing challenges, offering a fresh perspective on tackling problems that are easy to state but computationally demanding to solve. Her research has significant implications for fields such as transportation, network design, and manufacturing. Dr. Benameur’s innovative approach continues to inspire further exploration into swarm-based metaheuristics, marking her as a thoughtful contributor to the ongoing evolution of optimisation methodologies.

Research Focus

Key Achievements

1
H-Index
1
Papers
10
Total Citations
10
Avg Citations/Paper
🏆 Most Cited Paper
A fireworks algorithm for solving travelling salesman problem
10 citations · 2017
📈 Most Prolific Year: 2017 (1 Papers)
🤝 Key Collaborators: 2

Top Papers

  1. 1

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 13 days ago