Multi-Depots Vehicle Routing Problem with Simultaneous Delivery and Pickup and Inventory Restrictions: Formulation and Resolution

Reverse logistics can be defined as a set of practices and processes for managing returns from the consumer to the manufacturer, simultaneously with direct flow management. In this context, we have chosen to study an important variant of the Vehicle Routing Problem (VRP) which is the Multi-Depot Vehicle Routing Problem with Simultaneous Delivery and Pickup and Inventory Restrictions (MD-VRPSDP-IR). This problem involves designing routes from multiple depots that simultaneously satisfy delivery and pickup requests from a set of customers, while taking into account depot stock levels. This study proposes a hybrid Genetic Algorithm which incorporates three different procedures, including a newly developed one called the K- Nearest Depot heuristic, to assign customers to depots and also the Sweep algorithm for routes construction, and the Farthest Insertion heuristic to improve solutions. Computational results show that our methods outperform the previous ones for MD-VRPSDP.

@article{Khaoula2019,
  title     = {Multi-Depots Vehicle Routing Problem with Simultaneous Delivery and Pickup and Inventory Restrictions: Formulation and Resolution},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {10},
  number    = {2},
  year      = {2019},
  publisher = {The Science and Information Organization},
  author    = {BOUANANE Khaoula and BENADADA Youssef and BENCHEIKH Ghizlane},
  doi       = {10.14569/IJACSA.2019.0100215},
  url       = {https://doi.org/10.14569/IJACSA.2019.0100215}
}