Walid Khaznaji
Papers
2
Total Citations
4
H-Index
2
About
Walid Khaznaji is a researcher focused on combinatorial optimization and parallel computing, with a particular emphasis on solving complex routing problems. His key research area centers on the Probabilistic Traveling Salesman Problem (PTSP), a variant of the classic TSP that incorporates uncertainty into real-world logistics and network design. Khaznaji’s major contribution lies in developing a novel parallel Tabu Search algorithm that operates efficiently under the OpenMP-MPI hybrid environment, enabling high-performance computing to tackle large-scale PTSP instances. This work demonstrates how probabilistic elements can be integrated into deterministic models to better reflect real-world scenarios, such as transportation and supply chain challenges. While his most-cited paper has garnered 2 citations, its significance lies in its methodological innovation—bridging metaheuristic search with parallel architectures to improve solution speed and robustness. Khaznaji’s research offers valuable insights for students and practitioners in operations research, computer science, and engineering, highlighting the practical benefits of combining probabilistic modeling with advanced parallel algorithms for solving NP-hard problems.
Research Focus
Key Achievements
Top Papers
- 1
- 2