A two-phase heuristic algorithm to solve the large-scale vehicle routing problem

During the past several decades, many researchers in the world have been studying Vehicle Routing Problem (VRP), and many kinds of solutions have been presented. It is very important to select an appropriate algorithm to solve VRP in practice. In developed countries, some research achievements have been applied in many fields, such as mailing newspapers, multiple-shops distributing, etc. However, relative research and application in this field are comparatively lagged in China.