Optimization of the multi-depot & Multi-vehicle pickup and delivery problem with time windows using genetic algorithm

In This paper we present a genetic algorithm (GA) for Multi-vehicle and multi-depots pickup and delivery problem with time windows (m-MDPDPTW). The m-MDPDPTW is a class of vehicles routing problem which must construct a set of routes in order to satisfy transportation requests, between the origins nodes (pickup customers) and the destination nodes (delivery customers), satisfying precedence, capacity and time constraints. Each load has to be transported by one of the vehicles, between pickup and delivery customers. We are assuming that all vehicles have the same capacity and each one start and finish route at the same depot. We present, in this paper, a brief literature review of the MDPDPTW and construct a mathematical model of the above problem. We present our approach based on genetic algorithms to give a set of feasible solutions to the m-MDPDPTW minimizing total travel distance.