A Memetic Algorithm to Solve the Two-Echelon Collaborative Multi-Centre Multi-Periodic Vehicle Routing Problem with Specific Constraints

The collaboration between distribution companies is gaining a great interest in the last years due to the benefit provided to reduce the cost of deliveries. In this work we study the centralized two-echelon collaborative multi-center multi-periodic vehicle routing problem with a specific constraints. In which each distribution center conserves its VIP customers, and each partner keep their delivery scheduling unchangeable. The problem is modelled as a MILP, and to solve it a hybrid algorithm is proposed. This algorithm combines a multi-population memetic algorithm (MPMA) and a variable neighbourhood search algorithm that integrates a tabu search list (VNS-T). The results obtained are compared with those obtained by CPLEX solver and the best known solution of the multi-depot vehicle routing problem (MDVRP).

@article{Snoussi2023,
  title     = {A Memetic Algorithm to Solve the Two-Echelon Collaborative Multi-Centre Multi-Periodic Vehicle Routing Problem with Specific Constraints},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {14},
  number    = {12},
  year      = {2023},
  publisher = {The Science and Information Organization},
  author    = {Camelia Snoussi and Abdellah El Fallahi and Sarir Hicham},
  doi       = {10.14569/IJACSA.2023.0141296},
  url       = {https://doi.org/10.14569/IJACSA.2023.0141296}
}