A Memetic Algorithm for the Multi Depot Vehicle Routing Problem with Limited Stocks
The Vehicle Routing Problem (VRP) is one of important combinatorial problems, which holds a central place in logistics management. One of the most widely studied problems in the VRP family is the MultiDepot Vehicle Routing Problem (MDVRP) where more than one depot is considered. In this chapter, the authors focus on a new extension of the MDVRP in which goods loaded by the vehicle are restricted due to limited stocks available at warehouses. More specifically, this extension consists in determining a least cost routing plan that can satisfy all the customs demands by delivering available stocks. Indeed, this problem is often encountered when goods are shortage in some warehouses. To deal with the problem efficiently, a memetic algorithm is proposed in this chapter. The authors study this approach on a set of modified benchmark instances and compare its performance to a pure genetic algorithm.