@univ-sfax.tn
Higher Institute of Industrial Management
University of Sfax, TUNISIA
Dhouib-Matrix Optimization Methods Inventor (DM-SPP, DM-MSTP, DM-AP1, DM-TSP1, DM-TP1, DM3, DM4, etc ...)
Artificial Intelligence Developer,
Operations Research Analyst,
Data Scientist,
ISO9001 and ISO27001 Certified
Scope Database Advisory Board,
Editorial board for several international journals
Bachelor degree in Management Information Systems
Master degree in Operations Research and Production Management
Ph.D. degree in Quantitative Methods
Artificial Intelligence, Decision Sciences, Modeling and Simulation, Computational Theory and Mathematics
Scopus Publications
Scholar Citations
Scholar h-index
Scholar i10-index
Souhail Dhouib, Aïda Kharrat, Taicir Loukil, and Habib Chabchoub
Elsevier BV
Souhail Dhouib
Elsevier BV
Souhail Dhouib
IOS Press
Planning the shortest path for a mobile robot is a hard task. It consists in quickly finding the shortest distance from the starting to the target positions with obstacles collision-free. The performance of the robot mobile will be increased if the optimal shortest path is rapidly planned. Therefore, in this paper the novel optimal method entitled Dhouib-Matrix-SPP (DM-SPP) is enhanced for this problem with four movement directions (namely DM-SPP-4) for an environment represented as a grid map with fixed obstacles. The simulation results on several 41x41 grid maps and the comparison of DM-SPP-4 to different methods (Basic Dijkstra, Modified Dijkstra, Basic A*, Modified A*, Best First Search Algorithm, Breadth First Search, Depth First Search algorithms) show that DM-SPP-4 can realize the path planning more rapidly and accuracy.
Souhail Dhouib
Elsevier BV
S. Dhouib
International Digital Organization for Scientific Information (IDOSI)
Souhail Dhouib
Elsevier BV
Souhail Dhouib
Elsevier BV
Souhail Dhouib and Alaeddine Zouari
Elsevier BV
Souhail Dhouib and Tole Sutikno
Institute of Advanced Engineering and Science
The assignment problem is a famous problem in combinatorial optimization where several objects (tasks) are assigned to different entities (workers) with the goal of minimizing the total assignment cost. In real life, this problem often arises in many practical applications with uncertain data. Hence, this data (the assignment cost) is usually presented as fuzzy numbers. In this paper, the assignment problem is considered with trapezoidal fuzzy parameters and solved using the novel Dhouib-Matrix-AP1 (DM-AP1) heuristic. In fact, this research work presents the first application of the DM-AP1 heuristic to the fuzzy assignment problem, and a step-by-step application of DM-AP1 is detailed for more clarity. DM-AP1 is composed of three simple steps and repeated only once in n iterations. Moreover, DM-AP1 is enhanced with two techniques: a ranking function to order the trapezoidal fuzzy numbers and the min descriptive statistical metric to navigate through the research space. DM-AP1 is developed under the Python programming language and generates a convivial assignment network diagram plan.
Souhail Dhouib and Danijela Pezer
IBERAMIA: Sociedad Iberoamericana de Inteligencia Artificial
The Computer Numerical Control (CNC) machine represents a turning point in today's production which has high requirements for product accuracy. The CNC machine enables a high flexibility in work and time saving and also reduces the time required for product accuracy control. Moreover, the CNC machine are used for several activities, most often for turning, drilling and milling operations. Usually, the productivity of any CNC machine can be increased thanks to the minimization of the non-productive of tool movement. In this paper, the results of a new metaheuristic named Dhouib-Matrix-4 (DM4) with an application on the NP-hard problem based on the Travelling Salesman Problem are presented. DM4 is used for increasing the performance of the CNC Machine by optimizing a tool path length in the drilling process performed on the CNC milling machine. The proposed algorithm (DM4) achieves a solution closed to the optimum, compared with the results obtained with the Ant Colony Optimization algorithm and the results found with the manual programming in G code by using a control unit for the selected CNC milling machine.
Souhail Dhouib
Elsevier BV
Souhail Dhouib and Alaeddine Zouari
Inderscience Publishers
Souhail Dhouib
National Library of Serbia
The Assignment Problem (AP) can be stated as n activities to be assigned to n resources in such a way that the overall cost of assignment is minimized and each activity is assigned to one and only one resource. In real-life, the parameters of the AP are presented as uncertain numbers due to the lack of knowledge, experiences or any other (internal or external) factor. In this paper, the AP is considered under intuitionistic triangular fuzzy number and solved by the novel constructive heuristic Dhouib-Matrix-AP1 (DM-AP1) with a time complexity of O(n). Actually, this paper presents the first enhancement of the novel heuristic DM-AP1 to solve the AP under intuitionistic triangular fuzzy environment. DM-AP1 is composed of three simple steps: computing the total cost, selecting the highest value and finding the minimal element. These steps are repeated in n iterations with the use of a standard deviation statistical metric. Two case studies of AP under intuitionistic triangular fuzzy set are taken from the literature and a step-by-step application of the novel DM-AP1 heuristic is presented for more clarification.
Souhail Dhouib, Taicir Loukil, Manel Kammoun, and Saima Dhouib
IEEE
This paper, deals with the fuzzy transportation problem involving heptagonal fuzzy numbers. The novel heuristic Dhouib-Matrix-TP1 (DM-TPI) is used to solve the balanced and unbalanced problem. This method is adapted in order to generate a good initial basic feasible solution using the original metric (Average-Min). Several numerical examples are solved to illustrate the proposed algorithm and the solution are compared with those solutions obtained by using the Vogel Approximation Method (VAM) and the MOdified Distribution Method (MODI) for balanced numerical example and Russel’s Method, North West Corner Method and Least Cost Method for Unbalanced fuzzy numbers.
Souhail Dhouib, Alaeddine Zouari, Saima Dhouib, and Habib Chabchoub
Informa UK Limited
Souhail Dhouib
IOS Press
The process of drilling holes in Printed Circuit Board presents a crucial issue and finding the shortest drilling path allows to minimize the movement of a robot arm in order to increase the productivity of the Computer Numerically Controlled Machine. In this paper, the novel metaheuristic Dhouib-Matrix-4 (DM4) is applied to find the shortest drilling tool path. DM4 is based on the combination of the novel constructive technique Dhouib-Matrix-TSP1 (DM-TSP1) and the original local search method Far-to-Near (FtN). Moreover, DM4 uses several differential statistical metrics in order to explore different regions in the domain space thanks to DM-TSP1 and exploits a specific region via FtN. The performance of the DM4 technique is evaluated against the Cuckoo Search, the Genetic Algorithm and the hybrid Cuckoo Search-Genetic Algorithm in finding the shortest drilling path for three standard problems.
Souhail Dhouib
International Journal of Intelligent Systems and Applications in Engineering
Souhail Dhouib
IGI Global
The transportation problem is a one of the principal topics in operational research where goods are initially stored at different sources and need to be livered to destination in such a way the total transportation cost is minimum. In this paper, we consider the transportation problem in a trapezoidal fuzzy environment and we introduce the column-row heuristic Dhouib-Matrix-TP1 to solve it in just p iterations (where p is the maximal number between the total number of sources and destinations). The Dhouib-Matrix-TP1 heuristic is enhanced with the robust ranking function and with a new operation for selection based on mean and min metrics. To justify the proposed method, several numerical experiments are given to show the effectiveness of the new technique in solving the trapezoidal fuzzy transportation problems.
Souhail Dhouib
Hindawi Limited
This paper presents a new metaheuristic named Dhouib-Matrix-3 (DM3) inspired by our recently developed constructive stochastic heuristic Dhouib-Matrix-TSP2 (DM-TSP2) and characterized by only one parameter: the number of iterations. The proposed metaheuristic DM3 is an iterative algorithm in which every iteration is based on two relay hybridization techniques. At first, the constructive stochastic heuristic DM-TSP2 starts by generating a different initial basic feasible solution and then each solution is intensified by the novel procedure Far-to-Near which exchanges far cities by closer ones using three perturbation techniques: insertion, exchange, and 2-opt. Experimental results carried out on the classical travelling salesman problem using the well-known TSP-LIB benchmark instances demonstrate that our approach DM3 outclasses the simulated annealing algorithm, the genetic algorithm, and the cellular genetic algorithm. Furthermore, the proposed DM3 is statistically concurrent to the hybrid simulated annealing cellular genetic algorithm. Nevertheless, DM3 is easier to implement and needs only one parameter to identify (the maximum number of iterations).
Souhail Dhouib
Hindawi Limited
The transportation problem has been widely studied in the field of supply chain management where circulation of products with a minimal transportation cost is an important issue. This paper presents the first adaptation of the Dhouib-Matrix-TP1 heuristic to solve the transportation problem in single-valued trapezoidal neutrosophic environment. Hence, the recently developed Dhouib-Matrix-TP1 heuristic is enriched with two functions to solve the neutrosophic transportation problem. On the one hand, a defuzzification function is exploited in order to convert the single-valued trapezoidal neutrosophic numbers to crisp numbers. On the other hand, an original metric function (Average-Min) is proposed with the intention of performing the nodes selection process. With an illustration from a literature example, we show to the decision maker the multiple advantages of the novel heuristic Dhouib-Matrix-TP1 which can be easily implemented in real-life industrial transportation under neutrosophic environment.
Mariem Miledi and Souhail Dhouib
IGI Global
Image segmentation is a very crucial step in medical image analysis which is the first and the most important task in many clinical interventions. The authors propose in this paper to apply the variable neighborhood search (VNS) metaheuristic on the problem of brain magnetic resonance images (MRI) segmentation. In fact, by reviewing the literature, they notice that when the number of classes increases the computational time of the exhaustive methods grows exponentially with the number of required classes. That's why they exploit the VNS algorithm to optimize two maximizing thresholding functions which are the between-class variance (the Otsu's function) and the entropy thresholding (the Kapur's function). Thus, two versions of the VNS metaheuristic are respectively obtained: the VNS-Otsu and the VNS-Kapur. These two novel proposed thresholding methods are tested on a set of benchmark brain MRI to show their robustness and proficiency.
Experience in consulting for business organizations and industries
Over than twenty years real-world industrial experiences in designing and developing business management software at different sectors ranging from Manufacturing, Electronic to Clothing Etc
Ancient Vice President at TORS (Tunisian Operations Research Society)
Ancient Financial Director at ATID (Tunisian Association of Engineering Decision)
Ancient member of the national Tunisian sector committee in management sciences
Practical experience in managing company as General Manager
ISMS (ISO 27001: Information Security Management System) certified lead auditor from TÜV Rheinland Group.
QMS (ISO 9001: Quality Management System) certified lead auditor from TÜV Rheinland Group.
Founder of two companies specialized in the field of development of business software
Founder member of ATID (Tunisian Association of Engineering Decision) and TORS (Tunisian Operations Research Society) associations