User profiles for Abdelkader Sbihi
Abdelkader SBIHIProfessor in Technology and Operations and Management Verified email at univ-paris1.fr Cited by 1502 |
Combinatorial optimization and green logistics
The purpose of this paper is to introduce the area of Green Logistics and to describe some
of the problems that arise in this subject which can be formulated as combinatorial …
of the problems that arise in this subject which can be formulated as combinatorial …
Combinatorial optimization and green logistics
The purpose of this paper is to introduce the area of Green Logistics and to describe some
of the problems that arise in this subject which can be formulated as combinatorial …
of the problems that arise in this subject which can be formulated as combinatorial …
The potentials of combining Blockchain technology and Internet of Things for digital reverse supply chain: A case study
Asbestos has been considered as a hazardous waste in France since 1997 and it is neither
recyclable nor recoverable. Hence, its storage and processing have a major impact on both …
recyclable nor recoverable. Hence, its storage and processing have a major impact on both …
A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
A Sbihi - Journal of Combinatorial Optimization, 2007 - Springer
In this paper, we propose an optimal algorithm for the Multiple-choice Multidimensional
Knapsack Problem MMKP. The main principle of the approach is twofold: (i) to generate an initial …
Knapsack Problem MMKP. The main principle of the approach is twofold: (i) to generate an initial …
Heuristic algorithms for the multiple-choice multidimensional knapsack problem
In this paper, we propose several heuristics for approximately solving the multiple-choice
multidimensional knapsack problem (noted MMKP), an NP-Hard combinatorial optimization …
multidimensional knapsack problem (noted MMKP), an NP-Hard combinatorial optimization …
A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
In this paper, we approximately solve the multiple-choice multi-dimensional knapsack
problem. We propose an algorithm which is based upon reactive local search and where an …
problem. We propose an algorithm which is based upon reactive local search and where an …
The relationship between vehicle routing & scheduling and green logistics-A literature survey
The basic Vehicle Routing and Scheduling Problem (VRSP) is described followed by an outline
of solution approaches. Different variations of the basic VRSP are examined that involve …
of solution approaches. Different variations of the basic VRSP are examined that involve …
Logistics 4.0 for supply chain performance: perspectives from a retailing case study
Purpose This study considers the potential of logistics 4.0 for supply chain (SC) optimization
in French retail. The authors investigate the implementation of Industry 4.0 technologies to …
in French retail. The authors investigate the implementation of Industry 4.0 technologies to …
A genetic algorithm for the steel continuous casting with inter-sequence dependent setups and dedicated machines
A Sbihi, M Chemangui - RAIRO-Operations Research-Recherche …, 2018 - numdam.org
The steel continuous casting planning and scheduling problem namely SCC is a particular
hybrid (flexible) flowshop that includes stages:(i) the converters (CV),(ii) the refining stands (…
hybrid (flexible) flowshop that includes stages:(i) the converters (CV),(ii) the refining stands (…
A cooperative local search-based algorithm for the multiple-scenario max–min knapsack problem
A Sbihi - European Journal of Operational Research, 2010 - Elsevier
The purpose of this article is to present a novel method to approximately solve the Multiple-Scenario
Max–Min Knapsack Problem (MSM 2 KP). This problem models many real world …
Max–Min Knapsack Problem (MSM 2 KP). This problem models many real world …