Abdesslem Layeb

855 total citations
41 papers, 516 citations indexed

About

Abdesslem Layeb is a scholar working on Artificial Intelligence, Industrial and Manufacturing Engineering and Computational Theory and Mathematics. According to data from OpenAlex, Abdesslem Layeb has authored 41 papers receiving a total of 516 indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Artificial Intelligence, 18 papers in Industrial and Manufacturing Engineering and 11 papers in Computational Theory and Mathematics. Recurrent topics in Abdesslem Layeb's work include Metaheuristic Optimization Algorithms Research (17 papers), Vehicle Routing Optimization Methods (14 papers) and Optimization and Packing Problems (11 papers). Abdesslem Layeb is often cited by papers focused on Metaheuristic Optimization Algorithms Research (17 papers), Vehicle Routing Optimization Methods (14 papers) and Optimization and Packing Problems (11 papers). Abdesslem Layeb collaborates with scholars based in Algeria, France and Saudi Arabia. Abdesslem Layeb's co-authors include Salim Chıkhı, Djamel Eddine Saïdouni, Mohamed Batouche, Souham Meshoul, Meryem Ammi and Zineb Habbas and has published in prestigious journals such as SHILAP Revista de lepidopterología, Journal of Computational and Applied Mathematics and Soft Computing.

In The Last Decade

Abdesslem Layeb

39 papers receiving 474 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Abdesslem Layeb Algeria 11 325 158 125 76 65 41 516
Belaïd Ahiod Morocco 10 348 1.1× 234 1.5× 118 0.9× 89 1.2× 77 1.2× 20 577
Mostafa Mahi Iran 5 310 1.0× 232 1.5× 113 0.9× 70 0.9× 98 1.5× 8 464
Aziz Ouaarab Morocco 3 194 0.6× 128 0.8× 59 0.5× 45 0.6× 53 0.8× 6 349
Changshou Deng China 13 464 1.4× 71 0.4× 227 1.8× 48 0.6× 75 1.2× 64 633
Ahmed F. Ali Egypt 13 341 1.0× 53 0.3× 179 1.4× 87 1.1× 74 1.1× 48 579
Li‐Pei Wong Malaysia 14 357 1.1× 349 2.2× 98 0.8× 81 1.1× 77 1.2× 25 626
Jongho Nang South Korea 8 243 0.7× 48 0.3× 94 0.8× 81 1.1× 93 1.4× 37 460
Mohammed Essaid Riffi Morocco 11 187 0.6× 162 1.0× 52 0.4× 46 0.6× 40 0.6× 37 370
Ayad Turky Australia 13 288 0.9× 203 1.3× 159 1.3× 52 0.7× 63 1.0× 35 566

Countries citing papers authored by Abdesslem Layeb

Since Specialization
Citations

This map shows the geographic impact of Abdesslem Layeb's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Abdesslem Layeb with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Abdesslem Layeb more than expected).

Fields of papers citing papers by Abdesslem Layeb

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Abdesslem Layeb. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Abdesslem Layeb. The network helps show where Abdesslem Layeb may publish in the future.

Co-authorship network of co-authors of Abdesslem Layeb

