A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
As we all know, there are a great number of optimization problems in the world. One of the relatively complicated and high-level problems is the vehicle routing problem (VRP). Dynamic vehicle routing problem (DVRP) is a major variant of VRP, and it is closer to real logistic scene. In DVRP, the customers' demands appear with time, and the unserved customers' points must be updated and rearranged while carrying out the programming paths. Owing to the complexity and significance of the problem,doi:10.1155/2018/1295485 fatcat:rs3vnwjeyndfvgoe5nj7lilwhu