Distributed approach for vehicle routing problem in disaster case

The present study aims to solve the vehicle routing problem in disaster case. We have decomposed such problem into two parts; the first one concerns the vehicle routing planning to serve several requests, while, the second one concerns the treatment of an eventual event including the arrival of a new demand and the appearance of a disturbance. Besides, we proposed a multi-agents approach using a genetic algorithm for scheduling vehicle routing and local search for the management of an eventual event. The proposed approach was tested with the modified Solomon benchmarks and gave good results.