For many applications of vehicle routing, there is still a large gap between the requirements and the performance of today's decision support systems. Although there has been a tremendous increase in the ability to solve ever more complex VRPs (partly due to methodological improvements, partly due to the general increase in computing power), the ability to consistently provide better routing plans in shorter time across a variety of instances will give substantial additional savings.

In this paper, we propose a new parallel metaheuristic on GPU called Parallel Bees Life Algorithm (P-BLA)to solve DCVRP problem in order to surmount complexity of conventional metaheuristics and to make computational time of routes dynamically found very acceptable.