Farouq Zitouni

Verified

Farouq verified their affiliation via an institutional email.

Learn more

Verified

Farouq verified their affiliation via an institutional email.

Learn more

• Doctor of Psychology
• Associate Professor at University of Ouargla

Chaos theory, with its unique blend of randomness and ergodicity, has become a powerful tool for enhancing metaheuristic algorithms. In recent years, there has been a growing number of chaos-enhanced metaheuristic algorithms (CMAs), accompanied by a notable scarcity of studies that analyze and organize this field. To respond to this challenge, this...

This study conducts a comparative analysis of the performance of ten novel and well-performing metaheuristic algorithms for parameter estimation of solar photovoltaic models. This optimization problem involves accurately identifying parameters that reflect the complex and nonlinear behaviours of photovoltaic cells affected by changing environmental...

Hybridizing metaheuristic algorithms involves synergistically combining different optimization techniques to effectively address complex and challenging optimization problems. This approach aims to leverage the strengths of multiple algorithms, enhancing solution quality, convergence speed, and robustness, thereby offering a more versatile and effi...

The feature selection problem involves selecting a subset of relevant features to enhance the performance of machine learning models, crucial for achieving model accuracy. Its complexity arises from the vast search space, necessitating the application of metaheuristic methods to efficiently identify optimal feature subsets. In this work, we employe...

Presents corrections to the paper, An Opposition-Based Great Wall Construction Metaheuristic Algorithm With Gaussian Mutation for Feature Selection.

In this paper, we propose a novel methodology that combines the opposition Nelder–Mead algorithm and the selection phase of the genetic algorithm. This integration aims to enhance the performance of the overall algorithm. To evaluate the effectiveness of our methodology, we conducted a comprehensive comparative study involving 11 state-of-the-art a...

Global optimization solves real-world problems numerically or analytically by minimizing their objective functions. Most of the analytical algorithms are greedy and computationally intractable (Gonzalez in Handbook of approximation algorithms and metaheuristics: contemporary and emerging applications, vol. 2. CRC Press, Boca Raton, 2018). Metaheuri...

A novel nature-inspired metaheuristic optimization algorithm, called the quantum firefly algorithm, is proposed in this paper. The algorithm imitates (a) the social behaviour of fireflies mating in nature, (b) laws of quantum physics, and (c) laws of natural evolution. The algorithm combines the powers of two well-known algorithms: the firefly algo...

Nowadays, the multi-robot task allocation problem is one of the most challenging problems in multi-robot systems. It concerns the optimal assignment of a set of tasks to several robots while optimizing a given criterion subject to some constraints. This problem is very complex, particularly when handling large groups of robots and tasks. We propose...

Global optimization solves real-world problems numerically or analytically by minimizing their objective functions. Most of the analytical algorithms are greedy and computationally intractable. Metaheuristics are nature-inspired optimization algorithms. They numerically find a near-optimal solution for optimization problems in a reasonable amount o...

A novel metaheuristic algorithm for global optimization, called the Solar System Algorithm (SSA), is presented. The proposed algorithm imitates the orbiting behavior of some objects found in the solar system: i.e., Sun, planets, moons, stars, and black holes. SSA is used to solve five well-known engineering design problems: three-bar truss, pressur...

We propose a distributed approach to solve the multi-robot task allocation problem. This problem consists of two distinct sets: robots and tasks. The objective is to assign tasks to robots while optimizing a given criterion. This problem is known to be NP-hard even with small numbers of robots and tasks. The field of survivors’ search and rescue is...

The multi-robot task allocation problem consists of two distinct sets: a set of tasks (requiring resources) and a set of robots (offering resources); then tasks are allocated to robots; while optimizing a certain objective function, subject to some constraints: e.g. allocate the maximum number of tasks, minimize the distances travelled by robots, e...

The problem of task allocation in a multi-robot system is the situation where we have a set of tasks and a number of robots; then each task is assigned to the appropriate robots with the aim of optimizing some criteria subject to constraints, e.g., allocate the maximum number of tasks. We propose an effective solution to address this problem. It im...

The Multi-Robot Task Allocation problem is the situation where some tasks and robots are given, then assignments between them must be found in order to optimize a certain measure (e.g. allocate the maximum number of tasks, etc.). We propose a generic framework to address heavily constrained MRTA problems. Some objective functions are proposed and e...

The Multi-Robot Task Allocation problem (MRTA) is the situation where we have a set of tasks and robots; then we must decide the assignments between robots and tasks in order to optimize a certain measure (e.g. allocate the maximum number of tasks...). We present an effective solution to resolve this problem by implementing a two-stage methodology:...

In this paper, we will present a working methodology for solving the task allocation problem in a multi-robot system, i.e. assign the tasks being performed to appropriate robots. In fact, the proposed approach combines the advantages of several well-known algorithms (e.g. quantum genetic algorithms, Q-learning machine-learning, etc.), in order to c...

Today, the dynamic allocation of tasks among autonomous robots is increasingly a complex process, due to multiple constraints and limitations. In fact, it allows us to assign optimally a given task to a group of robots. In this context, no central control is usually authorized to perform a given task, and any robot in the system can discover and id...