Abdelkader Sbihi

ORCID

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 9

Top Venues

RAIRO Oper. Res.

ICORES

Comput. Oper. Res.

ICORES (Selected Papers)

Pantheon-Sorbonne University, Paris, France (PHD)

Education History

Pantheon-Sorbonne University, Paris, France

PHD

Publications

Marwa Al Samrout, Abdelkader Sbihi, Adnan Yassine
An improved genetic algorithm for the berth scheduling with ship-to-ship transshipment operations integrated model. Comput. Oper. Res. 161 (2024)
Marwa Al Samrout, Abdelkader Sbihi, Adnan Yassine
Solving an Integrated Bi-objective Container Terminal Integrated Planning with Transshipment Operations. MIC (2) (2024)
Mustapha Hrouga, Abdelkader Sbihi
Logistics 4.0 for supply chain performance: perspectives from a retailing case study. Bus. Process. Manag. J. 29 (6) (2023)
Tom McNamara, Sabry Shaaban, Abdelkader Sbihi, Zouhair Laarraf
The operating behaviour of unbalanced, unpaced merging assembly lines. RAIRO Oper. Res. 55 (1) (2021)
Sara Tfaili, Hamdi Dkhil, Abdelkader Sbihi, Adnan Yassine
Efficient algorithms under dynamic graphs to solve the Capacitated Arc Routing Problem with feasible sparse graph. RAIRO Oper. Res. 53 (1) (2019)
Sara Tfaili, Abdelkader Sbihi, Adnan Yassine, Ibrahima Diarrassouba
Capacitated Arc Routing Problem over Sparse Underlying Graph under Travel Costs Uncertainty. ICORES (2018)
Sara Tfaili, Abdelkader Sbihi, Adnan Yassine, Ibrahima Diarrassouba
An Efficient Algorithm Based Tabu Search for the Robust Sparse CARP Under Travel Costs Uncertainty. ICORES (Selected Papers) (2018)
Abdelkader Sbihi
On Some Smart Hybridized Heuristics and Local Search Programming. ICORES (2018)
Abdelkader Sbihi, Makram Chemangui
A genetic algorithm for the steel continuous casting with inter-sequence dependent setups and dedicated machines. RAIRO Oper. Res. 52 (4) (2018)
Abdelkader Sbihi
Adaptive perturbed neighbourhood search for the expanding capacity multiple-choice knapsack problem. J. Oper. Res. Soc. 64 (10) (2013)
Abdelkader Sbihi
A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem. Eur. J. Oper. Res. 202 (2) (2010)
Abdelkader Sbihi, Richard W. Eglese
Combinatorial optimization and Green Logistics. Ann. Oper. Res. 175 (1) (2010)
Abdelkader Sbihi
A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem. J. Comb. Optim. 13 (4) (2007)
Abdelkader Sbihi, Richard W. Eglese
Combinatorial optimization and Green Logistics. 4OR 5 (2) (2007)
Mhand Hifi, M. Michrafy, Abdelkader Sbihi
A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem. Comput. Optim. Appl. 33 (2-3) (2006)
Mhand Hifi, M. Michrafy, Abdelkader Sbihi
Heuristic algorithms for the multiple-choice multidimensional knapsack problem. J. Oper. Res. Soc. 55 (12) (2004)
Mhand Hifi, Slim Sadfi, Abdelkader Sbihi
An Efficient Algorithm for the Knapsack Sharing Problem. Comput. Optim. Appl. 23 (1) (2002)

Abdelkader Sbihi.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Abdelkader Sbihi