Prof. Mhand Hifi

Université de Picardie Jules Verne, France

Professor

Email: mhand.hifi@u-picardie.fr

Qualifications

1994 Ph.D., Computer Science, Universit´e Paris 1 Panth´eon-Sorbonne, France

1991 M.Sc., Modeling and Mathematical Modeling in Economics, Universit´e de Paris 1 - Ecole Polytechnique, France

Publications (Selected)

1. Zhao, J., Hifi, M., & Latrem, K. (2025). Hybrid particle swarm optimization and skewed variable neighborhood search techniques for the generalized max-mean dispersion problem. Optimization and Engineering, 1-41.
2. Aïder, M., Boulebene, S., & Hifi, M. (2025). An adaptative multi-objective scatter search for solving the dynamic bin packing problem. Journal of Heuristics, 31(1), 1-69.
3. Zhao, J., & Hifi, M. (2024). A reinforcement learning-driven cooperative scatter search for the knapsack problem with forfeits. Computers & Industrial Engineering, 198, 110713.
4. Zhao, J., & Hifi, M. (2024). An adaptive evolutionary search-based method for efficiently tackling the set-union knapsack problem. Information Sciences, 676, 120855.
5. Zhao, J., Hifi, M., Zhang, Y., & Luo, X. (2024). An incremental method-based machine learning approach for max–min knapsack with multiple scenarios. Computers & Industrial Engineering, 190, 109984.
6. Baatout, F. Z., & Hifi, M. (2023). A two-phase hybrid evolutionary algorithm for solving the bi-objective scheduling multiprocessor tasks on two dedicated processors. Journal of Heuristics, 29(2), 229-267.
7. Hifi, M., Mohamed-Youssouf, A., & Yousef, L. (2023). A threshold search-based population algorithm for the sphere packing problem. Knowledge-Based Systems, 261, 110177.
8. Aïder, M., Hifi, M., & Latram, K. (2022, November). A cooperative population-based method for solving the max-min knapsack problem with multi-scenarios. In 2022 9th International Conference on Soft Computing & Machine Intelligence (ISCMI) (pp. 118-123). IEEE.
9. Dahmani, I., Ferroum, M., & Hifi, M. (2022). The local branching as a learning strategy in the evolutionary algorithm: The case of the set-union Knapsack problem. Journal of Advances in Information Technology Vol, 13(3).
10. Aider, M., Gacem, O., & Hifi, M. (2022). A hybrid population-based algorithm for the bi-objective quadratic multiple knapsack problem. Expert Systems with Applications, 191, 116238.
11. Aïder, M., Gacem, O., & Hifi, M. (2022). Branch and solve strategies-based algorithm for the quadratic multiple knapsack problem. Journal of the Operational Research Society, 73(3), 540-557.
12. Dahmani, I., Ferroum, M., & Hifi, M. (2022). Effect of backtracking strategy in population-based approach: the case of the set-union knapsack problem. Cybernetics and Systems, 53(1), 168-185.
13. Hifi, M., & Sadeghsa, S. (2022). Effect of local branching on the iterative rounding-based method: The case of k-clustering minimum completion problems. Cybernetics and Systems, 53(1), 58-79.
14. Boukhari, S., Dahmani, I., & Hifi, M. (2022). Computational power of a hybrid algorithm for solving the multiple knapsack problem with setup. In Intelligent Computing: Proceedings of the 2021 Computing Conference, Volume 1 (pp. 154-168). Springer International Publishing.
15. Dahmani, I., Ferroum, M., & Hifi, M. (2021). An iterative rounding strategy-based algorithm for the set-union knapsack problem. Soft Computing, 25(21), 13617-13639.

Profile Details

https://www.u-picardie.fr/eproad/?page_id=686

https://scholar.google.com/citations?user=BwaanwUAAAAJ&hl=fr

https://www.researchgate.net/profile/Mhand-Hifi/3