This figure shows the co-authorship network connecting the top 25 collaborators of Abdesslem Layeb. A scholar is included among the top collaborators of Abdesslem Layeb based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Abdesslem Layeb. Abdesslem Layeb is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Layeb, Abdesslem. (2024). Differential evolution algorithms with novel mutations, adaptive parameters, and Weibull flight operator. Soft Computing. 28(11-12). 7039–7091. 20 indexed citations
2.
Layeb, Abdesslem, et al.. (2024). A Novel Crowding Clustering Algorithm for Unsupervised and Supervised Filter Feature Selection Problem. Arabian Journal for Science and Engineering. 50(15). 11887–11925.
3.
Layeb, Abdesslem. (2023). ck-means and fck-means: Two Deterministic Initialization Procedures for k-means Algorithm Using a Modified Crowding Distance. SHILAP Revista de lepidopterología. 12(2). 379–399.
4.
Layeb, Abdesslem. (2023). Novel Feature Selection Algorithms Based on Crowding Distance and Pearson Correlation Coefficient. International Journal of Intelligent Systems and Applications. 15(2). 37–42. 3 indexed citations
5.
Layeb, Abdesslem, et al.. (2020). Metaheuristics Guided by the Apriori Principle for Association Rule Mining. SPIRE - Sciences Po Institutional REpository. 10(3). 14–37. 5 indexed citations
6.
Layeb, Abdesslem, et al.. (2018). A GRASP algorithm based new heuristic for the capacitated location routing problem. Journal of Experimental & Theoretical Artificial Intelligence. 30(3). 369–387. 10 indexed citations
7.
Layeb, Abdesslem, et al.. (2015). Quantum inspired cuckoo search algorithm for graph colouring problem. International Journal of Bio-Inspired Computation. 7(3). 183–183. 11 indexed citations
8.
Layeb, Abdesslem, et al.. (2014). A New Quantum Cuckoo Search Algorithm for Multiple Sequence Alignment. Journal of Intelligent Systems. 23(3). 261–275. 9 indexed citations
9.
Layeb, Abdesslem, et al.. (2014). A Binary Cuckoo Search Algorithm for Graph Coloring Problem. RePEc: Research Papers in Economics. 5(3). 42–56. 2 indexed citations
10.
Layeb, Abdesslem, et al.. (2014). A Novel Firefly Algorithm Based Ant Colony Optimization for Solving Combinatorial Optimization Problems.. 11. 19–37. 10 indexed citations
11.
Layeb, Abdesslem, et al.. (2013). A new greedy randomised adaptive search procedure for multiple sequence alignment. International Journal of Bioinformatics Research and Applications. 9(4). 323–323. 6 indexed citations
12.
Layeb, Abdesslem. (2013). A hybrid quantum inspired harmony search algorithm for 0–1 optimization problems. Journal of Computational and Applied Mathematics. 253. 14–25. 74 indexed citations
13.
Layeb, Abdesslem, et al.. (2013). A Multi-objective Binary Cuckoo Search for Bi-criteria Knapsack Problem. International Journal of Information Engineering and Electronic Business. 5(4). 8–15. 3 indexed citations
14.
Layeb, Abdesslem, Meryem Ammi, & Salim Chıkhı. (2013). A GRASP Algorithm Based on New Randomized Heuristic for Vehicle Routing Problem. Journal of Computing and Information Technology. 21(1). 35–35. 8 indexed citations
15.
Layeb, Abdesslem & Djamel Eddine Saïdouni. (2013). A Hybrid Quantum Genetic Algorithm and Local Search based DPLL for Max 3-SAT Problems. Applied Mathematics & Information Sciences. 8(1). 77–87. 1 indexed citations
16.
Layeb, Abdesslem, et al.. (2012). A Novel Quantum Inspired Cuckoo Search Algorithm for Bin Packing Problem. International Journal of Information Technology and Computer Science. 4(5). 58–67. 38 indexed citations
17.
Layeb, Abdesslem. (2011). A novel quantum inspired cuckoo search for knapsack problems. International Journal of Bio-Inspired Computation. 3(5). 297–297. 125 indexed citations
18.
Layeb, Abdesslem. (2010). A Quantum Inspired Particle Swarm Algorithm for Solving the Maximum Satisfiability Problem. Redalyc (Universidad Autónoma del Estado de México). 1(1). 13–23. 1 indexed citations
19.
Layeb, Abdesslem & Djamel Eddine Saïdouni. (2010). A New Quantum Evolutionary Algorithm with Sifting Strategy for Binary Decision Diagram Ordering Problem. International Journal of Cognitive Informatics and Natural Intelligence. 4(4). 47–61. 9 indexed citations
20.
Layeb, Abdesslem & Djamel Eddine Saïdouni. (2007). Quantum Genetic Algorithm for Binary Decision Diagram Ordering Problem. 15 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Belaïd Ahiod Breakdown of academic impact, for papers by Mostafa Mahi Breakdown of academic impact, for papers by Aziz Ouaarab Breakdown of academic impact, for papers by Changshou Deng Breakdown of academic impact, for papers by Ahmed F. Ali Breakdown of academic impact, for papers by Li‐Pei Wong Breakdown of academic impact, for papers by Jongho Nang Breakdown of academic impact, for papers by Mohammed Essaid Riffi Breakdown of academic impact, for papers by Ayad Turky
Rankless by CCL
2026