Yacine Laalaoui
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yacine Laalaoui has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Hedi Mhalla
College of Engineering and Technology , American University of the Middle East , Kuwait
2 shared publications - Badlishah Ahmad
Universiti Malaysia Perlis
1 shared publication - Benyettou Mohamed
Computer science Department, USTOMB, Oran, Algeria
1 shared publication - Habiba Drias
USTHB, LRIA
1 shared publication - Hedi Mhalla
The American University of the Middle East
1 shared publication - Jehad Al-Omari
Taif University
1 shared publication
Latest Publications
- 18 December 2024
- Published by Springer Nature in Operations Research Forum
- Vol. 6 (1) , 1-22
Knapsack-Sharing Model for Hybrid Hosting of Enterprise Resource Planning Software on IaaS Clouds
- 18 December 2024
- Published by Springer Nature in Operations Research Forum
- Vol. 6 (1) , 1-22
Knapsack-Sharing Model for Hybrid Hosting of Enterprise Resource Planning Software on IaaS Clouds
- Open Access
- 21 November 2024
- Published by Springer Nature in Annals of Operations Research
- Vol. 351 (1) , 303-332
Enhancing the best-first-search F with incremental search and restarts for large-scale single machine scheduling with release dates and deadlines
This paper presents a new heuristic search $$\hbox {F}_{IR}$$ that determines the feasibility of scheduling a set of jobs on a single machine where each job is characterized by its release date, processing time, and deadline. $$\hbox {F}_{IR}$$ uses incremental search and restart strategies to scale the best-first-search heuristic F (Laalaoui and M’Hallah, in: IEEE symposium on evolutionary scheduling and combinatorial optimisation (SSCI) 2022, IEEE, Singapore, 2022). Experimental results provide computational evidence of the superiority of $$\hbox {F}_{IR}$$ for large-scale instances. In fact, $$\hbox {F}_{IR}$$ outperforms the IBM ILOG CP constraint programming solver, the CPLEX mixed integer programming solver, and existing heuristics. It finds feasible solutions for many instances with 100,000 jobs in less than one minute.- 21 November 2024
- Published by Springer Nature in Annals of Operations Research
- Vol. 351 (1) , 303-332
Open AccessEnhancing the best-first-search F with incremental search and restarts for large-scale single machine scheduling with release dates and deadlines
This paper presents a new heuristic search $$\hbox {F}_{IR}$$ that determines the feasibility of scheduling a set of jobs on a single machine where each job is characterized by its release date, processing time, and deadline. $$\hbox {F}_{IR}$$ uses incremental search and restart strategies to scale the best-first-search heuristic F (Laalaoui and M’Hallah, in: IEEE symposium on evolutionary scheduling and combinatorial optimisation (SSCI) 2022, IEEE, Singapore, 2022). Experimental results provide computational evidence of the superiority of $$\hbox {F}_{IR}$$ for large-scale instances. In fact, $$\hbox {F}_{IR}$$ outperforms the IBM ILOG CP constraint programming solver, the CPLEX mixed integer programming solver, and existing heuristics. It finds feasible solutions for many instances with 100,000 jobs in less than one minute. - 9 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Exact Parallel Algorithm for the Knapsack Sharing Problem
In the last two decades we observed a considerably improvement in algorithms' performances and their ability to solve hard combinatorial optimization problems. One of these problems is the knapsack sharing problem (KSP). The latter problem is a challenging variant of the well-known NP-hard single knapsack problem. In fact, we can find in the literature several exact and heuristic resolution approaches to solve the (KSP). We mainly propose here an improvement and an adaptation to parallel computing of one of the existing and most recent algorithm in the literature. The approach is a constructive tree search that runs in two phases: the initial solution construction phase and the second phase where we build the optimal solution through a customized branch and bound. We applied a parallel computing on this second phase in order to improve the overall computational time. Finally we present a comparative study on instances from literature to show the positive effect of parallel processing on the computing time.
- 9 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Exact Parallel Algorithm for the Knapsack Sharing Problem
In the last two decades we observed a considerably improvement in algorithms' performances and their ability to solve hard combinatorial optimization problems. One of these problems is the knapsack sharing problem (KSP). The latter problem is a challenging variant of the well-known NP-hard single knapsack problem. In fact, we can find in the literature several exact and heuristic resolution approaches to solve the (KSP). We mainly propose here an improvement and an adaptation to parallel computing of one of the existing and most recent algorithm in the literature. The approach is a constructive tree search that runs in two phases: the initial solution construction phase and the second phase where we build the optimal solution through a customized branch and bound. We applied a parallel computing on this second phase in order to improve the overall computational time. Finally we present a comparative study on instances from literature to show the positive effect of parallel processing on the computing time.
- 2 February 2019
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 78 (13) , 18813-18833
Bayesian frameworks for traffic scenes monitoring via view-based 3D cars models recognition
- 2 February 2019
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 78 (13) , 18813-18833
Bayesian frameworks for traffic scenes monitoring via view-based 3D cars models recognition
- 13 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. PP (3) , 1
A Planning Approach for Reassigning Virtual Machines in IaaS Clouds
Reassignment of virtual machines into clusters is an important task for the good management of cloud resources since it decisively affects the performance of the Service Provider platform. Thus, for a successful reassignment, a clear and careful reassignment plan should be constructed in advance. In this paper, we propose a planning approach to the problem of reassigning virtual machines in IaaS Cloud platforms and we prove that this problem is NP-Hard. First, we use the well-known A* algorithm to solve this planning problem. Then, we propose two algorithms, called Direct Move Heuristic (DMH) and Iterative Direct Move Heuristic (IDMH), to bridge the space limitation of the A* algorithm. Also, we suggest two experimental studies that have been conducted on randomly generated problem instances. The first experimental study considers small sized problem instances. It aims to show the applicability of the described modeling and assesses the efficiency of the proposed algorithms. The second experimental study focuses on large sized problem instances. It assesses the scalability performance of the IDMH heuristic. Our obtained results show a good scalability performance on problem instances with up to 800 virtual machines.
- 13 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. PP (3) , 1
A Planning Approach for Reassigning Virtual Machines in IaaS Clouds
Reassignment of virtual machines into clusters is an important task for the good management of cloud resources since it decisively affects the performance of the Service Provider platform. Thus, for a successful reassignment, a clear and careful reassignment plan should be constructed in advance. In this paper, we propose a planning approach to the problem of reassigning virtual machines in IaaS Cloud platforms and we prove that this problem is NP-Hard. First, we use the well-known A* algorithm to solve this planning problem. Then, we propose two algorithms, called Direct Move Heuristic (DMH) and Iterative Direct Move Heuristic (IDMH), to bridge the space limitation of the A* algorithm. Also, we suggest two experimental studies that have been conducted on randomly generated problem instances. The first experimental study considers small sized problem instances. It aims to show the applicability of the described modeling and assesses the efficiency of the proposed algorithms. The second experimental study focuses on large sized problem instances. It assesses the scalability performance of the IDMH heuristic. Our obtained results show a good scalability performance on problem instances with up to 800 virtual machines.
- 5 July 2015
- Published by Springer Nature
- p. 51-67
Hosting Clients in Clustered and Virtualized Environment: A Combinatorial Optimization Approach
- 5 July 2015
- Published by Springer Nature
- p. 51-67
Hosting Clients in Clustered and Virtualized Environment: A Combinatorial Optimization Approach
- Open Access
- 26 January 2015
- Published by Science Publishing Group in International Journal of Intelligent Information Systems
- Vol. 4 (2) , 35-39
Local Search Heuristic for Multiple Knapsack Problem
In this paper we will present a heuristic method to solve the Multiple Knapsack Problem. The proposed method is an improvement of the IRT heuristic described in [2].the experimental study shows that our improvement leads some gain in time and solution quality against IRT, MTHM, Mulknap and ILOG CPLEX.
- 26 January 2015
- Published by Science Publishing Group in International Journal of Intelligent Information Systems
- Vol. 4 (2) , 35-39
Open AccessLocal Search Heuristic for Multiple Knapsack Problem
In this paper we will present a heuristic method to solve the Multiple Knapsack Problem. The proposed method is an improvement of the IRT heuristic described in [2].the experimental study shows that our improvement leads some gain in time and solution quality against IRT, MTHM, Mulknap and ILOG CPLEX.
- 1 January 2013
- Published by Springer Nature
- p. 571-599
Decision Incorporation in Meta-heuristics to Cope with Decision Scheduling Problems
- 1 January 2013
- Published by Springer Nature
- p. 571-599
Decision Incorporation in Meta-heuristics to Cope with Decision Scheduling Problems
- 9 March 2010
- Published by Springer Nature in Soft Computing
- Vol. 15 (6) , 1071-1086
Learning and backtracking in non-preemptive scheduling of tasks under timing constraints
- 9 March 2010
- Published by Springer Nature in Soft Computing
- Vol. 15 (6) , 1071-1086
Learning and backtracking in non-preemptive scheduling of tasks under timing constraints