Modeling of multi depot vehicle routing problem for petroleum products

Аннотация

The paper is devoted to modeling multi depot vehicle routing problem (VRP) with capacity constraints for petroleum products delivery. Applying efficient metaheuristics algorithms combined with local search procedures, we present how to get suboptimal solutions for this NP-hard problem in an acceptable time. Some parallel computing techniques are also used to reduce the execution time. Experimental results are performed by the case of VRP for petroleum products.