A two-phase greedy strategy in one to many PDVRP

The extension class of the traditional vehicle routing problem, where there are several tasks in a goods transportation and goods are transported from one pickup point to many delivery points in each task, is studied in order to schedule vehicle routes with the lowest cost. A two-phase greedy strategy was put forward based on one to many pickup and delivery vehicle routing problem. The inner routing of a task was established in the first phase, and the routing between tasks was scheduled in the second phase. The mathematical model was set up under the single depot and sole vehicle model, and with the mileage limit and time window constraints. The experiment results show that two-phase greedy strategy is feasible and effective and also it can get better optimal results in mileage and cost saving than the improved clarke-wright algorithm.