MULTI-COMPARTMENT VEHICLES FOR SPLIT PICK-UP AND SPLIT DELIVERY PROBLEM WITH TIME WINDOW

Abstract

In this article, we'll look at multi-compartment vehicles, which collect goods from suppliers and deliver them to different customers who place large orders. Because some products are incompatible with each other, these goods cannot be transported by single-compartment vehicles. In addition, because customers can place large orders, some suppliers and/or customers may be visited several times by different vehicles. In this work, the aim is to satisfy a group of customers while respecting the constraints linked to the capacity of each compartment and each type of product, and to ensure that each supplier is visited before the customer. Our first step is to model our problem mathematically and then solve it using an approximate method. Given its complexity, we use the genetic algorithm to solve the problem of split pick-up and delivery with time windows by multi-compartment vehicles. Our model allows us to determine a minimum distance and a minimum cost using a reasonable number of vehicles.