Abdelkader Sbihi

19 papers C 2Journal 13Unranked 2
YearRankTypeTitle / Venue / Authors
2024 J jnl
An improved genetic algorithm for the berth scheduling with ship-to-ship transshipment operations integrated model.
Comput. Oper. Res.
Marwa Al Samrout, Abdelkader Sbihi, Adnan Yassine
2024 — conf
Solving an Integrated Bi-objective Container Terminal Integrated Planning with Transshipment Operations.
MIC (2)
Marwa Al Samrout, Abdelkader Sbihi, Adnan Yassine
2023 J jnl
Logistics 4.0 for supply chain performance: perspectives from a retailing case study.
Bus. Process. Manag. J.
Mustapha Hrouga, Abdelkader Sbihi
2021 J jnl
The operating behaviour of unbalanced, unpaced merging assembly lines.
RAIRO Oper. Res.
Tom McNamara, Sabry Shaaban, Abdelkader Sbihi, Zouhair Laarraf
2019 J jnl
Efficient algorithms under dynamic graphs to solve the Capacitated Arc Routing Problem with feasible sparse graph.
RAIRO Oper. Res.
Sara Tfaili, Hamdi Dkhil, Abdelkader Sbihi, Adnan Yassine
2018 — ed.
4th International Conference on Logistics Operations Management, GOL 2018, Le Havre, France, April 10-12, 2018
GOL
Jaouad Boukachour, Abdelkader Sbihi, Ahmed El Hilali Alaoui, Youssef Benadada
2018 J jnl
A genetic algorithm for the steel continuous casting with inter-sequence dependent setups and dedicated machines.
RAIRO Oper. Res.
Abdelkader Sbihi, Makram Chemangui
2018 — conf
An Efficient Algorithm Based Tabu Search for the Robust Sparse CARP Under Travel Costs Uncertainty.
ICORES (Selected Papers)
Sara Tfaili, Abdelkader Sbihi, Adnan Yassine, Ibrahima Diarrassouba
2018 C conf
Capacitated Arc Routing Problem over Sparse Underlying Graph under Travel Costs Uncertainty.
ICORES
Sara Tfaili, Abdelkader Sbihi, Adnan Yassine, Ibrahima Diarrassouba
2018 C conf
On Some Smart Hybridized Heuristics and Local Search Programming.
ICORES
Abdelkader Sbihi
2013 J jnl
Adaptive perturbed neighbourhood search for the expanding capacity multiple-choice knapsack problem.
J. Oper. Res. Soc.
Abdelkader Sbihi
2010 J jnl
A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem.
Eur. J. Oper. Res.
Abdelkader Sbihi
2010 J jnl
Combinatorial optimization and Green Logistics.
Ann. Oper. Res.
Abdelkader Sbihi, Richard W. Eglese
2007 J jnl
A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem.
J. Comb. Optim.
Abdelkader Sbihi
2007 J jnl
Combinatorial optimization and Green Logistics.
4OR
Abdelkader Sbihi, Richard W. Eglese
2006 J jnl
A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem.
Comput. Optim. Appl.
Mhand Hifi, M. Michrafy, Abdelkader Sbihi
2004 J jnl
Heuristic algorithms for the multiple-choice multidimensional knapsack problem.
J. Oper. Res. Soc.
Mhand Hifi, M. Michrafy, Abdelkader Sbihi
2003 — —
Les Méthodes Hybrides en Optimisation Combinatoire :Algorithmes Exacts et Heuristiques. (The Hybrid Methods in Combinatorial Optimization: Exact Algorithms and Heuristics).
Abdelkader Sbihi
2002 J jnl
An Efficient Algorithm for the Knapsack Sharing Problem.
Comput. Optim. Appl.
Mhand Hifi, Slim Sadfi, Abdelkader Sbihi