Abdelkader Sbihi

665 total citations
19 papers, 426 citations indexed

About

Abdelkader Sbihi is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Strategy and Management. According to data from OpenAlex, Abdelkader Sbihi has authored 19 papers receiving a total of 426 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Industrial and Manufacturing Engineering, 4 papers in Computer Networks and Communications and 4 papers in Strategy and Management. Recurrent topics in Abdelkader Sbihi's work include Optimization and Packing Problems (10 papers), Advanced Manufacturing and Logistics Optimization (9 papers) and Vehicle Routing Optimization Methods (6 papers). Abdelkader Sbihi is often cited by papers focused on Optimization and Packing Problems (10 papers), Advanced Manufacturing and Logistics Optimization (9 papers) and Vehicle Routing Optimization Methods (6 papers). Abdelkader Sbihi collaborates with scholars based in France, Norway and Morocco. Abdelkader Sbihi's co-authors include Mhand Hifi, Jacques Teghem, Adnan Yassine, Mhand Hifi, Thierry Sauvage, Néjib Hachicha, Jaouad Boukachour and Amine Ben Amar and has published in prestigious journals such as Journal of Cleaner Production, European Journal of Operational Research and Journal of the Operational Research Society.

In The Last Decade

Abdelkader Sbihi

17 papers receiving 402 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Abdelkader Sbihi France 11 258 154 67 61 56 19 426
Pavol Tanuška Slovakia 12 122 0.5× 103 0.7× 80 1.2× 12 0.2× 53 0.9× 59 358
Manish Shukla India 11 93 0.4× 35 0.2× 63 0.9× 108 1.8× 52 0.9× 33 353
Zhang Ji China 6 63 0.2× 116 0.8× 236 3.5× 28 0.5× 140 2.5× 13 380
Kevin Assogba United States 8 316 1.2× 25 0.2× 24 0.4× 94 1.5× 18 0.3× 15 450
Yee Ming Chen Taiwan 11 58 0.2× 63 0.4× 55 0.8× 51 0.8× 30 0.5× 35 324
Martijn Koot Netherlands 4 57 0.2× 85 0.6× 29 0.4× 61 1.0× 97 1.7× 5 363
Gülesin Sena Daş Türkiye 11 177 0.7× 25 0.2× 50 0.7× 32 0.5× 24 0.4× 23 347
H.K.H. Chow Hong Kong 6 245 0.9× 30 0.2× 18 0.3× 50 0.8× 46 0.8× 6 410
Behdin Vahedi-Nouri Iran 17 526 2.0× 43 0.3× 53 0.8× 68 1.1× 16 0.3× 32 675
Sanne Wøhlk Denmark 14 329 1.3× 52 0.3× 33 0.5× 44 0.7× 6 0.1× 30 462

Countries citing papers authored by Abdelkader Sbihi

Since Specialization
Citations

This map shows the geographic impact of Abdelkader Sbihi'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 Abdelkader Sbihi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Abdelkader Sbihi more than expected).

Fields of papers citing papers by Abdelkader Sbihi

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Abdelkader Sbihi. 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 Abdelkader Sbihi. The network helps show where Abdelkader Sbihi may publish in the future.

Co-authorship network of co-authors of Abdelkader Sbihi

This figure shows the co-authorship network connecting the top 25 collaborators of Abdelkader Sbihi. A scholar is included among the top collaborators of Abdelkader Sbihi 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 Abdelkader Sbihi. Abdelkader Sbihi is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

19 of 19 papers shown
2.
Sbihi, Abdelkader, et al.. (2023). An improved genetic algorithm for the berth scheduling with ship-to-ship transshipment operations integrated model. Computers & Operations Research. 161. 106409–106409. 13 indexed citations
3.
Sbihi, Abdelkader, et al.. (2023). Logistics 4.0 for supply chain performance: perspectives from a retailing case study. Business Process Management Journal. 29(6). 1892–1919. 12 indexed citations
4.
Sbihi, Abdelkader, et al.. (2022). Multi-product capacitated disassembly lot-sizing problem with lost sales and possibility of defective disassembly components. IFAC-PapersOnLine. 55(10). 520–525. 1 indexed citations
5.
Sbihi, Abdelkader, et al.. (2022). The potentials of combining Blockchain technology and Internet of Things for digital reverse supply chain: A case study. Journal of Cleaner Production. 337. 130609–130609. 92 indexed citations
6.
7.
Sbihi, Abdelkader, et al.. (2018). Efficient algorithms under dynamic graphs to solve the Capacitated Arc Routing Problem with feasible sparse graph. RAIRO - Operations Research. 53(1). 303–322.
8.
Sbihi, Abdelkader, et al.. (2018). A genetic algorithm for the steel continuous casting with inter-sequence dependent setups and dedicated machines. RAIRO - Operations Research. 52(4-5). 1351–1376. 13 indexed citations
9.
Sbihi, Abdelkader, et al.. (2018). Capacitated Arc Routing Problem over Sparse Underlying Graph under Travel Costs Uncertainty. 144–151. 2 indexed citations
10.
Sauvage, Thierry, et al.. (2017). An exploratory model for outsourcing-purchasing activities based on a comparative study. Supply Chain Forum an International Journal. 18(3). 138–149. 3 indexed citations
11.
Sbihi, Abdelkader, et al.. (2014). Energy efficiency in production process: A case of footwear trade development. 1 indexed citations
12.
Sbihi, Abdelkader, et al.. (2014). Solving a mixed integer linear program with times setup for the steel-continuous casting planning and scheduling problem. International Journal of Production Research. 52(24). 7276–7296. 22 indexed citations
13.
Sbihi, Abdelkader. (2012). Adaptive perturbed neighbourhood search for the expanding capacity multiple-choice knapsack problem. Journal of the Operational Research Society. 64(10). 1461–1473. 7 indexed citations
14.
Sbihi, Abdelkader. (2009). A cooperative local search-based algorithm for the Multiple-Scenario Max–Min Knapsack Problem. European Journal of Operational Research. 202(2). 339–346. 21 indexed citations
15.
Sbihi, Abdelkader. (2006). A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem. Journal of Combinatorial Optimization. 13(4). 337–351. 57 indexed citations
16.
Sbihi, Abdelkader, et al.. (2005). A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem. Computational Optimization and Applications. 33(2-3). 271–285. 63 indexed citations
17.
Hifi, Mhand, et al.. (2004). An Exact Algorithm for the Multiple-choice Multidimensional Knapsack Problem. RePEc: Research Papers in Economics. 10 indexed citations
18.
Hifi, Mhand, et al.. (2004). Heuristic algorithms for the multiple-choice multidimensional knapsack problem. Journal of the Operational Research Society. 55(12). 1323–1332. 96 indexed citations
19.
Hifi, Mhand, et al.. (2002). An Efficient Algorithm for the Knapsack Sharing Problem. Computational Optimization and Applications. 23(1). 27–45. 12 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

Rankless by CCL
2026