Selected Publications

We present a simulated annealing based algorithm for a variant of the vehicle routing problem (VRP), in which a time window is associated with each client service and some services require simultaneous visits from different vehicles to be accomplished. The problem is called the VRP with time windows and synchronized visits. The algorithm features a set of local improvement methods to deal with various objectives of the problem. Experiments conducted on the benchmark instances from the literature clearly show that our method is fast and outperforms the existing approaches. It produces all known optimal solutions of the benchmark in very short computational times, and improves the best results for the rest of the instances.
In OptLet, 2015.

This dissertation focuses on vehicle routing problems, one of the major academic problems in logistics. We address NP-Hard problems that model some real world situations particularly those with different temporal constraints including time windows, visit synchronization and service balance. The aim of this research is to develop new algorithms for the considered problems, investigate their performance and compare them with the literature approaches. Two cases are carried out. The first case studies the Vehicle Routing Problem with Time Windows (VRPTW). We propose new lower bound methods for the number of vehicles. Then we present a Particle Swarm Optimization algorithm dealing with the Solomon objective. The second case studies the Vehicle Routing Problem with Time Windows and Synchronized Visits (VRPTWsyn). Both exact methods and heuristics are proposed and compared to the literature approaches.
In Université de Technologie de Compiègne, 2014.

Recent Publications

More Publications

. A multi-objective modelling to sustainable vehicle routing problem in home health care services: goal programming approach. In GSC, 2016.


. An Integrated Inventory Location Routing Problem Considering CO2 Emissions. In Contemporary Engineering Sciences, 2016.

Preprint PDF

. Problèmes de Tournées de Véhicules avec Synchronisation de Ressources. In Université de Technologie de Compiègne, 2014.



I am a teaching instructor for the following courses at:

  • University Institutes of Technology of Béthune (since 2015):

    • M1101 – Introduction to networking
    • M1104 – Network architecture
    • M1207 – Programming basics
    • M2101 – LANs and CISCO equipments
    • M2102 – Internet Technology
    • M2103 – Virtualization
    • M2104 – Data bases
    • M2106 – Network services
  • Ecole des Hautes Etudes des Sciences et Techniques de l’Ingénierie et du Management, HESTIM (since 2016):

    • Linear programming
    • Metaheuristics
  • Engineering School of the University of Technology of Compiègne (2012-2015)

    • NF 16 – Algorithm and data structures
    • NF 92 – Automatic data processing
    • SR 01 – Mastering Operating Systems
    • LO 21 – Object oriented Programming with C++
    • NF 17 – Data bases